<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[N11ko的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/N11ko</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; N11ko]]></copyright><item><title><![CDATA[P1423 小玉在游泳 题解]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/129998411</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/129998411</guid><author>N11ko</author><pubDate>Thu, 06 Apr 2023 20:25:36 +0800</pubDate><description><![CDATA[题目描述小玉开心的在游泳，可是她很快难过的发现，自己的力气不够，游泳好累哦。已知小玉第一步能游2 米，可是随着越来越累，力气越来越小，她接下来的每一步都只能游出上一步距离的98%。现在小玉想知道，如果要游到距离 s 米的地方，她需要游多少步呢。请你编程解决这个问题。]]></description><category></category></item><item><title><![CDATA[LCM(最小公倍数），GCD(最大公约数)]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/129994032</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/129994032</guid><author>N11ko</author><pubDate>Thu, 06 Apr 2023 17:04:34 +0800</pubDate><description><![CDATA[c++内置函数中__gcd(int a,int b)可以直接返回最大公约数。]]></description><category></category></item><item><title><![CDATA[Cpp输出结果保留场宽问题]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/129712195</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/129712195</guid><author>N11ko</author><pubDate>Wed, 22 Mar 2023 16:05:44 +0800</pubDate><description><![CDATA[c++中加入头文件
输出时cout&lt;&lt;setw(保留的场宽数)&lt;&lt;n;
左对齐：cout&lt;&lt;left&lt;&lt;setw()&lt;&lt;…
右对齐：cout&lt;&lt;right&lt;&lt;setw()&lt;&lt;…
c中加入头文件
输出时printf(“%5d”,n);
左对齐：printf(“%-5d”,…)

]]></description><category></category></item><item><title><![CDATA[最大连通块问题（dfs做法)]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/129696356</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/129696356</guid><author>N11ko</author><pubDate>Tue, 21 Mar 2023 20:08:31 +0800</pubDate><description><![CDATA[第十四届蓝桥杯第三次模拟赛。]]></description><category></category></item><item><title><![CDATA[把10进制数n转化为m进制数的函数]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/129674430</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/129674430</guid><author>N11ko</author><pubDate>Mon, 20 Mar 2023 19:41:19 +0800</pubDate><description><![CDATA[【代码】把10进制数n转化为m进制数的函数。]]></description><category></category></item><item><title><![CDATA[蛇形矩阵问题]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/129506069</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/129506069</guid><author>N11ko</author><pubDate>Mon, 13 Mar 2023 20:51:02 +0800</pubDate><description><![CDATA[蛇形矩阵]]></description><category></category></item><item><title><![CDATA[欧几里得距离和曼哈顿距离]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/129182834</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/129182834</guid><author>N11ko</author><pubDate>Thu, 23 Feb 2023 15:34:01 +0800</pubDate><description><![CDATA[X星球居民小区的楼房全是一样的，并且按矩阵样式排列。其楼房的编号为1,2,3…当排满一行时，从下一行相邻的楼往反方向排号。输入为 3 个整数 w m n，空格分开，都在 1 到 10000 范围内。w为排号宽度，m,n为待计算的楼号。我们的问题是：已知了两个楼号 m 和 n，需要求出它们之间的最短移动距离（不能斜线方向移动）要求输出一个整数，表示 m n 两楼间最短移动距离。]]></description><category></category></item><item><title><![CDATA[【刘汝佳】习题3-1 UVA1585]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/127734755</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/127734755</guid><author>N11ko</author><pubDate>Mon, 07 Nov 2022 16:59:41 +0800</pubDate><description><![CDATA[《算法竞赛入门经典》]]></description><category></category></item><item><title><![CDATA[CPP新知识点]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/127499232</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/127499232</guid><author>N11ko</author><pubDate>Mon, 24 Oct 2022 19:25:50 +0800</pubDate><description><![CDATA[2022,10,24]]></description><category></category></item><item><title><![CDATA[##MySixthLog]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/127456903</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/127456903</guid><author>N11ko</author><pubDate>Sun, 23 Oct 2022 16:08:12 +0800</pubDate><description><![CDATA[SixthLog]]></description><category></category></item><item><title><![CDATA[##MyfifthLog]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/127443047</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/127443047</guid><author>N11ko</author><pubDate>Fri, 21 Oct 2022 12:23:01 +0800</pubDate><description><![CDATA[FIfthLog]]></description><category></category></item><item><title><![CDATA[dotcpp随记]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/127436677</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/127436677</guid><author>N11ko</author><pubDate>Thu, 20 Oct 2022 22:57:49 +0800</pubDate><description><![CDATA[自定义函数之字符类型统计]]></description><category></category></item><item><title><![CDATA[##MyFourthLog]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/127425218</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/127425218</guid><author>N11ko</author><pubDate>Thu, 20 Oct 2022 14:49:10 +0800</pubDate><description><![CDATA[FourthLog]]></description><category></category></item><item><title><![CDATA[##MyThirdLog]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/127407875</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/127407875</guid><author>N11ko</author><pubDate>Wed, 19 Oct 2022 21:34:33 +0800</pubDate><description><![CDATA[ThirdLog]]></description><category></category></item><item><title><![CDATA[##MySecondLog]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/127393477</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/127393477</guid><author>N11ko</author><pubDate>Tue, 18 Oct 2022 20:00:29 +0800</pubDate><description><![CDATA[SecondLog]]></description><category></category></item><item><title><![CDATA[##MYfirstLog]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/127372459</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/127372459</guid><author>N11ko</author><pubDate>Mon, 17 Oct 2022 19:00:07 +0800</pubDate><description><![CDATA[FirstLog]]></description><category></category></item><item><title><![CDATA[#FirstStudyLog]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/127232533</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/127232533</guid><author>N11ko</author><pubDate>Sun, 09 Oct 2022 19:37:29 +0800</pubDate><description><![CDATA[Log1]]></description><category></category></item><item><title><![CDATA[2022.4.9蓝桥杯记录]]></title><link>https://blog.youkuaiyun.com/N11ko/article/details/124063209</link><guid>https://blog.youkuaiyun.com/N11ko/article/details/124063209</guid><author>N11ko</author><pubDate>Sat, 09 Apr 2022 16:38:15 +0800</pubDate><description><![CDATA[20220409]]></description><category></category></item></channel></rss>