<?xml version="1.0" encoding="utf-8"?><?xml-stylesheet href='http://feeds.feedsky.com/styles/temp01.xsl' type='text/xsl' ?><!--这是一个由Feedsy提供技术支持的Feed，为了提高读者阅读的体验，以及满足用户美化自己Feed的需要，我们设计了多种精美的Feed模板，提供给大家选择，所有最终呈现出来的样式，皆由用户自愿选择使用，未经许可，任何团体和个人，请不要擅自修改样式或者盗用，这是对于用户选择权的尊重。--><rss xmlns:atom="http://www.w3.org/2005/Atom" xmlns:fs="http://www.feedsky.com/namespace/feed" xmlns:wfw="http://wellformedweb.org/CommentAPI/" xmlns:slash="http://purl.org/rss/1.0/modules/slash/" xmlns:trackback="http://madskills.com/public/xml/rss/module/trackback/" xmlns:dc="http://purl.org/dc/elements/1.1/" version="2.0"><channel><atom:link href="http://feeds.feedsky.com/csdn.net/panqiaomu" type="application/rss+xml" ref="self"></atom:link><fs:self_link href="http://feeds.feedsky.com/csdn.net/panqiaomu" type="application/rss+xml"></fs:self_link><lastBuildDate>Thu, 20 Mar 2008 11:32:00 GMT</lastBuildDate><title>程序设计实验室【数据结构@算法@数学】</title><description>厚积薄发@有的放矢</description><item><title>【统计英文变位词】with JAVA</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992057/1174337/1/item.html</link><wfw:comment>comments/2199483.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2199483.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2199483</trackback:ping><description>变位词！&lt;img src =&quot;aggbug/2199483.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Thu, 20 Mar 2008 19:32:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/03/20/2199483.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/03/20/2199483.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/03/20/2199483.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992057/1174337</fs:itemid></item><item><title>【八数码问题】A*star算法求解</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992058/1174337/1/item.html</link><wfw:comment>comments/2196988.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2196988.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2196988</trackback:ping><description>经典~&lt;img src =&quot;aggbug/2196988.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Wed, 19 Mar 2008 22:09:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/03/19/2196988.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/03/19/2196988.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/03/19/2196988.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992058/1174337</fs:itemid></item><item><title>用java的List接口做随机洗牌</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992059/1174337/1/item.html</link><wfw:comment>comments/2193208.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2193208.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2193208</trackback:ping><description>8错~&lt;img src =&quot;aggbug/2193208.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Tue, 18 Mar 2008 08:14:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/03/18/2193208.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/03/18/2193208.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/03/18/2193208.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992059/1174337</fs:itemid></item><item><title>搜素状态空间树求解【N皇后问题】</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992060/1174337/1/item.html</link><wfw:comment>comments/2171511.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2171511.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2171511</trackback:ping><description>classic.&lt;img src =&quot;aggbug/2171511.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Wed, 12 Mar 2008 08:07:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/03/12/2171511.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/03/12/2171511.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/03/12/2171511.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992060/1174337</fs:itemid></item><item><title>回溯法求解图的m着色问题</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992061/1174337/1/item.html</link><wfw:comment>comments/2165006.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2165006.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2165006</trackback:ping><description>经典算法~&lt;img src =&quot;aggbug/2165006.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Tue, 11 Mar 2008 07:53:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/03/10/2165006.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/03/10/2165006.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/03/10/2165006.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992061/1174337</fs:itemid></item><item><title>【C++】二维数组的两个弱智问题及其解决</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992062/1174337/1/item.html</link><wfw:comment>comments/2158304.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2158304.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2158304</trackback:ping><description>又是语法问题，oh,shit.&lt;img src =&quot;aggbug/2158304.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Sat, 08 Mar 2008 21:23:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/03/08/2158304.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/03/08/2158304.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/03/08/2158304.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992062/1174337</fs:itemid></item><item><title>C++指针和引用的简单转换</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992063/1174337/1/item.html</link><wfw:comment>comments/2157620.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2157620.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2157620</trackback:ping><description>又是语法麻烦，NND。&lt;img src =&quot;aggbug/2157620.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Sat, 08 Mar 2008 08:49:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/03/08/2157620.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/03/08/2157620.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/03/08/2157620.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992063/1174337</fs:itemid></item><item><title>C++常用I/O流技术</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992064/1174337/1/item.html</link><wfw:comment>comments/2155361.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2155361.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2155361</trackback:ping><description>回顾~&lt;img src =&quot;aggbug/2155361.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Fri, 07 Mar 2008 08:10:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/03/07/2155361.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/03/07/2155361.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/03/07/2155361.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992064/1174337</fs:itemid></item><item><title>【C/C++】普利姆算法实现最小生成树</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992065/1174337/1/item.html</link><wfw:comment>comments/2147748.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2147748.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2147748</trackback:ping><description>经典贪心算法之一。。。。&lt;img src =&quot;aggbug/2147748.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Wed, 05 Mar 2008 07:41:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/03/04/2147748.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/03/04/2147748.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/03/04/2147748.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992065/1174337</fs:itemid></item><item><title>货币兑换问题</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992066/1174337/1/item.html</link><wfw:comment>comments/2138252.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2138252.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2138252</trackback:ping><description>rujia&lt;img src =&quot;aggbug/2138252.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Sun, 02 Mar 2008 07:33:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/03/01/2138252.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/03/01/2138252.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/03/01/2138252.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992066/1174337</fs:itemid></item><item><title>最小花费生成树的克鲁斯卡尔算法实现： 运用离散集合操作</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992067/1174337/1/item.html</link><wfw:comment>comments/2127661.aspx</wfw:comment><slash:comments>1</slash:comments><wfw:commentRss>comments/commentRss/2127661.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2127661</trackback:ping><description>rt.&lt;img src =&quot;aggbug/2127661.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Thu, 28 Feb 2008 21:03:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/02/28/2127661.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/02/28/2127661.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/02/28/2127661.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992067/1174337</fs:itemid></item><item><title>数据结构：堆的实现及其相关算法</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992068/1174337/1/item.html</link><wfw:comment>comments/2127225.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2127225.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2127225</trackback:ping><description>如题。&lt;img src =&quot;aggbug/2127225.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Thu, 28 Feb 2008 19:01:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/02/28/2127225.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/02/28/2127225.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/02/28/2127225.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992068/1174337</fs:itemid></item><item><title>经典最短路径算法C/C++ 邻接矩阵实现</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992069/1174337/1/item.html</link><wfw:comment>comments/2123015.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2123015.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2123015</trackback:ping><description>贪婪法的经典例子&lt;img src =&quot;aggbug/2123015.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Wed, 27 Feb 2008 02:38:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/02/26/2123015.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/02/26/2123015.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/02/26/2123015.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992069/1174337</fs:itemid></item><item><title>匿名类的重复定义产生多个实例</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992070/1174337/1/item.html</link><wfw:comment>comments/2116395.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/2116395.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2116395</trackback:ping><description>没啥，真的.&lt;img src =&quot;aggbug/2116395.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Sun, 24 Feb 2008 19:13:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2008/02/24/2116395.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2008/02/24/2116395.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2008/02/24/2116395.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992070/1174337</fs:itemid></item><item><title>【java】异常转译，转译链和多种异常处理不过如此</title><link>http://item.feedsky.com/~csdn.net/panqiaomu/~1174355/59992071/1174337/1/item.html</link><wfw:comment>comments/1944534.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>comments/commentRss/1944534.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1944534</trackback:ping><description>%*……@（！&amp;）@！*&lt;img src =&quot;aggbug/1944534.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;</description><pubDate>Tue, 18 Dec 2007 08:54:00 +0800</pubDate><author>潘乔木</author><comments>http://blog.csdn.net/panqiaomu/archive/2007/12/18/1944534.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/panqiaomu/archive/2007/12/18/1944534.aspx</guid><dc:creator>潘乔木</dc:creator><fs:srclink>http://blog.csdn.net/panqiaomu/archive/2007/12/18/1944534.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/panqiaomu/rss.aspx</fs:srcfeed><fs:itemid>csdn.net/panqiaomu/~1174355/59992071/1174337</fs:itemid></item></channel></rss>