<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[full2024的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/full2024</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; full2024]]></copyright><item><title><![CDATA[刷题小记（简单验证哥德巴赫猜想）]]></title><link>https://blog.youkuaiyun.com/full2024/article/details/137229824</link><guid>https://blog.youkuaiyun.com/full2024/article/details/137229824</guid><author>full2024</author><pubDate>Mon, 01 Apr 2024 15:11:18 +0800</pubDate><description><![CDATA[1.进行判断是否为质数2.将一个偶数拆分成两个质数3.保证第一个加数比第二个加数小。]]></description><category></category></item><item><title><![CDATA[刷题小记（间隔符号分割，末尾无符号）＋素数判断]]></title><link>https://blog.youkuaiyun.com/full2024/article/details/137196739</link><guid>https://blog.youkuaiyun.com/full2024/article/details/137196739</guid><author>full2024</author><pubDate>Sun, 31 Mar 2024 13:11:22 +0800</pubDate><description><![CDATA[编程输入两个整数a,b(2]]></description><category></category></item><item><title><![CDATA[刷题小记（辗转相除法求两个数的最大公约数）]]></title><link>https://blog.youkuaiyun.com/full2024/article/details/137126586</link><guid>https://blog.youkuaiyun.com/full2024/article/details/137126586</guid><author>full2024</author><pubDate>Thu, 28 Mar 2024 23:11:31 +0800</pubDate><description><![CDATA[辗转相除法是为了算出两个数的最大公约数，相比与穷举法来说，更节省时间。比如32和26两个数32%266266=26%2=0（2即为两个数的最大公约数）将第一个式子的除数当成第二个式子的被除数，第一个式子的余数当成第二个式子的除数，直到余数为零时为止，最后一个式子的除数即为所求最大公约数。辗转相除法（代码）通过辗转相除法来计算两个数的最大公因数。]]></description><category></category></item></channel></rss>