<?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/No_End_Point" type="application/rss+xml" rel="self"></atom:link><fs:self_link href="http://feeds.feedsky.com/csdn.net/No_End_Point" type="application/rss+xml"></fs:self_link><lastBuildDate>Fri, 26 Jun 2009 16:02:00 GMT</lastBuildDate><title>Daniel</title><link>http://blog.csdn.net/No_End_Point/</link><item><title>Project euler problem 31 - 40</title><link>http://blog.csdn.net/No_End_Point/archive/2009/06/26/4301149.aspx</link><wfw:comment>http://blog.csdn.net/No_End_Point/comments/4301149.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/No_End_Point/comments/commentRss/4301149.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=4301149</trackback:ping><description>Project euler problem 31 - 40&lt;img src =&quot;http://blog.csdn.net/No_End_Point/aggbug/4301149.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;img src=&quot;http://www1.feedsky.com/t1/237532764/No_End_Point/csdn.net/s.gif?r=http://blog.csdn.net/No_End_Point/archive/2009/06/26/4301149.aspx&quot; border=&quot;0&quot; height=&quot;0&quot; width=&quot;0&quot; style=&quot;position:absolute&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/No_End_Point/237532764/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/No_End_Point/237532764/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Sat, 27 Jun 2009 00:02:00 +0800</pubDate><author>Daniel</author><comments>http://blog.csdn.net/No_End_Point/archive/2009/06/26/4301149.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/No_End_Point/archive/2009/06/26/4301149.aspx</guid><dc:creator>Daniel</dc:creator><fs:srclink>http://blog.csdn.net/No_End_Point/archive/2009/06/26/4301149.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/No_End_Point/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/No_End_Point/~1117475/237532764/1117471</fs:itemid></item><item><title>（ZT）绝对精辟:10分钟让你全面了解当前世界金融危机！</title><link>http://blog.csdn.net/No_End_Point/archive/2008/10/14/3074256.aspx</link><wfw:comment>http://blog.csdn.net/No_End_Point/comments/3074256.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/No_End_Point/comments/commentRss/3074256.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=3074256</trackback:ping><description>绝对精辟:10分钟让你全面了解当前世界金融危机
据说来源是天涯，说的挺通俗的，外行人看得懂的解释！&lt;img src =&quot;http://blog.csdn.net/No_End_Point/aggbug/3074256.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/No_End_Point/237532768/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/No_End_Point/237532768/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Tue, 14 Oct 2008 23:40:00 +0800</pubDate><author>Daniel</author><comments>http://blog.csdn.net/No_End_Point/archive/2008/10/14/3074256.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/No_End_Point/archive/2008/10/14/3074256.aspx</guid><dc:creator>Daniel</dc:creator><fs:srclink>http://blog.csdn.net/No_End_Point/archive/2008/10/14/3074256.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/No_End_Point/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/No_End_Point/~1117475/237532768/1117471</fs:itemid></item><item><title>Java 用单链表实现多项式加减乘</title><link>http://blog.csdn.net/No_End_Point/archive/2008/10/14/3073078.aspx</link><wfw:comment>http://blog.csdn.net/No_End_Point/comments/3073078.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/No_End_Point/comments/commentRss/3073078.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=3073078</trackback:ping><description>用单链表来实现多项式运算（加减乘）&lt;img src =&quot;http://blog.csdn.net/No_End_Point/aggbug/3073078.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/No_End_Point/237532772/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/No_End_Point/237532772/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Tue, 14 Oct 2008 19:19:00 +0800</pubDate><author>Daniel</author><comments>http://blog.csdn.net/No_End_Point/archive/2008/10/14/3073078.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/No_End_Point/archive/2008/10/14/3073078.aspx</guid><dc:creator>Daniel</dc:creator><fs:srclink>http://blog.csdn.net/No_End_Point/archive/2008/10/14/3073078.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/No_End_Point/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/No_End_Point/~1117475/237532772/1117471</fs:itemid></item><item><title>世界卫生组织公布的最佳食品榜</title><link>http://blog.csdn.net/No_End_Point/archive/2008/09/23/2969178.aspx</link><wfw:comment>http://blog.csdn.net/No_End_Point/comments/2969178.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/No_End_Point/comments/commentRss/2969178.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2969178</trackback:ping><description>世界卫生组织公布的最佳食品榜&lt;img src =&quot;http://blog.csdn.net/No_End_Point/aggbug/2969178.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/No_End_Point/237532774/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/No_End_Point/237532774/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Wed, 24 Sep 2008 01:23:00 +0800</pubDate><author>Daniel</author><comments>http://blog.csdn.net/No_End_Point/archive/2008/09/23/2969178.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/No_End_Point/archive/2008/09/23/2969178.aspx</guid><dc:creator>Daniel</dc:creator><fs:srclink>http://blog.csdn.net/No_End_Point/archive/2008/09/23/2969178.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/No_End_Point/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/No_End_Point/~1117475/237532774/1117471</fs:itemid></item><item><title>汉字里的张冠李戴</title><link>http://blog.csdn.net/No_End_Point/archive/2008/09/22/2959655.aspx</link><wfw:comment>http://blog.csdn.net/No_End_Point/comments/2959655.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/No_End_Point/comments/commentRss/2959655.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2959655</trackback:ping><description>汉字里的张冠李戴，奇妙的文字&lt;img src =&quot;http://blog.csdn.net/No_End_Point/aggbug/2959655.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/No_End_Point/237532777/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/No_End_Point/237532777/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Mon, 22 Sep 2008 17:57:00 +0800</pubDate><author>Daniel</author><comments>http://blog.csdn.net/No_End_Point/archive/2008/09/22/2959655.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/No_End_Point/archive/2008/09/22/2959655.aspx</guid><dc:creator>Daniel</dc:creator><fs:srclink>http://blog.csdn.net/No_End_Point/archive/2008/09/22/2959655.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/No_End_Point/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/No_End_Point/~1117475/237532777/1117471</fs:itemid></item><item><title>Project euler problem 21 - 30</title><link>http://blog.csdn.net/No_End_Point/archive/2008/08/26/2835285.aspx</link><wfw:comment>http://blog.csdn.net/No_End_Point/comments/2835285.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/No_End_Point/comments/commentRss/2835285.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2835285</trackback:ping><description>Project euler problem 21 - 30&lt;img src =&quot;http://blog.csdn.net/No_End_Point/aggbug/2835285.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/No_End_Point/237532780/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/No_End_Point/237532780/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Wed, 27 Aug 2008 05:48:00 +0800</pubDate><author>Daniel</author><comments>http://blog.csdn.net/No_End_Point/archive/2008/08/26/2835285.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/No_End_Point/archive/2008/08/26/2835285.aspx</guid><dc:creator>Daniel</dc:creator><fs:srclink>http://blog.csdn.net/No_End_Point/archive/2008/08/26/2835285.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/No_End_Point/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/No_End_Point/~1117475/237532780/1117471</fs:itemid></item><item><title>Projecteuler 11-20</title><link>http://blog.csdn.net/No_End_Point/archive/2008/08/25/2828525.aspx</link><wfw:comment>http://blog.csdn.net/No_End_Point/comments/2828525.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/No_End_Point/comments/commentRss/2828525.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2828525</trackback:ping><description>Project euler 11- 20&lt;img src =&quot;http://blog.csdn.net/No_End_Point/aggbug/2828525.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/No_End_Point/237532781/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/No_End_Point/237532781/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Tue, 26 Aug 2008 01:07:00 +0800</pubDate><author>Daniel</author><comments>http://blog.csdn.net/No_End_Point/archive/2008/08/25/2828525.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/No_End_Point/archive/2008/08/25/2828525.aspx</guid><dc:creator>Daniel</dc:creator><fs:srclink>http://blog.csdn.net/No_End_Point/archive/2008/08/25/2828525.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/No_End_Point/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/No_End_Point/~1117475/237532781/1117471</fs:itemid></item><item><title>Projecteuler Problem 1-10</title><link>http://blog.csdn.net/No_End_Point/archive/2008/08/25/2827186.aspx</link><wfw:comment>http://blog.csdn.net/No_End_Point/comments/2827186.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/No_End_Point/comments/commentRss/2827186.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2827186</trackback:ping><description>Project euler problem 1 - 10&lt;img src =&quot;http://blog.csdn.net/No_End_Point/aggbug/2827186.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/No_End_Point/237532782/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/No_End_Point/237532782/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Mon, 25 Aug 2008 22:16:00 +0800</pubDate><author>Daniel</author><comments>http://blog.csdn.net/No_End_Point/archive/2008/08/25/2827186.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/No_End_Point/archive/2008/08/25/2827186.aspx</guid><dc:creator>Daniel</dc:creator><fs:srclink>http://blog.csdn.net/No_End_Point/archive/2008/08/25/2827186.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/No_End_Point/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/No_End_Point/~1117475/237532782/1117471</fs:itemid></item><item><title>全排列的另一种实现方法：旋转法</title><link>http://blog.csdn.net/No_End_Point/archive/2008/08/22/2814914.aspx</link><wfw:comment>http://blog.csdn.net/No_End_Point/comments/2814914.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/No_End_Point/comments/commentRss/2814914.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2814914</trackback:ping><description>利用旋转法来全排列&lt;img src =&quot;http://blog.csdn.net/No_End_Point/aggbug/2814914.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/No_End_Point/237532783/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/No_End_Point/237532783/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Fri, 22 Aug 2008 23:47:00 +0800</pubDate><author>Daniel</author><comments>http://blog.csdn.net/No_End_Point/archive/2008/08/22/2814914.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/No_End_Point/archive/2008/08/22/2814914.aspx</guid><dc:creator>Daniel</dc:creator><fs:srclink>http://blog.csdn.net/No_End_Point/archive/2008/08/22/2814914.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/No_End_Point/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/No_End_Point/~1117475/237532783/1117471</fs:itemid></item><item><title>Problem 17 - How many letters would be needed to write all the numbers in words from 1 to 1000?</title><link>http://blog.csdn.net/No_End_Point/archive/2008/07/17/2668461.aspx</link><wfw:comment>http://blog.csdn.net/No_End_Point/comments/2668461.aspx</wfw:comment><slash:comments>0</slash:comments><wfw:commentRss>http://blog.csdn.net/No_End_Point/comments/commentRss/2668461.aspx</wfw:commentRss><trackback:ping>http://tb.blog.csdn.net/TrackBack.aspx?PostId=2668461</trackback:ping><description>Project Euler problem 17&lt;img src =&quot;http://blog.csdn.net/No_End_Point/aggbug/2668461.aspx&quot; width = &quot;1&quot; height = &quot;1&quot; /&gt;&lt;p class=&quot;fswww1&quot;&gt;&lt;a href=&quot;http://www1.feedsky.com/r/l/csdn.net/No_End_Point/237532784/art01.html&quot; target=&quot;_blank&quot;&gt;&lt;img border=&quot;0&quot; ismap=&quot;ismap&quot; src=&quot;http://www1.feedsky.com/r/i/csdn.net/No_End_Point/237532784/art01.gif&quot; onerror=&quot;this.style.display='none'&quot; /&gt;&lt;/a&gt;&lt;/p&gt;</description><pubDate>Fri, 18 Jul 2008 06:12:00 +0800</pubDate><author>Daniel</author><comments>http://blog.csdn.net/No_End_Point/archive/2008/07/17/2668461.aspx#Feedback</comments><guid isPermaLink="false">http://blog.csdn.net/No_End_Point/archive/2008/07/17/2668461.aspx</guid><dc:creator>Daniel</dc:creator><fs:srclink>http://blog.csdn.net/No_End_Point/archive/2008/07/17/2668461.aspx</fs:srclink><fs:srcfeed>http://blog.csdn.net/No_End_Point/feed.aspx</fs:srcfeed><fs:itemid>csdn.net/No_End_Point/~1117475/237532784/1117471</fs:itemid></item></channel></rss>