<?xml version='1.0' encoding='UTF-8'?><?xml-stylesheet href="http://www.blogger.com/styles/atom.css" type="text/css"?><feed xmlns='http://www.w3.org/2005/Atom' xmlns:openSearch='http://a9.com/-/spec/opensearchrss/1.0/' xmlns:georss='http://www.georss.org/georss' xmlns:gd='http://schemas.google.com/g/2005' xmlns:thr='http://purl.org/syndication/thread/1.0'><id>tag:blogger.com,1999:blog-5421724970421145860</id><updated>2011-11-28T08:06:16.045+08:00</updated><category term='C++'/><category term='优化'/><category term='IDE'/><category term='C'/><title type='text'>OI点滴</title><subtitle type='html'></subtitle><link rel='http://schemas.google.com/g/2005#feed' type='application/atom+xml' href='http://oinote.blogspot.com/feeds/posts/default'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5421724970421145860/posts/default?max-results=100'/><link rel='alternate' type='text/html' href='http://oinote.blogspot.com/'/><link rel='hub' href='http://pubsubhubbub.appspot.com/'/><author><name>Prism</name><uri>http://www.blogger.com/profile/18359064014027244720</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='22' height='32' src='http://lh5.google.com/image/kzy.Prism/RfOuJP1pDrI/AAAAAAAAAUU/MBDCUQ4sB28/4.JPG'/></author><generator version='7.00' uri='http://www.blogger.com'>Blogger</generator><openSearch:totalResults>5</openSearch:totalResults><openSearch:startIndex>1</openSearch:startIndex><openSearch:itemsPerPage>100</openSearch:itemsPerPage><entry><id>tag:blogger.com,1999:blog-5421724970421145860.post-597822686931278690</id><published>2007-06-09T18:35:00.000+08:00</published><updated>2007-06-09T18:49:24.834+08:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='C'/><category scheme='http://www.blogger.com/atom/ns#' term='C++'/><title type='text'>输出自己的代码(Print Out Your SourceCode)</title><content type='html'>和OI没什么太大关系，算是熟悉语言了。&lt;br /&gt;很久以前就看到了这个问题，看网上流传比较广的是这一段代码：&lt;br /&gt;&lt;blockquote&gt;#include &amp;lt;stdio.h&amp;gt;&lt;br /&gt;char*f="#include &amp;lt;stdio.h&amp;gt;%cchar*f=%c%s%c;%cint main(){printf(f,10,34,f,34,10,10);return 0;}%c";&lt;br /&gt;int main(){printf(f,10,34,f,34,10,10);return 0;}&lt;/blockquote&gt;仔细看看就知道这个方法其实挺简单。我自己先了一个方法，用C/C++的宏__FILE__，这个方法貌似比较BT，具体C/C++怎么实现的这个宏我也不太清楚，哪位高人指点一下？&lt;br /&gt;&lt;blockquote&gt;#include &amp;lt;fstream&amp;gt;&lt;br /&gt;&lt;br /&gt;using namespace std;&lt;br /&gt;&lt;br /&gt;int main()&lt;br /&gt;{&lt;br /&gt;    ifstream fin(__FILE__);&lt;br /&gt;    ofstream fout("out.cpp");&lt;br /&gt;    char temp;&lt;br /&gt;    while (!fin.eof())&lt;br /&gt;    {&lt;br /&gt;        fin.get(temp);&lt;br /&gt;&lt;br /&gt;        fout&amp;lt;&amp;lt;temp;&lt;br /&gt;    }&lt;br /&gt;    return 0;&lt;br /&gt;} &lt;/blockquote&gt;到网上一找，找到很多更BT的代码，给&lt;a href="http://henryfour.bokee.com/viewdiary.12419735.html"&gt;链接&lt;/a&gt;。&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5421724970421145860-597822686931278690?l=oinote.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://oinote.blogspot.com/feeds/597822686931278690/comments/default' title='帖子评论'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=5421724970421145860&amp;postID=597822686931278690' title='0 条评论'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5421724970421145860/posts/default/597822686931278690'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5421724970421145860/posts/default/597822686931278690'/><link rel='alternate' type='text/html' href='http://oinote.blogspot.com/2007/06/print-out-your-sourcecode.html' title='输出自己的代码(Print Out Your SourceCode)'/><author><name>Prism</name><uri>http://www.blogger.com/profile/18359064014027244720</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='22' height='32' src='http://lh5.google.com/image/kzy.Prism/RfOuJP1pDrI/AAAAAAAAAUU/MBDCUQ4sB28/4.JPG'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5421724970421145860.post-3835077126254705755</id><published>2007-05-06T17:03:00.000+08:00</published><updated>2007-05-06T17:17:34.819+08:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='IDE'/><title type='text'>NOIP竞赛语言和评测平台</title><content type='html'>&lt;blockquote&gt;NOIP2005比赛环境规范依照兼顾Windows、Linux平台、统一编译器、提供多种集成开发环境选择的原则制定。&lt;br /&gt;NOIP2005 比赛环境中，操作系统平台可依各地的实际情况选择Windows或者Linux；在固定的操作平台下，对应不同的语言，使用统一的编译器，消除编译器不同 给选手带来的不利影响；对应每种语言，提供了多种集成开发环境，选手可以根据自己的习惯选择集成开发环境。&lt;br /&gt;在全国测评时，评测环境保持与比赛环境的操作系统及编译器一致。也就是说全国评测时，使用与选手比赛时一致的平台对选手的程序进行评测，以消除平台不一致带来的不利影响。&lt;br /&gt;以下是NOIP2005比赛环境要求的详细描述：  1、使用Windows操作系统平台：&lt;br /&gt;1）Windows操作系统必须使用Windows2000、Windows XP及更新的Windows版本；&lt;br /&gt;2）Pascal语言，必须使用Free Pascal 1.0.10及以上版本作为编译器；&lt;br /&gt;3）C语言，必须使用gcc.3.4.2作为编译器；&lt;br /&gt;4）C++语言，必须使用g++ 3.4.2作为编译器；&lt;br /&gt;5）Pascal语言，可以使用Freepascal IDE Windows版、Lazarus Windows版、Dev-Pascal作为集成开发环境，推荐使用Lazarus Windows版；&lt;br /&gt;6）C和C++语言，可以使用Dev-C++、RHIDE Windows版作为集成开发环境，推荐使用Dev-C++；&lt;br /&gt;2、使用Linux操作系统平台：&lt;br /&gt;1）Linux操作系统必须使用Red Hat Linux 9.0，安装时必须安装Red Hat Linux 9.0自带的开发工具包；&lt;br /&gt;2）Pascal语言，必须使用Free Pascal 1.0.10及以上版本作为编译器；&lt;br /&gt;3）C语言，必须使用gcc.3.2.2作为编译器；&lt;br /&gt;4）C++语言，必须使用g++ 3.2.2作为编译器；&lt;br /&gt;5）Pascal语言，可以使用Lazarus Linux版、RHIDE Linux作为集成开发环境，推荐使用Lazarus Windows版；&lt;br /&gt;6）C和C++语言，可以使用RHIDE Linux版、KDevelop、Anjuta作为集成开发环境，推荐使用Anjuta；&lt;/blockquote&gt;&lt;br /&gt;&lt;br /&gt;这个是2005年的，做个参考。&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5421724970421145860-3835077126254705755?l=oinote.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://oinote.blogspot.com/feeds/3835077126254705755/comments/default' title='帖子评论'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=5421724970421145860&amp;postID=3835077126254705755' title='0 条评论'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5421724970421145860/posts/default/3835077126254705755'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5421724970421145860/posts/default/3835077126254705755'/><link rel='alternate' type='text/html' href='http://oinote.blogspot.com/2007/05/noip.html' title='NOIP竞赛语言和评测平台'/><author><name>Prism</name><uri>http://www.blogger.com/profile/18359064014027244720</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='22' height='32' src='http://lh5.google.com/image/kzy.Prism/RfOuJP1pDrI/AAAAAAAAAUU/MBDCUQ4sB28/4.JPG'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5421724970421145860.post-5582471371707975538</id><published>2007-04-28T21:32:00.000+08:00</published><updated>2007-04-28T21:33:34.257+08:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='优化'/><title type='text'>从最大子段和问题看算法的优化问题</title><content type='html'>有版权的东西就不贴过来了，给链接……&lt;br /&gt;&lt;a href="http://blog.csdn.net/linyt/archive/2005/12/20/557552.aspx"&gt;http://blog.csdn.net/linyt/archive/2005/12/20/557552.aspx&lt;/a&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5421724970421145860-5582471371707975538?l=oinote.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://oinote.blogspot.com/feeds/5582471371707975538/comments/default' title='帖子评论'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=5421724970421145860&amp;postID=5582471371707975538' title='0 条评论'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5421724970421145860/posts/default/5582471371707975538'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5421724970421145860/posts/default/5582471371707975538'/><link rel='alternate' type='text/html' href='http://oinote.blogspot.com/2007/04/blog-post.html' title='从最大子段和问题看算法的优化问题'/><author><name>Prism</name><uri>http://www.blogger.com/profile/18359064014027244720</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='22' height='32' src='http://lh5.google.com/image/kzy.Prism/RfOuJP1pDrI/AAAAAAAAAUU/MBDCUQ4sB28/4.JPG'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5421724970421145860.post-7599307091984198360</id><published>2007-03-30T20:39:00.000+08:00</published><updated>2007-03-30T20:57:20.567+08:00</updated><category scheme='http://www.blogger.com/atom/ns#' term='C'/><category scheme='http://www.blogger.com/atom/ns#' term='C++'/><title type='text'>C++ 除号（/）和取余（%）操作符 vs 负数</title><content type='html'>当C++ 除号（/）和取余（%）操作符遇到负数的时候，就会有奇异的事情发生……&lt;br /&gt;&lt;blockquote&gt;如果两个操作数为正，除法和取模操作的操作的结果也是正数（或零）；如果两个操作数都为负数，除法的操作的结果也为正数（或零），而求模操作的结果则为负数（或零）；如果只有一个操作数为负，这两种操作的结果取决于机器；求模结果的符号也取决于机器，而除法操作的值则是负数（或零）：&lt;br /&gt;&lt;br /&gt;&lt;div style="text-align: right;"&gt;C++ Primer中文第四版130页&lt;/div&gt;&lt;/blockquote&gt;&lt;div style="text-align: right;"&gt;&lt;br /&gt;&lt;/div&gt;底下有几个例子，略去了。大概是说，21%-5可以等于1或-4，21/-5可以等于-4或-5。&lt;br /&gt;在gcc(Linux版，Windows应该也一样)下试了一下：&lt;br /&gt;21%-5=1&lt;br /&gt;21/-5=-4&lt;br /&gt;就是说，取余操作的符号取决于分子，结果向零一侧取整，除法的结果直接把小数截去。&lt;br /&gt;USACO上一个题（Broken Necklace&lt;b&gt;&lt;span style="font-size:7;"&gt;&lt;/span&gt;&lt;/b&gt;）需要mod函数，他是这样解决的：&lt;br /&gt;&lt;pre&gt;&lt;blockquote&gt;&lt;pre&gt;/*&lt;br /&gt;* Return n mod m.  The C % operator is not enough because&lt;br /&gt;* its behavior is undefined on negative numbers.&lt;br /&gt;*/&lt;br /&gt;int&lt;br /&gt;mod(int n, int m)&lt;br /&gt;{&lt;br /&gt;   while(n &lt; 0)&lt;br /&gt; n += m;&lt;br /&gt;   return n%m;&lt;br /&gt;}&lt;/pre&gt;&lt;/blockquote&gt;&lt;/pre&gt;&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5421724970421145860-7599307091984198360?l=oinote.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://oinote.blogspot.com/feeds/7599307091984198360/comments/default' title='帖子评论'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=5421724970421145860&amp;postID=7599307091984198360' title='0 条评论'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5421724970421145860/posts/default/7599307091984198360'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5421724970421145860/posts/default/7599307091984198360'/><link rel='alternate' type='text/html' href='http://oinote.blogspot.com/2007/03/c-vs.html' title='C++ 除号（/）和取余（%）操作符 vs 负数'/><author><name>Prism</name><uri>http://www.blogger.com/profile/18359064014027244720</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='22' height='32' src='http://lh5.google.com/image/kzy.Prism/RfOuJP1pDrI/AAAAAAAAAUU/MBDCUQ4sB28/4.JPG'/></author><thr:total>0</thr:total></entry><entry><id>tag:blogger.com,1999:blog-5421724970421145860.post-6938084995749046930</id><published>2007-03-30T20:10:00.000+08:00</published><updated>2007-03-30T20:11:19.030+08:00</updated><title type='text'>begin</title><content type='html'>在这里写下OI过程中的点点滴滴……&lt;div class="blogger-post-footer"&gt;&lt;img width='1' height='1' src='https://blogger.googleusercontent.com/tracker/5421724970421145860-6938084995749046930?l=oinote.blogspot.com' alt='' /&gt;&lt;/div&gt;</content><link rel='replies' type='application/atom+xml' href='http://oinote.blogspot.com/feeds/6938084995749046930/comments/default' title='帖子评论'/><link rel='replies' type='text/html' href='http://www.blogger.com/comment.g?blogID=5421724970421145860&amp;postID=6938084995749046930' title='0 条评论'/><link rel='edit' type='application/atom+xml' href='http://www.blogger.com/feeds/5421724970421145860/posts/default/6938084995749046930'/><link rel='self' type='application/atom+xml' href='http://www.blogger.com/feeds/5421724970421145860/posts/default/6938084995749046930'/><link rel='alternate' type='text/html' href='http://oinote.blogspot.com/2007/03/begin.html' title='begin'/><author><name>Prism</name><uri>http://www.blogger.com/profile/18359064014027244720</uri><email>noreply@blogger.com</email><gd:image rel='http://schemas.google.com/g/2005#thumbnail' width='22' height='32' src='http://lh5.google.com/image/kzy.Prism/RfOuJP1pDrI/AAAAAAAAAUU/MBDCUQ4sB28/4.JPG'/></author><thr:total>0</thr:total></entry></feed>
