<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[ikunnnaaa的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/ikunnnaaa</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; ikunnnaaa]]></copyright><item><title><![CDATA[codeforces edu 168（D. Colored Portals）]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/142336771</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/142336771</guid><author>ikunnnaaa</author><pubDate>Wed, 18 Sep 2024 16:34:57 +0800</pubDate><description><![CDATA[关于Educational Codeforces Round 169 (Rated for Div. 2)
D. Colored Portals 的题解]]></description><category></category></item><item><title><![CDATA[牛客小白月赛94：F:小苯的01背包（试填法）]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/139326693</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/139326693</guid><author>ikunnnaaa</author><pubDate>Thu, 30 May 2024 15:54:10 +0800</pubDate><description><![CDATA[【代码】牛客小白月赛94：F:小苯的01背包（试填法）]]></description><category></category></item><item><title><![CDATA[codeforces 911(div.2) D.Small GCD]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/134819662</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/134819662</guid><author>ikunnnaaa</author><pubDate>Tue, 05 Dec 2023 23:24:52 +0800</pubDate><description><![CDATA[容斥，数学，贡献，dp]]></description><category></category></item><item><title><![CDATA[D. The BOSS Can Count Pairs (div.2 Round 875)]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/131035465</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/131035465</guid><author>ikunnnaaa</author><pubDate>Sun, 04 Jun 2023 18:40:35 +0800</pubDate><description><![CDATA[codeforce D.The BOSS Can Count Pairs]]></description><category></category></item><item><title><![CDATA[E. Making Anti-Palindromes]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/130734414</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/130734414</guid><author>ikunnnaaa</author><pubDate>Wed, 17 May 2023 20:43:28 +0800</pubDate><description><![CDATA[Codeforces Round 867 (Div. 3) E]]></description><category></category></item><item><title><![CDATA[PTA：借和还（组合数学）]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/130612016</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/130612016</guid><author>ikunnnaaa</author><pubDate>Wed, 10 May 2023 23:18:37 +0800</pubDate><description><![CDATA[（组合数学）卡特兰数的应用]]></description><category></category></item><item><title><![CDATA[PTA  最短工期]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128877467</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128877467</guid><author>ikunnnaaa</author><pubDate>Fri, 03 Feb 2023 23:37:41 +0800</pubDate><description><![CDATA[拓扑排序+关键路径]]></description><category></category></item><item><title><![CDATA[CodeForces-Multiples of Length]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128727598</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128727598</guid><author>ikunnnaaa</author><pubDate>Wed, 18 Jan 2023 16:17:36 +0800</pubDate><description><![CDATA[思维构造题目]]></description><category></category></item><item><title><![CDATA[坑：关于使用endl超时的问题]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128428120</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128428120</guid><author>ikunnnaaa</author><pubDate>Sat, 24 Dec 2022 14:11:01 +0800</pubDate><description><![CDATA[endl输出超时问题]]></description><category></category></item><item><title><![CDATA[洛谷：P1443 马的遍历]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128425072</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128425072</guid><author>ikunnnaaa</author><pubDate>Fri, 23 Dec 2022 22:41:51 +0800</pubDate><description><![CDATA[路径问题与bfs广搜 ]]></description><category></category></item><item><title><![CDATA[AcWing 4261. 孤独的照片]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128405073</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128405073</guid><author>ikunnnaaa</author><pubDate>Thu, 22 Dec 2022 10:16:38 +0800</pubDate><description><![CDATA[找规律 /枚举]]></description><category></category></item><item><title><![CDATA[洛谷：P1036 [NOIP2002 普及组] 选数]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128366468</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128366468</guid><author>ikunnnaaa</author><pubDate>Sun, 18 Dec 2022 21:53:20 +0800</pubDate><description><![CDATA[dfs搜索 或 二进制枚举 题目]]></description><category></category></item><item><title><![CDATA[洛谷：P1003 [NOIP2011 提高组] 铺地毯]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128357952</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128357952</guid><author>ikunnnaaa</author><pubDate>Sat, 17 Dec 2022 22:15:39 +0800</pubDate><description><![CDATA[栈的运用]]></description><category></category></item><item><title><![CDATA[洛谷：P1002 [NOIP2002 普及组] 过河卒]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128313925</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128313925</guid><author>ikunnnaaa</author><pubDate>Wed, 14 Dec 2022 11:39:44 +0800</pubDate><description><![CDATA[动态规划(dp)  不同路径问题 ]]></description><category></category></item><item><title><![CDATA[自制迷宫小游戏 ：O 的冒险]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128250595</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128250595</guid><author>ikunnnaaa</author><pubDate>Fri, 09 Dec 2022 11:53:05 +0800</pubDate><description><![CDATA[一款迷宫谜题游戏]]></description><category></category></item><item><title><![CDATA[猜对了一半(*) 2020天梯赛]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128220253</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128220253</guid><author>ikunnnaaa</author><pubDate>Wed, 07 Dec 2022 14:54:48 +0800</pubDate><description><![CDATA[暴力枚举]]></description><category></category></item><item><title><![CDATA[洛谷:P3654 First Step (ファーストステップ)]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128140370</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128140370</guid><author>ikunnnaaa</author><pubDate>Thu, 01 Dec 2022 22:58:16 +0800</pubDate><description><![CDATA[洛谷:P3654 First Step (ファーストステップ)]]></description><category></category></item><item><title><![CDATA[洛谷:P1090 [NOIP2004 提高组] 合并果子 / [USACO06NOV] Fence Repair G]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128129361</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128129361</guid><author>ikunnnaaa</author><pubDate>Thu, 01 Dec 2022 11:34:53 +0800</pubDate><description><![CDATA[P1090 [NOIP2004 提高组] 合并果子 / [USACO06NOV] Fence Repair G]]></description><category></category></item><item><title><![CDATA[分而治之 （天梯模拟题目）]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128071945</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/128071945</guid><author>ikunnnaaa</author><pubDate>Sun, 27 Nov 2022 23:26:41 +0800</pubDate><description><![CDATA[分而治之，各个击破是兵家常用的策略之一。在战争中，我们希望首先攻下敌方的部分城市，使其剩余的城市变成孤立无援，然后再分头各个击破。为此参谋部提供了若干打击方案。本题就请你编写程序，判断每个方案的可行性。]]></description><category></category></item><item><title><![CDATA[ZZULIOJ 2952 :stO SCZ Orz (超大数求余）]]></title><link>https://blog.youkuaiyun.com/ikunnnaaa/article/details/127622733</link><guid>https://blog.youkuaiyun.com/ikunnnaaa/article/details/127622733</guid><author>ikunnnaaa</author><pubDate>Mon, 31 Oct 2022 20:27:50 +0800</pubDate><description><![CDATA[题目描述
众所周知丫,scz是21级最强的acmer,每一个21级甚至是20级acm队员都想膜拜他,因为膜拜的膜与取模的模发音相似,于是scz这一次想让你帮助他解决一道题目
 
请输出 a%b的值
]]></description><category></category></item></channel></rss>