<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ttooop的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ttooop</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ttooop]]></copyright><item><title><![CDATA[最短路——Bellman-Ford算法]]></title><link>https://blog.youkuaiyun.com/ttooop/article/details/54838738</link><guid>https://blog.youkuaiyun.com/ttooop/article/details/54838738</guid><author>ttooop</author><pubDate>Thu, 02 Feb 2017 22:59:08 +0800</pubDate><description><![CDATA[最短路——Bellman-Ford算法]]></description><category></category></item><item><title><![CDATA[Blown Garland]]></title><link>https://blog.youkuaiyun.com/ttooop/article/details/54673170</link><guid>https://blog.youkuaiyun.com/ttooop/article/details/54673170</guid><author>ttooop</author><pubDate>Sun, 22 Jan 2017 22:58:54 +0800</pubDate><description><![CDATA[Blown Garland]]></description><category></category></item><item><title><![CDATA[Genealogical Tree]]></title><link>https://blog.youkuaiyun.com/ttooop/article/details/54672670</link><guid>https://blog.youkuaiyun.com/ttooop/article/details/54672670</guid><author>ttooop</author><pubDate>Sun, 22 Jan 2017 22:41:36 +0800</pubDate><description><![CDATA[Genealogical Tree]]></description><category></category></item><item><title><![CDATA[Pythagorean Theorem II]]></title><link>https://blog.youkuaiyun.com/ttooop/article/details/54672505</link><guid>https://blog.youkuaiyun.com/ttooop/article/details/54672505</guid><author>ttooop</author><pubDate>Sun, 22 Jan 2017 22:35:33 +0800</pubDate><description><![CDATA[Pythagorean Theorem II]]></description><category></category></item><item><title><![CDATA[GCD The Largest]]></title><link>https://blog.youkuaiyun.com/ttooop/article/details/54671631</link><guid>https://blog.youkuaiyun.com/ttooop/article/details/54671631</guid><author>ttooop</author><pubDate>Sun, 22 Jan 2017 22:04:38 +0800</pubDate><description><![CDATA[GCD The Largest]]></description><category></category></item><item><title><![CDATA[Rectangles]]></title><link>https://blog.youkuaiyun.com/ttooop/article/details/54671367</link><guid>https://blog.youkuaiyun.com/ttooop/article/details/54671367</guid><author>ttooop</author><pubDate>Sun, 22 Jan 2017 21:48:07 +0800</pubDate><description><![CDATA[Rectangles]]></description><category></category></item><item><title><![CDATA[Peter's Smokes]]></title><link>https://blog.youkuaiyun.com/ttooop/article/details/54671069</link><guid>https://blog.youkuaiyun.com/ttooop/article/details/54671069</guid><author>ttooop</author><pubDate>Sun, 22 Jan 2017 21:30:51 +0800</pubDate><description><![CDATA[Peter’s Smokes]]></description><category></category></item><item><title><![CDATA[candy]]></title><link>https://blog.youkuaiyun.com/ttooop/article/details/54670808</link><guid>https://blog.youkuaiyun.com/ttooop/article/details/54670808</guid><author>ttooop</author><pubDate>Sun, 22 Jan 2017 21:01:09 +0800</pubDate><description><![CDATA[Candy
c++]]></description><category></category></item><item><title><![CDATA[素数]]></title><link>https://blog.youkuaiyun.com/ttooop/article/details/53456652</link><guid>https://blog.youkuaiyun.com/ttooop/article/details/53456652</guid><author>ttooop</author><pubDate>Sun, 04 Dec 2016 21:28:18 +0800</pubDate><description><![CDATA[一、素数1、素数：素数（prime number）又称质数，有无限个。素数定义为在大于1的自然数中，除了1和它本身以外不再有其他因数的数称为素数。 
2、算术基本定理:每个大于1的自然数均可写为质数的积，而且这些素因子按大小排列之后，写法仅有一种方式。          //寻找自然数的素因子，并通过算式表示 
     例如：6936=2^3*3*17^2，1200=2^4*3*5^2。二、 质因]]></description><category></category></item></channel></rss>