<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[Dylan12_999的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/Dylan12_999</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; Dylan12_999]]></copyright><item><title><![CDATA[pip换源]]></title><link>https://blog.youkuaiyun.com/Dylan12_999/article/details/140655536</link><guid>https://blog.youkuaiyun.com/Dylan12_999/article/details/140655536</guid><author>Dylan12_999</author><pubDate>Wed, 24 Jul 2024 10:32:52 +0800</pubDate><description><![CDATA[【代码】pip换源。]]></description><category></category></item><item><title><![CDATA[斐波那契数列]]></title><link>https://blog.youkuaiyun.com/Dylan12_999/article/details/131690473</link><guid>https://blog.youkuaiyun.com/Dylan12_999/article/details/131690473</guid><author>Dylan12_999</author><pubDate>Wed, 12 Jul 2023 21:11:50 +0800</pubDate><description><![CDATA[斐波那契数列又称兔子繁殖问题、爬楼梯问题，是一种很常用的算法。简单来说就是fn=fn-1+fn-2。]]></description><category></category></item><item><title><![CDATA[C++ String类详解]]></title><link>https://blog.youkuaiyun.com/Dylan12_999/article/details/129430688</link><guid>https://blog.youkuaiyun.com/Dylan12_999/article/details/129430688</guid><author>Dylan12_999</author><pubDate>Thu, 09 Mar 2023 20:58:41 +0800</pubDate><description><![CDATA[在文件顶端写上#include < cstring >或#includestring相当于一个有很多功能的字符数组。]]></description><category></category></item><item><title><![CDATA[openjudge题库1.6 06 校门外的树题解&答案]]></title><link>https://blog.youkuaiyun.com/Dylan12_999/article/details/129348262</link><guid>https://blog.youkuaiyun.com/Dylan12_999/article/details/129348262</guid><author>Dylan12_999</author><pubDate>Sun, 05 Mar 2023 17:38:34 +0800</pubDate><description><![CDATA[某校大门外长度为L的马路上有一排树，每两棵相邻的树之间的间隔都是1米。我们可以把马路看成一个数轴，马路的一端在数轴0的位置，另一端在L的位置；数轴上的每个整数点，即0，1，2，……，L，都种有一棵树。已知任一区域的起始点和终止点的坐标都是整数，区域之间可能有重合的部分。第一行有两个整数L（1 ]]></description><category></category></item></channel></rss>