<?xml version="1.0" encoding="UTF-8"?><rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
		>
<channel>
	<title>评论：求解二十四点的所有解 C++版</title>
	<atom:link href="http://www.slyar.com/blog/24dian-cpp.html/feed" rel="self" type="application/rss+xml" />
	<link>http://www.slyar.com/blog/24dian-cpp.html</link>
	<description>Beijing Normal University Zhuhai Campus</description>
	<lastBuildDate>Mon, 06 Sep 2010 11:42:18 +0000</lastBuildDate>
	<generator>http://wordpress.org/?v=2.9.2</generator>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
		<item>
		<title>来自：Slyar</title>
		<link>http://www.slyar.com/blog/24dian-cpp.html/comment-page-1#comment-8710</link>
		<dc:creator>Slyar</dc:creator>
		<pubDate>Sat, 31 Oct 2009 13:31:04 +0000</pubDate>
		<guid isPermaLink="false">http://www.slyar.com/blog/?p=1077#comment-8710</guid>
		<description>&lt;a href=&quot;#comment-8709&quot; rel=&quot;nofollow&quot;&gt;@felix021 &lt;/a&gt;啊，这不是前一段一直被其他程序阻碍了嘛，嘿嘿...

恩，我知道next_permutation和prev_permutation，不过因为要判重嘛，所以就直接写了...</description>
		<content:encoded><![CDATA[<p><a href="#comment-8709" rel="nofollow">@felix021 </a>啊，这不是前一段一直被其他程序阻碍了嘛，嘿嘿...</p>
<p>恩，我知道next_permutation和prev_permutation，不过因为要判重嘛，所以就直接写了...</p>
]]></content:encoded>
	</item>
	<item>
		<title>来自：felix021</title>
		<link>http://www.slyar.com/blog/24dian-cpp.html/comment-page-1#comment-8709</link>
		<dc:creator>felix021</dc:creator>
		<pubDate>Sat, 31 Oct 2009 11:45:10 +0000</pubDate>
		<guid isPermaLink="false">http://www.slyar.com/blog/?p=1077#comment-8709</guid>
		<description>对了，顺便说一下，stl的algorithm里面有两个函数分别是
next_permutation
prev_permutation</description>
		<content:encoded><![CDATA[<p>对了，顺便说一下，stl的algorithm里面有两个函数分别是<br />
next_permutation<br />
prev_permutation</p>
]]></content:encoded>
	</item>
	<item>
		<title>来自：felix021</title>
		<link>http://www.slyar.com/blog/24dian-cpp.html/comment-page-1#comment-8707</link>
		<dc:creator>felix021</dc:creator>
		<pubDate>Sat, 31 Oct 2009 11:37:58 +0000</pubDate>
		<guid isPermaLink="false">http://www.slyar.com/blog/?p=1077#comment-8707</guid>
		<description>唔，可以正常算出3388和1555的解，赞～
不过你说要研究这个算法可是5个月以前的事情了啊。。。
详见这篇的评论：http://www.felix021.com/blog/read.php?1602</description>
		<content:encoded><![CDATA[<p>唔，可以正常算出3388和1555的解，赞～<br />
不过你说要研究这个算法可是5个月以前的事情了啊。。。<br />
详见这篇的评论：http://www.felix021.com/blog/read.php?1602</p>
]]></content:encoded>
	</item>
	<item>
		<title>来自：hdlover</title>
		<link>http://www.slyar.com/blog/24dian-cpp.html/comment-page-1#comment-8706</link>
		<dc:creator>hdlover</dc:creator>
		<pubDate>Sat, 31 Oct 2009 09:15:12 +0000</pubDate>
		<guid isPermaLink="false">http://www.slyar.com/blog/?p=1077#comment-8706</guid>
		<description>你好NB,我自叹不如</description>
		<content:encoded><![CDATA[<p>你好NB,我自叹不如</p>
]]></content:encoded>
	</item>
</channel>
</rss>
