<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>痘痘向前冲 - 常见算法</title><link>http://blog.csdn.net/andycpp/category/276337.aspx</link><description>一些很常用的算法，平时用到时方便查看</description><dc:language>zh-CN</dc:language><lastUpdateTime>Mon, 24 Sep 2007 17:26:17 GMT</lastUpdateTime><ttl>60</ttl><item><dc:creator>华丽的痘痘</dc:creator><title>绘制数字缠绕矩阵</title><link>http://blog.csdn.net/andycpp/archive/2007/09/23/1796776.aspx</link><pubDate>Sun, 23 Sep 2007 12:21:00 GMT</pubDate><guid>http://blog.csdn.net/andycpp/archive/2007/09/23/1796776.aspx</guid><wfw:comment>http://blog.csdn.net/andycpp/comments/1796776.aspx</wfw:comment><comments>http://blog.csdn.net/andycpp/archive/2007/09/23/1796776.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/andycpp/comments/commentRss/1796776.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1796776</trackback:ping><description>一个小程序&lt;img src ="http://blog.csdn.net/andycpp/aggbug/1796776.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>华丽的痘痘</dc:creator><title>在n个数字中，找出所有和为SUM的组合</title><link>http://blog.csdn.net/andycpp/archive/2007/09/23/1796669.aspx</link><pubDate>Sun, 23 Sep 2007 10:58:00 GMT</pubDate><guid>http://blog.csdn.net/andycpp/archive/2007/09/23/1796669.aspx</guid><wfw:comment>http://blog.csdn.net/andycpp/comments/1796669.aspx</wfw:comment><comments>http://blog.csdn.net/andycpp/archive/2007/09/23/1796669.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/andycpp/comments/commentRss/1796669.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1796669</trackback:ping><description>一个算法的递归实现&lt;img src ="http://blog.csdn.net/andycpp/aggbug/1796669.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>老虎爱上猫</dc:creator><title>将一个单向链表反向链接</title><link>http://blog.csdn.net/andycpp/archive/2007/08/14/1741859.aspx</link><pubDate>Tue, 14 Aug 2007 00:53:00 GMT</pubDate><guid>http://blog.csdn.net/andycpp/archive/2007/08/14/1741859.aspx</guid><wfw:comment>http://blog.csdn.net/andycpp/comments/1741859.aspx</wfw:comment><comments>http://blog.csdn.net/andycpp/archive/2007/08/14/1741859.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/andycpp/comments/commentRss/1741859.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1741859</trackback:ping><description>写着玩玩&lt;img src ="http://blog.csdn.net/andycpp/aggbug/1741859.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>老虎爱上猫</dc:creator><title>在n张扑克牌中找出顺子</title><link>http://blog.csdn.net/andycpp/archive/2007/08/13/1741825.aspx</link><pubDate>Mon, 13 Aug 2007 23:51:00 GMT</pubDate><guid>http://blog.csdn.net/andycpp/archive/2007/08/13/1741825.aspx</guid><wfw:comment>http://blog.csdn.net/andycpp/comments/1741825.aspx</wfw:comment><comments>http://blog.csdn.net/andycpp/archive/2007/08/13/1741825.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/andycpp/comments/commentRss/1741825.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1741825</trackback:ping><description>一个有趣的小题目，一些代码才发现写了好长，崩溃~~~~~~&lt;img src ="http://blog.csdn.net/andycpp/aggbug/1741825.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>老虎爱上猫</dc:creator><title>1～N中求出1的个数</title><link>http://blog.csdn.net/andycpp/archive/2007/07/19/1699177.aspx</link><pubDate>Thu, 19 Jul 2007 17:32:00 GMT</pubDate><guid>http://blog.csdn.net/andycpp/archive/2007/07/19/1699177.aspx</guid><wfw:comment>http://blog.csdn.net/andycpp/comments/1699177.aspx</wfw:comment><comments>http://blog.csdn.net/andycpp/archive/2007/07/19/1699177.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/andycpp/comments/commentRss/1699177.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1699177</trackback:ping><description>一个小题目&lt;img src ="http://blog.csdn.net/andycpp/aggbug/1699177.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>老虎爱上猫</dc:creator><title>素数环问题的非递归实现</title><link>http://blog.csdn.net/andycpp/archive/2007/06/29/1672028.aspx</link><pubDate>Fri, 29 Jun 2007 23:34:00 GMT</pubDate><guid>http://blog.csdn.net/andycpp/archive/2007/06/29/1672028.aspx</guid><wfw:comment>http://blog.csdn.net/andycpp/comments/1672028.aspx</wfw:comment><comments>http://blog.csdn.net/andycpp/archive/2007/06/29/1672028.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/andycpp/comments/commentRss/1672028.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1672028</trackback:ping><description>素数环的非递归实现&lt;img src ="http://blog.csdn.net/andycpp/aggbug/1672028.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>老虎爱上猫</dc:creator><title>素数环问题</title><link>http://blog.csdn.net/andycpp/archive/2007/02/02/1501135.aspx</link><pubDate>Fri, 02 Feb 2007 15:26:00 GMT</pubDate><guid>http://blog.csdn.net/andycpp/archive/2007/02/02/1501135.aspx</guid><wfw:comment>http://blog.csdn.net/andycpp/comments/1501135.aspx</wfw:comment><comments>http://blog.csdn.net/andycpp/archive/2007/02/02/1501135.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/andycpp/comments/commentRss/1501135.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1501135</trackback:ping><description>本文介绍了一个简单的素数环计算方法，计算20以内的素数环，基本上瞬间搞定。&lt;img src ="http://blog.csdn.net/andycpp/aggbug/1501135.aspx" width = "1" height = "1" /&gt;</description></item><item><dc:creator>老虎爱上猫</dc:creator><title>产生不等概率随机数的简单方法</title><link>http://blog.csdn.net/andycpp/archive/2006/09/18/1240606.aspx</link><pubDate>Mon, 18 Sep 2006 22:58:00 GMT</pubDate><guid>http://blog.csdn.net/andycpp/archive/2006/09/18/1240606.aspx</guid><wfw:comment>http://blog.csdn.net/andycpp/comments/1240606.aspx</wfw:comment><comments>http://blog.csdn.net/andycpp/archive/2006/09/18/1240606.aspx#Feedback</comments><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/andycpp/comments/commentRss/1240606.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=1240606</trackback:ping><description>本文介绍了一个简单的方法产生概率不相等的随机数&lt;img src ="http://blog.csdn.net/andycpp/aggbug/1240606.aspx" width = "1" height = "1" /&gt;</description></item></channel></rss>