﻿<?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++博客-Residence for sdfond-最新评论</title><link>http://www.cppblog.com/sdfond/CommentsRSS.aspx</link><description>世事洞明皆学问，人情练达即文章</description><language>zh-cn</language><pubDate>Sat, 04 Jul 2015 15:05:24 GMT</pubDate><lastBuildDate>Sat, 04 Jul 2015 15:05:24 GMT</lastBuildDate><generator>cnblogs</generator><item><title>re: 筛法求素数</title><link>http://www.cppblog.com/sdfond/archive/2015/04/27/76775.html#210454</link><dc:creator>sdfond</dc:creator><author>sdfond</author><pubDate>Mon, 27 Apr 2015 10:21:00 GMT</pubDate><guid>http://www.cppblog.com/sdfond/archive/2015/04/27/76775.html#210454</guid><description><![CDATA[@eval<br>感谢您的指正！<br><br>已修改<img src ="http://www.cppblog.com/sdfond/aggbug/210454.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sdfond/" target="_blank">sdfond</a> 2015-04-27 18:21 <a href="http://www.cppblog.com/sdfond/archive/2015/04/27/76775.html#210454#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 筛法求素数</title><link>http://www.cppblog.com/sdfond/archive/2015/04/26/76775.html#210449</link><dc:creator>eval</dc:creator><author>eval</author><pubDate>Sun, 26 Apr 2015 15:10:00 GMT</pubDate><guid>http://www.cppblog.com/sdfond/archive/2015/04/26/76775.html#210449</guid><description><![CDATA[有个typo； inner loop是 i * j &lt; N 而不是 j * j &lt; N<br><br>望尽快修改过来，不要误导网友。<img src ="http://www.cppblog.com/sdfond/aggbug/210449.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sdfond/" target="_blank">eval</a> 2015-04-26 23:10 <a href="http://www.cppblog.com/sdfond/archive/2015/04/26/76775.html#210449#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: polya定理再小结</title><link>http://www.cppblog.com/sdfond/archive/2013/07/08/107403.html#201619</link><dc:creator>EZ_lzh</dc:creator><author>EZ_lzh</author><pubDate>Mon, 08 Jul 2013 13:06:00 GMT</pubDate><guid>http://www.cppblog.com/sdfond/archive/2013/07/08/107403.html#201619</guid><description><![CDATA[感谢楼主！<img src ="http://www.cppblog.com/sdfond/aggbug/201619.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sdfond/" target="_blank">EZ_lzh</a> 2013-07-08 21:06 <a href="http://www.cppblog.com/sdfond/archive/2013/07/08/107403.html#201619#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: 最大M子段和[未登录]</title><link>http://www.cppblog.com/sdfond/archive/2012/09/20/88083.html#191362</link><dc:creator>Bill</dc:creator><author>Bill</author><pubDate>Thu, 20 Sep 2012 02:58:00 GMT</pubDate><guid>http://www.cppblog.com/sdfond/archive/2012/09/20/88083.html#191362</guid><description><![CDATA[@阿皮<br>可以看这个链接<a target="_new" href="http://blog.163.com/sentimental_man/blog/static/7300161820119109533172/">http://blog.163.com/sentimental_man/blog/static/7300161820119109533172/</a><br>比作者的详细很多。<img src ="http://www.cppblog.com/sdfond/aggbug/191362.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sdfond/" target="_blank">Bill</a> 2012-09-20 10:58 <a href="http://www.cppblog.com/sdfond/archive/2012/09/20/88083.html#191362#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item><item><title>re: POJ 2411 Mondriaan's Dream</title><link>http://www.cppblog.com/sdfond/archive/2011/03/17/91761.html#142043</link><dc:creator>Alaskan</dc:creator><author>Alaskan</author><pubDate>Thu, 17 Mar 2011 04:00:00 GMT</pubDate><guid>http://www.cppblog.com/sdfond/archive/2011/03/17/91761.html#142043</guid><description><![CDATA[请问一下，<br>    dfs(col + 1, (s1 &lt;&lt; 1) | 1, s2 &lt;&lt; 1, n);<br>    dfs(col + 1, s1 &lt;&lt; 1, (s2 &lt;&lt; 1) | 1, n);<br>    dfs(col + 2, (s1 &lt;&lt; 2) | 3, (s2 &lt;&lt; 2) | 3, n);<br>中的s1,s2参数是指什么，为什么这样做位运算？<img src ="http://www.cppblog.com/sdfond/aggbug/142043.html" width = "1" height = "1" /><br><br><div align=right><a style="text-decoration:none;" href="http://www.cppblog.com/sdfond/" target="_blank">Alaskan</a> 2011-03-17 12:00 <a href="http://www.cppblog.com/sdfond/archive/2011/03/17/91761.html#142043#Feedback" target="_blank" style="text-decoration:none;">发表评论</a></div>]]></description></item></channel></rss>