<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Jsjjsnmsk的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Jsjjsnmsk</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Jsjjsnmsk]]></copyright><item><title><![CDATA[esp32-c3WiFi时钟:1_初始化]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/141051182</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/141051182</guid><author>Jsjjsnmsk</author><pubDate>Fri, 09 Aug 2024 14:41:51 +0800</pubDate><description><![CDATA[esp32-c3WiFi时钟:1_初始化]]></description><category></category></item><item><title><![CDATA[c++代码行统计程序]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/140052012</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/140052012</guid><author>Jsjjsnmsk</author><pubDate>Fri, 28 Jun 2024 19:59:15 +0800</pubDate><description><![CDATA[c++代码行统计程序]]></description><category></category></item><item><title><![CDATA[devc++跑酷小游戏4.1.5]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/140051815</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/140051815</guid><author>Jsjjsnmsk</author><pubDate>Fri, 28 Jun 2024 19:48:06 +0800</pubDate><description><![CDATA[devc++跑酷小游戏4.1.5]]></description><category></category></item><item><title><![CDATA[devc++跑酷小游戏4.0.0]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136995925</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136995925</guid><author>Jsjjsnmsk</author><pubDate>Sun, 24 Mar 2024 21:48:57 +0800</pubDate><description><![CDATA[devc++小游戏4.0.0]]></description><category></category></item><item><title><![CDATA[8x8图形取模软件2.0]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136995826</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136995826</guid><author>Jsjjsnmsk</author><pubDate>Sun, 24 Mar 2024 21:35:29 +0800</pubDate><description><![CDATA[更新：选中的格子可以取消选中，程序结束时暂停，直到用户输入enter。一不小心把它也开始连载了，最近又有考试，只能偶尔更新一下了。]]></description><category></category></item><item><title><![CDATA[devc++8x8取模软件]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136543638</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136543638</guid><author>Jsjjsnmsk</author><pubDate>Thu, 07 Mar 2024 19:39:24 +0800</pubDate><description><![CDATA[这几天在搞arduino nano和单个max7219模块，涉及到16进制的取模，在网上转了一圈，没找到合适的取模软件，于是自己做了一个，试过，可以用，按esc退出并生成16进制的取模结果。]]></description><category></category></item><item><title><![CDATA[devc++小游戏3.8.5]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136514585</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136514585</guid><author>Jsjjsnmsk</author><pubDate>Wed, 06 Mar 2024 18:58:59 +0800</pubDate><description><![CDATA[devc++小游戏3.8.5]]></description><category></category></item><item><title><![CDATA[devc++跑酷小游戏3.5.0]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136273736</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136273736</guid><author>Jsjjsnmsk</author><pubDate>Wed, 28 Feb 2024 22:07:34 +0800</pubDate><description><![CDATA[本来想搞存档的，失败了，要再学学文件操作的函数。还有一个打印地图的函数，更失败，彻底放弃。最近开学了，游戏不会经常更新，要写作业。]]></description><category></category></item><item><title><![CDATA[信息学奥赛一本通1205：汉诺塔问题]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136288247</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136288247</guid><author>Jsjjsnmsk</author><pubDate>Sun, 25 Feb 2024 22:06:41 +0800</pubDate><description><![CDATA[约19世纪末，在欧州的商店中出售一种智力玩具，在一块铜板上有三根杆，最左边的杆上自上而下、由小到大顺序串着由64个圆盘构成的塔。目的是将最左边杆上的盘全部移到中间的杆上，条件是一次只能移动一个盘，且不允许大盘放在小盘的上面。由于条件是一次只能移动一个盘，且不允许大盘放在小盘上面，所以64个盘的移动次数是：18,446,744,073,709,551,615。每次移动的记录为例如 a->3->b 的形式，即把编号为3的盘子从a杆移至b杆。整数为盘子的数目，后三个字符表示三个杆子的编号。1205：汉诺塔问题。]]></description><category></category></item><item><title><![CDATA[信息学奥赛一本通1210：因子分解]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136273689</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136273689</guid><author>Jsjjsnmsk</author><pubDate>Sat, 24 Feb 2024 17:04:49 +0800</pubDate><description><![CDATA[时间限制: 1000 ms         内存限制: 65536 KB。如果该整数可以分解出因子a的b次方，当b大于1时，写做。提交数: 17700     通过数: 11248。输入一个数，输出其素因子分解表达式。输入一个整数 n(2≤n<100)。当b等于1时，则直接写成a。表达式中各个素数从小到大排列。输出该整数的因子分解表达式。]]></description><category></category></item><item><title><![CDATA[信息学奥赛一本通1209：分数求和]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136264961</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136264961</guid><author>Jsjjsnmsk</author><pubDate>Fri, 23 Feb 2024 22:53:34 +0800</pubDate><description><![CDATA[先算每个分母与当前分母的最大公约数，进而求出最小公倍数，通分，通分完后约分。接下来n行，每行一个分数，用"p/q"的形式表示，不含空格，p，q均不超过1010。如：5/6、10/3均是最简形式，而3/6需要化简为1/2,3/1需要化简为3。时间限制: 1000 ms         内存限制: 65536 KB。输出只有一行，即最终结果的最简形式。若为分数，用"p/q"的形式表示。提交数: 19111     通过数: 10647。第一行是一个整数n，表示分数个数，1≤n≤10；]]></description><category></category></item><item><title><![CDATA[信息学奥赛一本通1202：Pell数列]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136243645</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136243645</guid><author>Jsjjsnmsk</author><pubDate>Thu, 22 Feb 2024 21:43:16 +0800</pubDate><description><![CDATA[下面是1202的源代码，第六行的if判断也可以写成 if(b[x]!第1行是测试数据的组数 n，后面跟着 n 行输入。Pell数列a1,a2,a3,...的定义是这样的，a1=1,a2=2,...,an=2an−1+an−2(n>2)。和1189不能说是十分相似只能说是一模一样，用1189的程序还快将近一倍？给出一个正整数 k，要求Pell数列的第 k 项模上 32767 是多少。只不过一个是递归一个是递推，一定要用记忆化，不然超时别怪我。n 行，每行输出对应一个输入。1189：30~40ms左右。]]></description><category></category></item><item><title><![CDATA[信息学奥赛一本通1203：扩号匹配问题（栈）]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136221197</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136221197</guid><author>Jsjjsnmsk</author><pubDate>Wed, 21 Feb 2024 21:41:50 +0800</pubDate><description><![CDATA[信息学奥赛一本通1203：扩号匹配问题]]></description><category></category></item><item><title><![CDATA[信息学奥赛一本通1188：菲波那契数列(2)]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136198271</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136198271</guid><author>Jsjjsnmsk</author><pubDate>Tue, 20 Feb 2024 20:37:54 +0800</pubDate><description><![CDATA[信息学奥赛一本通1188：菲波那契数列(2)]]></description><category></category></item><item><title><![CDATA[devc++跑酷小游戏底层讲解]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136165990</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136165990</guid><author>Jsjjsnmsk</author><pubDate>Mon, 19 Feb 2024 16:29:27 +0800</pubDate><description><![CDATA[devc++跑酷小游戏底层讲解]]></description><category></category></item><item><title><![CDATA[devc++跑酷小游戏3.0.0]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136142836</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136142836</guid><author>Jsjjsnmsk</author><pubDate>Sun, 18 Feb 2024 09:23:07 +0800</pubDate><description><![CDATA[devc++跑酷小游戏3.0.0]]></description><category></category></item><item><title><![CDATA[信息学奥赛一本通1177：奇数单增序列]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136131671</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136131671</guid><author>Jsjjsnmsk</author><pubDate>Fri, 16 Feb 2024 19:42:06 +0800</pubDate><description><![CDATA[信息学奥赛一本通1177：奇数单增序列]]></description><category></category></item><item><title><![CDATA[devc++跑酷游戏2.4.0]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136123362</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136123362</guid><author>Jsjjsnmsk</author><pubDate>Thu, 15 Feb 2024 21:21:06 +0800</pubDate><description><![CDATA[devc++跑酷游戏2.4.0]]></description><category></category></item><item><title><![CDATA[信息学奥赛一本通1314：【例3.6】过河卒(Noip2002)]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136122486</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136122486</guid><author>Jsjjsnmsk</author><pubDate>Thu, 15 Feb 2024 20:03:37 +0800</pubDate><description><![CDATA[1314：【例3.6】过河卒(Noip2002)]]></description><category></category></item><item><title><![CDATA[信息学奥赛一本通1258：【例9.2】数字金字塔]]></title><link>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136121997</link><guid>https://blog.youkuaiyun.com/Jsjjsnmsk/article/details/136121997</guid><author>Jsjjsnmsk</author><pubDate>Thu, 15 Feb 2024 18:03:53 +0800</pubDate><description><![CDATA[1258：【例9.2】数字金字塔。]]></description><category></category></item></channel></rss>