﻿<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/"><channel><title>C++博客-算法学社-随笔分类-解题报告</title><link>http://www.cppblog.com/hanfei19910905/category/19190.html</link><description>記錄難忘的征途</description><language>zh-cn</language><lastBuildDate>Sat, 14 Sep 2013 00:46:42 GMT</lastBuildDate><pubDate>Sat, 14 Sep 2013 00:46:42 GMT</pubDate><ttl>60</ttl><item><title>【奋战2013regional】Guass消元的一些应用（坑）</title><link>http://www.cppblog.com/hanfei19910905/archive/2013/09/14/203230.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Fri, 13 Sep 2013 17:13:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2013/09/14/203230.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/203230.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2013/09/14/203230.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/203230.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/203230.html</trackback:ping><description><![CDATA[0。Guass消元的方法<br />Guass消元可以求矩阵的秩，行列式，逆元，解方程组等等。<br />矩阵的值可以是整数 or 浮点数。<br />对于解方程组来说，x1 + x2 + ... mod m = b 用主列消元法，需要求逆元。<br />如果是浮点数，可以用迭代法（spfa），在姜碧野的论文里有讲。<br /><br /><br />1。利用Guass消元解决计数问题<br /><br />这一类我掌握的不好，一般来讲是求方程组的解的个数。<br />当然应该只对 x1 + x2 + ... + xn mod m = b 这样的整数方程组有效了。<br />srm 590 div1 500就是典型的例子，在n个数中挑选一些数，让其xor值小于等于limit。<br />这个问题和等于是等价的。至于等于怎么求，就是方程组的解数了。和自由元的个数相关。<br /><br /><div style="background-color:#eeeeee;font-size:13px;border:1px solid #CCCCCC;padding-right: 5px;padding-bottom: 4px;padding-left: 4px;padding-top: 4px;width: 98%;word-break:break-all"><img id="Code_Closed_Image_011147" onclick="this.style.display='none'; Code_Closed_Text_011147.style.display='none'; Code_Open_Image_011147.style.display='inline'; Code_Open_Text_011147.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ContractedBlock.gif" align="top" height="16" width="11"><img id="Code_Open_Image_011147" style="display: none" onclick="this.style.display='none'; Code_Open_Text_011147.style.display='none'; Code_Closed_Image_011147.style.display='inline'; Code_Closed_Text_011147.style.display='inline';" src="http://www.cppblog.com/images/OutliningIndicators/ExpandedBlockStart.gif" align="top" height="16" width="11"><span id="Code_Closed_Text_011147" style="border-right: #808080 1px solid; border-top: #808080 1px solid; border-left: #808080 1px solid; border-bottom: #808080 1px solid; background-color: #ffffff">srm 590div1 500pt</span><span id="Code_Open_Text_011147" style="display: none"><br /><!--<br /><br />Code highlighting produced by Actipro CodeHighlighter (freeware)<br />http://www.CodeHighlighter.com/<br /><br />--><span style="color: #008080; ">&nbsp;1</span>&nbsp;<span style="color: #000000; ">#include</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">iostream</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; "><br /></span><span style="color: #008080; ">&nbsp;2</span>&nbsp;<span style="color: #000000; ">#include</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">vector</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; "><br /></span><span style="color: #008080; ">&nbsp;3</span>&nbsp;<span style="color: #000000; "></span><span style="color: #0000FF; ">using</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">namespace</span><span style="color: #000000; ">&nbsp;std;<br /></span><span style="color: #008080; ">&nbsp;4</span>&nbsp;<span style="color: #000000; ">typedef&nbsp;</span><span style="color: #0000FF; ">long</span><span style="color: #000000; ">&nbsp;</span><span style="color: #0000FF; ">long</span><span style="color: #000000; ">&nbsp;ll;<br /></span><span style="color: #008080; ">&nbsp;5</span>&nbsp;<span style="color: #000000; ">typedef&nbsp;vector</span><span style="color: #000000; ">&lt;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;Vec;<br /></span><span style="color: #008080; ">&nbsp;6</span>&nbsp;<span style="color: #000000; ">typedef&nbsp;vector</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">Vec</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;Mat;<br /></span><span style="color: #008080; ">&nbsp;7</span>&nbsp;<span style="color: #000000; ">ll&nbsp;Guass(vector</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">ll</span><span style="color: #000000; ">&gt;&amp;</span><span style="color: #000000; ">&nbsp;number,ll&nbsp;limit)<br /></span><span style="color: #008080; ">&nbsp;8</span>&nbsp;<span style="color: #000000; ">{<br /></span><span style="color: #008080; ">&nbsp;9</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;m&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;number.size();<br /></span><span style="color: #008080; ">10</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;Mat&nbsp;matrix(</span><span style="color: #000000; ">50</span><span style="color: #000000; ">,Vec(m</span><span style="color: #000000; ">+</span><span style="color: #000000; ">1</span><span style="color: #000000; ">));<br /></span><span style="color: #008080; ">11</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;i&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;&nbsp;i&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">50</span><span style="color: #000000; ">;&nbsp;i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">){<br /></span><span style="color: #008080; ">12</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;j&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;&nbsp;j&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;m;&nbsp;j</span><span style="color: #000000; ">++</span><span style="color: #000000; ">){<br /></span><span style="color: #008080; ">13</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;matrix[i][j]&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">!!</span><span style="color: #000000; ">(1LL&nbsp;</span><span style="color: #000000; ">&lt;&lt;</span><span style="color: #000000; ">&nbsp;i&nbsp;</span><span style="color: #000000; ">&amp;</span><span style="color: #000000; ">&nbsp;number[j]);<br /></span><span style="color: #008080; ">14</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br /></span><span style="color: #008080; ">15</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;matrix[i][m]&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">!!</span><span style="color: #000000; ">(1LL&nbsp;</span><span style="color: #000000; ">&lt;&lt;</span><span style="color: #000000; ">&nbsp;i&nbsp;</span><span style="color: #000000; ">&amp;</span><span style="color: #000000; ">&nbsp;limit);<br /></span><span style="color: #008080; ">16</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;}<br /></span><span style="color: #008080; ">17</span>&nbsp;<span style="color: #000000; "><br /></span><span style="color: #008080; ">18</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;free&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">,line&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br /></span><span style="color: #008080; ">19</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;row&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;&nbsp;row&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;m&nbsp;;&nbsp;row</span><span style="color: #000000; ">++</span><span style="color: #000000; ">){<br /></span><span style="color: #008080; ">20</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;p&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;<br /></span><span style="color: #008080; ">21</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;i&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;line;&nbsp;i&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">50</span><span style="color: #000000; ">;&nbsp;i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(matrix[i][row]){<br /></span><span style="color: #008080; ">22</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;p&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;i;<br /></span><span style="color: #008080; ">23</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br /></span><span style="color: #008080; ">24</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(</span><span style="color: #000000; ">-</span><span style="color: #000000; ">1</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;p){<br /></span><span style="color: #008080; ">25</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;free&nbsp;</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;<br /></span><span style="color: #008080; ">26</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">continue</span><span style="color: #000000; ">;<br /></span><span style="color: #008080; ">27</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br /></span><span style="color: #008080; ">28</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;swap(matrix[line],matrix[p]);<br /></span><span style="color: #008080; ">29</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;i&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;line&nbsp;</span><span style="color: #000000; ">+</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">;&nbsp;i&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">50</span><span style="color: #000000; ">;&nbsp;i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(matrix[i][row]){<br /></span><span style="color: #008080; ">30</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;p&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;&nbsp;p&nbsp;</span><span style="color: #000000; ">&lt;=</span><span style="color: #000000; ">&nbsp;m;&nbsp;p</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br /></span><span style="color: #008080; ">31</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;matrix[i][p]&nbsp;</span><span style="color: #000000; ">^=</span><span style="color: #000000; ">&nbsp;matrix[line][p];<br /></span><span style="color: #008080; ">32</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br /></span><span style="color: #008080; ">33</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<br /></span><span style="color: #008080; ">34</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;line&nbsp;</span><span style="color: #000000; ">++</span><span style="color: #000000; ">;<br /></span><span style="color: #008080; ">35</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;}<br /></span><span style="color: #008080; ">36</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;i&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;line;&nbsp;i&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">50</span><span style="color: #000000; ">;&nbsp;i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)<br /></span><span style="color: #008080; ">37</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(</span><span style="color: #000000; ">1</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">==</span><span style="color: #000000; ">&nbsp;matrix[i][m])<br /></span><span style="color: #008080; ">38</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;<br /></span><span style="color: #008080; ">39</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;cout</span><span style="color: #000000; ">&lt;&lt;</span><span style="color: #000000; ">"</span><span style="color: #000000; ">answer&nbsp;:&nbsp;</span><span style="color: #000000; ">"</span><span style="color: #000000; ">&lt;&lt;</span><span style="color: #000000; ">&nbsp;limit&nbsp;</span><span style="color: #000000; ">&lt;&lt;</span><span style="color: #000000; ">"</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">"</span><span style="color: #000000; ">&lt;&lt;</span><span style="color: #000000; ">free</span><span style="color: #000000; ">&lt;&lt;</span><span style="color: #000000; ">endl;<br /></span><span style="color: #008080; ">40</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;1LL&nbsp;</span><span style="color: #000000; ">&lt;&lt;</span><span style="color: #000000; ">&nbsp;free;<br /></span><span style="color: #008080; ">41</span>&nbsp;<span style="color: #000000; ">}<br /></span><span style="color: #008080; ">42</span>&nbsp;<span style="color: #000000; "></span><span style="color: #0000FF; ">class</span><span style="color: #000000; ">&nbsp;XorCards{<br /></span><span style="color: #008080; ">43</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">public</span><span style="color: #000000; ">&nbsp;:ll&nbsp;numberOfWays(vector</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">ll</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;number,ll&nbsp;limit)<br /></span><span style="color: #008080; ">44</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;{<br /></span><span style="color: #008080; ">45</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;n&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;number.size();<br /></span><span style="color: #008080; ">46</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ll&nbsp;ans&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;Guass(number,limit);<br /></span><span style="color: #008080; ">47</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;i&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;&nbsp;i&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">50</span><span style="color: #000000; ">;&nbsp;i</span><span style="color: #000000; ">++</span><span style="color: #000000; ">)&nbsp;</span><span style="color: #0000FF; ">if</span><span style="color: #000000; ">(1LL</span><span style="color: #000000; ">&lt;&lt;</span><span style="color: #000000; ">i&nbsp;</span><span style="color: #000000; ">&amp;</span><span style="color: #000000; ">&nbsp;limit){<br /></span><span style="color: #008080; ">48</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;vector</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">ll</span><span style="color: #000000; ">&gt;</span><span style="color: #000000; ">&nbsp;vct(n);<br /></span><span style="color: #008080; ">49</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">for</span><span style="color: #000000; ">(</span><span style="color: #0000FF; ">int</span><span style="color: #000000; ">&nbsp;j&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">0</span><span style="color: #000000; ">;&nbsp;j&nbsp;</span><span style="color: #000000; ">&lt;</span><span style="color: #000000; ">&nbsp;n;&nbsp;j</span><span style="color: #000000; ">++</span><span style="color: #000000; ">){<br /></span><span style="color: #008080; ">50</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;vct[j]&nbsp;</span><span style="color: #000000; ">=</span><span style="color: #000000; ">&nbsp;number[j]&nbsp;</span><span style="color: #000000; ">&gt;&gt;</span><span style="color: #000000; ">&nbsp;i;<br /></span><span style="color: #008080; ">51</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br /></span><span style="color: #008080; ">52</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;ans&nbsp;</span><span style="color: #000000; ">+=</span><span style="color: #000000; ">&nbsp;Guass(vct,(limit</span><span style="color: #000000; ">&gt;&gt;</span><span style="color: #000000; ">i)&nbsp;</span><span style="color: #000000; ">-</span><span style="color: #000000; ">&nbsp;</span><span style="color: #000000; ">1</span><span style="color: #000000; ">);<br /></span><span style="color: #008080; ">53</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;}<br /></span><span style="color: #008080; ">54</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;</span><span style="color: #0000FF; ">return</span><span style="color: #000000; ">&nbsp;ans;<br /></span><span style="color: #008080; ">55</span>&nbsp;<span style="color: #000000; ">&nbsp;&nbsp;&nbsp;&nbsp;}<br /></span><span style="color: #008080; ">56</span>&nbsp;<span style="color: #000000; ">};</span></span></div><br />2。开关问题<br /><br />3。求期望<br /><br /><img src ="http://www.cppblog.com/hanfei19910905/aggbug/203230.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2013-09-14 01:13 <a href="http://www.cppblog.com/hanfei19910905/archive/2013/09/14/203230.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>【奋战2013regional】 hdu 1662 计算几何</title><link>http://www.cppblog.com/hanfei19910905/archive/2013/05/06/200015.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Mon, 06 May 2013 06:07:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2013/05/06/200015.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/200015.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2013/05/06/200015.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/200015.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/200015.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 给出一个“一笔画”轨迹，没有线段重叠。求这个轨迹将平面分成了几部分。&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2013/05/06/200015.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/200015.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2013-05-06 14:07 <a href="http://www.cppblog.com/hanfei19910905/archive/2013/05/06/200015.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>uva 12583 可持久化treap</title><link>http://www.cppblog.com/hanfei19910905/archive/2013/03/19/198601.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Tue, 19 Mar 2013 14:15:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2013/03/19/198601.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/198601.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2013/03/19/198601.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/198601.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/198601.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要:  对一个字符串S(初始为空)，有Q次操作(Q<=50,000)，操作分三种： <br>      1. 在某个位置p后面插入一个长度不大于100的字符串。 <br>      2. 删除一段字符[l,r] <br>      3. 输出在第k次操作时，字符串(S_l ... S_r) 插入的字符不超过1,000,000个。&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2013/03/19/198601.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/198601.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2013-03-19 22:15 <a href="http://www.cppblog.com/hanfei19910905/archive/2013/03/19/198601.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>动态规划求解背包类问题(更新中...)</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/12/03/195920.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Mon, 03 Dec 2012 05:40:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/12/03/195920.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/195920.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/12/03/195920.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/195920.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/195920.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 我理解的背包类问题，大概有两类：<br>(1) 在N组物品中，挑选出M个，使得某些性质最优。<br>(2) 在N组物品中，挑选出M个，求并符合某条件的方案数。&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/12/03/195920.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/195920.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-12-03 13:40 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/12/03/195920.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>codeforces 145C DP+数论</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/11/30/195844.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Fri, 30 Nov 2012 10:39:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/11/30/195844.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/195844.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/11/30/195844.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/195844.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/195844.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 给长度为n的数列，(n<1e5)。让你求选择没有相同的lucky number的子序列的方法数 mod 1e9+7。<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/11/30/195844.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/195844.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-11-30 18:39 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/11/30/195844.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>topcoder srm 561 div1</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/11/21/195471.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Wed, 21 Nov 2012 08:02:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/11/21/195471.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/195471.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/11/21/195471.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/195471.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/195471.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: topcoder srm 561 div1&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/11/21/195471.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/195471.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-11-21 16:02 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/11/21/195471.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>2012亚洲区成都现场赛原创题解</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/11/17/195311.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Sat, 17 Nov 2012 15:04:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/11/17/195311.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/195311.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/11/17/195311.html#Feedback</comments><slash:comments>6</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/195311.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/195311.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 2012亚洲区成都现场赛原创题解&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/11/17/195311.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/195311.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-11-17 23:04 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/11/17/195311.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>codeforces #148 (坑。。)</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/11/05/194630.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Mon, 05 Nov 2012 12:25:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/11/05/194630.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/194630.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/11/05/194630.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/194630.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/194630.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: codeforces #148 (坑。。)&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/11/05/194630.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/194630.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-11-05 20:25 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/11/05/194630.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>2012天津赛区原创题解</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/30/194048.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Mon, 29 Oct 2012 16:07:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/30/194048.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/194048.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/30/194048.html#Feedback</comments><slash:comments>8</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/194048.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/194048.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 题目连接<br>http://acm.hdu.edu.cn/search.php?field=problem&key=2012%20Asia%20Tianjin%20Regional%20Contest&source=1&searchmode=source&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/30/194048.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/194048.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-30 00:07 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/30/194048.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>codeforces #147 div2</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/28/193976.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Sun, 28 Oct 2012 08:01:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/28/193976.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/193976.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/28/193976.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/193976.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/193976.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: codeforces #147 div2&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/28/193976.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/193976.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-28 16:01 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/28/193976.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>zju 1113 字符串处理</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/28/193975.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Sun, 28 Oct 2012 07:58:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/28/193975.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/193975.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/28/193975.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/193975.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/193975.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 狗狗四十题第十题&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/28/193975.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/193975.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-28 15:58 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/28/193975.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>poj 3415 SAM</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/25/193853.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Thu, 25 Oct 2012 11:23:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/25/193853.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/193853.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/25/193853.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/193853.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/193853.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 询问两个长度为100,000的字符串，不小于k的公共子串有多少个。&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/25/193853.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/193853.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-25 19:23 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/25/193853.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>topcoder srm 558 div1</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/24/193786.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Wed, 24 Oct 2012 08:22:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/24/193786.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/193786.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/24/193786.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/193786.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/193786.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: topcoder srm 558 div1&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/24/193786.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/193786.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-24 16:22 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/24/193786.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>codeforces #146 div1</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/24/193774.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Wed, 24 Oct 2012 06:13:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/24/193774.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/193774.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/24/193774.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/193774.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/193774.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: codeforces #146 div1&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/24/193774.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/193774.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-24 14:13 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/24/193774.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>topcoder srm 557 div1</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/18/193466.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Thu, 18 Oct 2012 06:00:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/18/193466.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/193466.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/18/193466.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/193466.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/193466.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: topcoder srm 557 div1&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/18/193466.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/193466.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-18 14:00 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/18/193466.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>codeforces #145</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/17/193408.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Wed, 17 Oct 2012 05:47:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/17/193408.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/193408.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/17/193408.html#Feedback</comments><slash:comments>1</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/193408.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/193408.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: codeforces #145&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/17/193408.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/193408.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-17 13:47 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/17/193408.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>poj 2949  spfa求正环</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/10/193132.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Wed, 10 Oct 2012 11:32:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/10/193132.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/193132.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/10/193132.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/193132.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/193132.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 题目描述：<br>   有N个串，两个尾首两个字母相同的串可以连接。求最大均值圈。&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/10/193132.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/193132.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-10 19:32 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/10/193132.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>fzu 2042 数位DP</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/10/193113.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Wed, 10 Oct 2012 06:56:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/10/193113.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/193113.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/10/193113.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/193113.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/193113.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 题目描述：<br>   给出五个数（不超过2^63-1），让你求下面代码的sum值<br>for(ll i = a; i <= b; i++)<br>    for(ll j = c; j<= d; j++)<br>        if((i ^ j) > e)<br>        sum += i^j;<br>&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/10/193113.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/193113.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-10 14:56 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/10/193113.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>codeforces #139</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/08/192998.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Mon, 08 Oct 2012 07:00:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/08/192998.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/192998.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/08/192998.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/192998.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/192998.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: codeforces #139&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/08/192998.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/192998.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-08 15:00 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/08/192998.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>codeforces #140</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/07/192952.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Sun, 07 Oct 2012 08:10:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/07/192952.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/192952.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/07/192952.html#Feedback</comments><slash:comments>10</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/192952.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/192952.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: codeforces #140&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/07/192952.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/192952.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-07 16:10 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/07/192952.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>codeforces #141</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/04/192730.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Wed, 03 Oct 2012 16:51:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/04/192730.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/192730.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/04/192730.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/192730.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/192730.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: codeforces #141&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/04/192730.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/192730.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-04 00:51 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/04/192730.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>codeforces #142</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/03/192701.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Wed, 03 Oct 2012 06:47:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/03/192701.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/192701.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/03/192701.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/192701.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/192701.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: codeforces #142&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/03/192701.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/192701.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-03 14:47 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/03/192701.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>topcoder srm 555 div1 [pratice]</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/02/192680.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Tue, 02 Oct 2012 15:42:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/02/192680.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/192680.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/02/192680.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/192680.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/192680.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: topcoder srm 555 div1 [pratice]&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/02/192680.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/192680.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-02 23:42 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/02/192680.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>topcoder srm 556 div1 [pratice]</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/10/01/192601.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Mon, 01 Oct 2012 14:09:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/10/01/192601.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/192601.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/10/01/192601.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/192601.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/192601.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: topcoder srm 556 div1&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/10/01/192601.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/192601.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-10-01 22:09 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/10/01/192601.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>codeforces #137 div2</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/09/11/190321.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Tue, 11 Sep 2012 13:39:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/09/11/190321.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/190321.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/09/11/190321.html#Feedback</comments><slash:comments>3</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/190321.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/190321.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: codeforces #137 div2&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/09/11/190321.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/190321.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-09-11 21:39 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/09/11/190321.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>hdu 4285 插头DP</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/09/10/190148.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Mon, 10 Sep 2012 13:09:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/09/10/190148.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/190148.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/09/10/190148.html#Feedback</comments><slash:comments>5</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/190148.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/190148.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 求12×12矩阵上的互不嵌套的k个哈密顿回路的方案数。&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/09/10/190148.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/190148.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-09-10 21:09 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/09/10/190148.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>zoj 1063 广搜</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/09/10/190086.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Mon, 10 Sep 2012 03:33:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/09/10/190086.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/190086.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/09/10/190086.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/190086.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/190086.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 狗狗四十题第六题&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/09/10/190086.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/190086.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-09-10 11:33 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/09/10/190086.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>zoj 1060 拓扑排序</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/09/06/189695.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Thu, 06 Sep 2012 06:18:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/09/06/189695.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/189695.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/09/06/189695.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/189695.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/189695.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 狗狗四十题第五题&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/09/06/189695.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/189695.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-09-06 14:18 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/09/06/189695.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>zoj 1043  模拟+表达式解析</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/09/04/189465.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Tue, 04 Sep 2012 12:41:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/09/04/189465.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/189465.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/09/04/189465.html#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/189465.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/189465.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 狗狗四十题第四题&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/09/04/189465.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/189465.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-09-04 20:41 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/09/04/189465.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>zoj 1041  计算几何+扫描线</title><link>http://www.cppblog.com/hanfei19910905/archive/2012/09/04/189436.html</link><dc:creator>西月弦</dc:creator><author>西月弦</author><pubDate>Tue, 04 Sep 2012 08:14:00 GMT</pubDate><guid>http://www.cppblog.com/hanfei19910905/archive/2012/09/04/189436.html</guid><wfw:comment>http://www.cppblog.com/hanfei19910905/comments/189436.html</wfw:comment><comments>http://www.cppblog.com/hanfei19910905/archive/2012/09/04/189436.html#Feedback</comments><slash:comments>2</slash:comments><wfw:commentRss>http://www.cppblog.com/hanfei19910905/comments/commentRss/189436.html</wfw:commentRss><trackback:ping>http://www.cppblog.com/hanfei19910905/services/trackbacks/189436.html</trackback:ping><description><![CDATA[&nbsp;&nbsp;&nbsp;&nbsp; 摘要: 狗狗四十题第三题&nbsp;&nbsp;<a href='http://www.cppblog.com/hanfei19910905/archive/2012/09/04/189436.html'>阅读全文</a><img src ="http://www.cppblog.com/hanfei19910905/aggbug/189436.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/hanfei19910905/" target="_blank">西月弦</a> 2012-09-04 16:14 <a href="http://www.cppblog.com/hanfei19910905/archive/2012/09/04/189436.html#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>