<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[lee207的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lee207</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lee207]]></copyright><item><title><![CDATA[回文日期题解]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/141026850</link><guid>https://blog.youkuaiyun.com/lee207/article/details/141026850</guid><author>lee207</author><pubDate>Thu, 08 Aug 2024 14:57:23 +0800</pubDate><description><![CDATA[NOIP2016 普及组 T2。]]></description><category></category></item><item><title><![CDATA[填幻方题解]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/140998378</link><guid>https://blog.youkuaiyun.com/lee207/article/details/140998378</guid><author>lee207</author><pubDate>Wed, 07 Aug 2024 18:38:10 +0800</pubDate><description><![CDATA[在一个N×N的正方形网格中，每个格子分别填上从 1 到N×N的正整数，使得正方形中任一行、任一列及对角线的几个数之和都相等，则这种正方形图案就称为“幻方”（输出样例中展示了一个3×3的幻方）。我国古代称为“河图”、“洛书”，又叫“纵横图”。幻方看似神奇，但当N1快来编写一个程序，按上述规则，制作一个N×N的幻方吧。]]></description><category></category></item><item><title><![CDATA[最大子矩阵题解]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/137998502</link><guid>https://blog.youkuaiyun.com/lee207/article/details/137998502</guid><author>lee207</author><pubDate>Sat, 20 Apr 2024 15:00:15 +0800</pubDate><description><![CDATA[已知矩阵的大小定义为矩阵中所有元素的和。给定一个矩阵，你的任务是找到最大的非空(大小至少是1×1)子矩阵。]]></description><category></category></item><item><title><![CDATA[最大子段和题解]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/137712246</link><guid>https://blog.youkuaiyun.com/lee207/article/details/137712246</guid><author>lee207</author><pubDate>Sat, 13 Apr 2024 13:29:15 +0800</pubDate><description><![CDATA[给出一个长度为n的序列a，选出其中连续且非空的一段使得这段和最大。]]></description><category></category></item><item><title><![CDATA[冒泡排序及优化]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/136588478</link><guid>https://blog.youkuaiyun.com/lee207/article/details/136588478</guid><author>lee207</author><pubDate>Sat, 09 Mar 2024 19:13:14 +0800</pubDate><description><![CDATA[冒泡排序是指依次比较两个相邻的数，如果顺序错误就把他们交换过来，直到没有相邻的数需要交换]]></description><category></category></item><item><title><![CDATA[小猫爬山题解]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/135590839</link><guid>https://blog.youkuaiyun.com/lee207/article/details/135590839</guid><author>lee207</author><pubDate>Mon, 15 Jan 2024 00:02:17 +0800</pubDate><description><![CDATA[翰翰和达达饲养了 N 只小猫，这天，小猫们要去爬山。经历了千辛万苦，小猫们终于爬上了山顶，但是疲倦的它们再也不想徒步走下山了（呜咕>_]]></description><category></category></item><item><title><![CDATA[数独问题题解]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/135575939</link><guid>https://blog.youkuaiyun.com/lee207/article/details/135575939</guid><author>lee207</author><pubDate>Sat, 13 Jan 2024 22:55:14 +0800</pubDate><description><![CDATA[数独是根据9×9盘面上的已知数字，推理出所有剩余空格的数字，并满足每一行、每一列、每一个粗线宫内的数字均含1−9，不重复。每一道合格的数独谜题都有且仅有唯一答案，推理方法也以此为基础，任何无解或多解的题目都是不合格的。芬兰一位数学家号称设计出全球最难的“数独游戏”，并刊登在报纸上，让大家去挑战。这位数学家说，他相信只有“智慧最顶尖”的人才有可能破解这个“数独之谜”。据介绍，目前数独游戏的难度的等级有一到五级，一是入门等级，五则比较难。]]></description><category></category></item><item><title><![CDATA[斗地主大师题解（宽搜）]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/135359995</link><guid>https://blog.youkuaiyun.com/lee207/article/details/135359995</guid><author>lee207</author><pubDate>Wed, 03 Jan 2024 12:58:37 +0800</pubDate><description><![CDATA[时间限制:1000ms 内存限制:65536kB]]></description><category></category></item><item><title><![CDATA[八皇后题解]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/135317226</link><guid>https://blog.youkuaiyun.com/lee207/article/details/135317226</guid><author>lee207</author><pubDate>Sun, 31 Dec 2023 17:40:12 +0800</pubDate><description><![CDATA[总时间限制: 10000ms 内存限制: 65536kB。]]></description><category></category></item><item><title><![CDATA[分成互质组题解]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/135294954</link><guid>https://blog.youkuaiyun.com/lee207/article/details/135294954</guid><author>lee207</author><pubDate>Fri, 29 Dec 2023 23:09:02 +0800</pubDate><description><![CDATA[总时间限制: 1000ms 内存限制: 65536kB。]]></description><category></category></item><item><title><![CDATA[城堡问题题解]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/135242919</link><guid>https://blog.youkuaiyun.com/lee207/article/details/135242919</guid><author>lee207</author><pubDate>Wed, 27 Dec 2023 18:03:27 +0800</pubDate><description><![CDATA[总时间限制: 1000ms 内存限制: 65536kB。]]></description><category></category></item><item><title><![CDATA[进制转换题解]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/135175454</link><guid>https://blog.youkuaiyun.com/lee207/article/details/135175454</guid><author>lee207</author><pubDate>Sat, 23 Dec 2023 23:49:35 +0800</pubDate><description><![CDATA[编一程序实现两种不同进制之间的数据转换。]]></description><category></category></item><item><title><![CDATA[全排列题解（数字版）]]></title><link>https://blog.youkuaiyun.com/lee207/article/details/135034590</link><guid>https://blog.youkuaiyun.com/lee207/article/details/135034590</guid><author>lee207</author><pubDate>Sat, 16 Dec 2023 17:17:10 +0800</pubDate><description><![CDATA[按照字典序输出自然数1到n所有不重复的排列，即n的全排列，要求所产生的任一数字序列中不允许出现重复的数字。]]></description><category></category></item></channel></rss>