<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[FPrince的小窝]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/f22fbi</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; f22fbi]]></copyright><item><title><![CDATA[VS的臃肿]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/6474418</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/6474418</guid><author>f22fbi</author><pubDate>Fri, 04 Sep 2009 23:21:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[SRM 114 DIV2 [550]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/6473595</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/6473595</guid><author>f22fbi</author><pubDate>Wed, 26 Aug 2009 23:20:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[我是为了拿积分发的]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/6471697</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/6471697</guid><author>f22fbi</author><pubDate>Wed, 05 Aug 2009 17:19:00 +0800</pubDate><description><![CDATA[]]></description><category></category></item><item><title><![CDATA[SRM 397 DIV2 [1000]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2358244</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2358244</guid><author>f22fbi</author><pubDate>Fri, 02 May 2008 00:12:00 +0800</pubDate><description><![CDATA[#includeiostream>#includevector>#includeset>#includealgorithm>using namespace std;class CollectingMarbles ...{public:    int mostMarbles(vectorint>, int, int);    int run(int, int, int);};int dp[819]]></description><category></category></item><item><title><![CDATA[SRM 400 DIV2 [500]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2358217</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2358217</guid><author>f22fbi</author><pubDate>Thu, 01 May 2008 23:59:00 +0800</pubDate><description><![CDATA[#includeiostream>#includestring>#includevector>#includeset>#includealgorithm>#includememory.h>#includecmath>#includecstdio>using namespace std;long long num;bool is(int p,int q)...{    long long tem]]></description><category></category></item><item><title><![CDATA[SRM 400 DIV2 [250]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2358214</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2358214</guid><author>f22fbi</author><pubDate>Thu, 01 May 2008 23:57:00 +0800</pubDate><description><![CDATA[#includeiostream>#includevector>#includecmath>using namespace std;class GrabbingTaxi...{public:    int minTime(vector int> tXs, vector int> tYs, int gX, int gY, int walkTime, int taxiTime)    ...{  ]]></description><category></category></item><item><title><![CDATA[SRM 397 DIV2 [500]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2340525</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2340525</guid><author>f22fbi</author><pubDate>Mon, 28 Apr 2008 19:18:00 +0800</pubDate><description><![CDATA[ #includeiostream>#includequeue>#includevector>#includeset>#includealgorithm>using namespace std;vectorint> swap(vectorint> a,int beg,int len)...{    int mid=len/2,end=beg+len-1;;    for (int i=0;]]></description><category></category></item><item><title><![CDATA[SRM 387 DIV2 [600]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2335693</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2335693</guid><author>f22fbi</author><pubDate>Sun, 27 Apr 2008 19:32:00 +0800</pubDate><description><![CDATA[#includeiostream>#includestring>#includevector>using namespace std;class MarblesRegroupingEasy...{public:    int minMoves(vectorstring> boxes)    ...{        int res,len;        res=boxes.size()-1; ]]></description><category></category></item><item><title><![CDATA[字符串的展开]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2332508</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2332508</guid><author>f22fbi</author><pubDate>Sat, 26 Apr 2008 16:49:00 +0800</pubDate><description><![CDATA[ 2.     字符串的展开（expand.pas/c/cpp）【问题描述】在初赛普及组的“阅读程序写结果”的问题中，我们曾给出一个字符串展开的例子：如果在输入的字符串中，含有类似于“d-h”或者“4-8”的字串，我们就把它当作一种简写，输出时，用连续递增的字母获数字串替代其中的减号，即，将上面两个子串分别输出为“defgh”和“45678”。在本题中，我们通过增加一些参数的设]]></description><category></category></item><item><title><![CDATA[简单数列]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2332472</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2332472</guid><author>f22fbi</author><pubDate>Sat, 26 Apr 2008 16:32:00 +0800</pubDate><description><![CDATA[111211211111221找出上面数列的规律，设计一个程序能输出这个数列的前N项(N=20)解答：数列规律：第一行：1，没什么好说的第二行：11，"1"个"1"第三行：21，"2"个"1"第四行：1211，"1"个"2"和"1"个"1"第五行：111221，"1"个"1"、"1"个"2"和"2"个"1"明白了吧，很简单所以，第六行就是312211，"3"个"1"、"2"个"2"和"1"个"]]></description><category></category></item><item><title><![CDATA[高精计算]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2332464</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2332464</guid><author>f22fbi</author><pubDate>Sat, 26 Apr 2008 16:30:00 +0800</pubDate><description><![CDATA[ 高精计算编写一个以字符串为基础进行整数加法的一个程序。这个整数包含符号位，总长不超过255位（因为某些语言的字符串有长度限制）。输入文件格式：两行，每行为一个长度不超过255的十进制数。可以是负的，负号算一位，既负数的数字部分不超过254位。in.txt输出文件格式：一行，得数。out.txt#includefstream>#includevector>#includestrin]]></description><category></category></item><item><title><![CDATA[SRM 387 DIV2 [250]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2332446</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2332446</guid><author>f22fbi</author><pubDate>Sat, 26 Apr 2008 16:24:00 +0800</pubDate><description><![CDATA[#includeiostream>#includevector>using namespace std;class GuessingNextElement...{public:    int guess(vectorint> A)    ...{        if (A[1]-A[0]==A[2]-A[1])...{            return A[A.size()-1]+A[1]-]]></description><category></category></item><item><title><![CDATA[SRM 399 DIV2 [250]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2332188</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2332188</guid><author>f22fbi</author><pubDate>Sat, 26 Apr 2008 15:05:00 +0800</pubDate><description><![CDATA[#includeiostream>#includevector>using namespace std;class CircularLine...{public:    int longestTravel(vectorint> t)    ...{        int len=t.size();        int longest=0;        for (int i=0;i!=len]]></description><category></category></item><item><title><![CDATA[SRM 398 DIV2 [250]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2331846</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2331846</guid><author>f22fbi</author><pubDate>Sat, 26 Apr 2008 13:46:00 +0800</pubDate><description><![CDATA[#includeiostream>#includealgorithm>#includevector>using namespace std;class MinDifference...{public:    int closestElements(int A0,int X,int Y,int M,int n)    ...{        vectorint> ivec(n);        ]]></description><category></category></item><item><title><![CDATA[SRM 397 DIV 2 [250]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2328437</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2328437</guid><author>f22fbi</author><pubDate>Fri, 25 Apr 2008 17:34:00 +0800</pubDate><description><![CDATA[#includeiostream>#includestring>#includemap>using namespace std;class BreakingTheCode...{public:    string decodingEncoding(string code,string message)    ...{        string res;        string aa[]=]]></description><category></category></item><item><title><![CDATA[SRM 114 DIV2  [550]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2328400</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2328400</guid><author>f22fbi</author><pubDate>Fri, 25 Apr 2008 17:27:00 +0800</pubDate><description><![CDATA[#includeiostream>#includevector>#includestring>using namespace std;class BinaryCode...{public:    vectorstring> decode(string message)    ...{        vectorstring> temp;        temp.push_back(messag]]></description><category></category></item><item><title><![CDATA[SRM 114 DIV 2 [200]]]></title><link>https://blog.youkuaiyun.com/f22fbi/article/details/2328392</link><guid>https://blog.youkuaiyun.com/f22fbi/article/details/2328392</guid><author>f22fbi</author><pubDate>Fri, 25 Apr 2008 17:25:00 +0800</pubDate><description><![CDATA[#includeiostream>#includestring>#includecstdlib>using namespace std;class Time...{public:    string whatTime(int seconds)    ...{        int h,m,s;        h=seconds/3600;        seconds=seconds%3600]]></description><category></category></item></channel></rss>