<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[2502_90454521的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/2502_90454521</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; 2502_90454521]]></copyright><item><title><![CDATA[基于树的遍历优化迷宫搜索——BFS剪枝与DFS回溯]]></title><link>https://blog.youkuaiyun.com/2502_90454521/article/details/159053915</link><guid>https://blog.youkuaiyun.com/2502_90454521/article/details/159053915</guid><author>2502_90454521</author><pubDate>Sat, 14 Mar 2026 21:59:06 +0800</pubDate><description><![CDATA[基于树的遍历优化迷宫搜索——BFS剪枝与DFS回溯]]></description><category></category></item><item><title><![CDATA[基于STL的queue实现约瑟夫环]]></title><link>https://blog.youkuaiyun.com/2502_90454521/article/details/158237895</link><guid>https://blog.youkuaiyun.com/2502_90454521/article/details/158237895</guid><author>2502_90454521</author><pubDate>Fri, 20 Feb 2026 19:53:23 +0800</pubDate><description><![CDATA[有 nn 个人（编号 0∼n−10∼n−1）围成一圈，从编号为 kk 的人开始报数，报数依次为 1,2,…,m1,2,…,m，报到 mm 的人出队。下次从出队者的下一个人开始重新报数，循环往复，直到队伍中只剩最后一个人，该人即"大王"。

给定三个正整数 n,k,mn,k,m，请输出最后剩下的"大王"编号。在一行中输入三个整数 n(2≦n≦100),k(0≦k≦n−1),m(1≦m≦100)n(2≦n≦100),k(0≦k≦n−1),m(1≦m≦100)，用空格隔开。输出一个整数，表示最后剩下的"大王"编号]]></description><category></category></item><item><title><![CDATA[基于Bucket sort思想解决洛谷P1125 [NOIP 2008 提高组] 笨小猴]]></title><link>https://blog.youkuaiyun.com/2502_90454521/article/details/156136523</link><guid>https://blog.youkuaiyun.com/2502_90454521/article/details/156136523</guid><author>2502_90454521</author><pubDate>Sun, 21 Dec 2025 23:56:47 +0800</pubDate><description><![CDATA[作者是C/C++初学者，之前了解过Bucket sort的核心思想，在写这一题时突然想起来了Bucket sort,作者运用了其思想解决了该NOIP提高组的题目，作者写该文章是分享解题思路，希望读者可以了解和学习到。如果读者们有更优美的解法，可以在文章下面留言！]]></description><category></category></item><item><title><![CDATA[(原创)强交互型猜数字小游戏开发]]></title><link>https://blog.youkuaiyun.com/2502_90454521/article/details/156108631</link><guid>https://blog.youkuaiyun.com/2502_90454521/article/details/156108631</guid><author>2502_90454521</author><pubDate>Sat, 20 Dec 2025 13:24:13 +0800</pubDate><description><![CDATA[(原创)强交互型猜数字小游戏开发]]></description><category></category></item><item><title><![CDATA[基于数列递推与二分查找解决洛谷P2669 [NOIP 2015 普及组] 金币]]></title><link>https://blog.youkuaiyun.com/2502_90454521/article/details/156097774</link><guid>https://blog.youkuaiyun.com/2502_90454521/article/details/156097774</guid><author>2502_90454521</author><pubDate>Fri, 19 Dec 2025 22:49:31 +0800</pubDate><description><![CDATA[基于数列递推与二分查找解决洛谷P2669 [NOIP 2015 普及组] 金币]]></description><category></category></item><item><title><![CDATA[·用二进制思想解决洛谷平台P1047 [NOIP 2005 普及组] 校门外的树]]></title><link>https://blog.youkuaiyun.com/2502_90454521/article/details/156064159</link><guid>https://blog.youkuaiyun.com/2502_90454521/article/details/156064159</guid><author>2502_90454521</author><pubDate>Thu, 18 Dec 2025 23:27:51 +0800</pubDate><description><![CDATA[用二进制思想解决洛谷平台P1047 [NOIP 2005 普及组] 校门外的树]]></description><category></category></item></channel></rss>