<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[a3709的博客]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/a3709</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; a3709]]></copyright><item><title><![CDATA[九度OJ 题目1432：叠筐]]></title><link>https://blog.youkuaiyun.com/a3709/article/details/79646578</link><guid>https://blog.youkuaiyun.com/a3709/article/details/79646578</guid><author>a3709</author><pubDate>Wed, 21 Mar 2018 21:41:56 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
#include&amp;lt;cstdio&amp;gt;
using namespace std;

int main()
{
    char outPutBuf[82][82];
    char a,b;
    int n;
    bool firstcase=true;
    while(scanf(&quot;%d %c %c&quot;,&amp;amp;n,&amp;amp...]]></description><category></category></item><item><title><![CDATA[九度OJ 题目1088：剩下的树]]></title><link>https://blog.youkuaiyun.com/a3709/article/details/79642809</link><guid>https://blog.youkuaiyun.com/a3709/article/details/79642809</guid><author>a3709</author><pubDate>Wed, 21 Mar 2018 17:10:49 +0800</pubDate><description><![CDATA[来源：2011年清华大学计算机研究生机试真题#include &amp;lt;iostream&amp;gt;


using namespace std;


int main()
{
    int l,m;
    while(cin&amp;gt;&amp;gt;l&amp;gt;&amp;gt;m){
        int len[10001]={0};
        for(int i=0;i&amp;lt;m;++i){
      ...]]></description><category></category></item><item><title><![CDATA[九度oj 1156 谁是你的潜在朋友]]></title><link>https://blog.youkuaiyun.com/a3709/article/details/79642448</link><guid>https://blog.youkuaiyun.com/a3709/article/details/79642448</guid><author>a3709</author><pubDate>Wed, 21 Mar 2018 16:53:42 +0800</pubDate><description><![CDATA[2011年北京大学计算机研究生机试真题.#include &amp;lt;iostream&amp;gt;

using namespace std;
//int a[205],b[]
int main()
{
    int n,m;
    while(cin&amp;gt;&amp;gt;n&amp;gt;&amp;gt;m){
        int a[205],b[205]={0};
        for(int i=0;i&amp;lt...]]></description><category></category></item><item><title><![CDATA[九度oj 1186 打印日期]]></title><link>https://blog.youkuaiyun.com/a3709/article/details/79617899</link><guid>https://blog.youkuaiyun.com/a3709/article/details/79617899</guid><author>a3709</author><pubDate>Mon, 19 Mar 2018 21:31:09 +0800</pubDate><description><![CDATA[来源：2003-2005年华中科技大学计算机研究生机试真题#include &amp;lt;iostream&amp;gt;
#include&amp;lt;cstdio&amp;gt;
using namespace std;
#define isyear(x) (x%4==0&amp;amp;&amp;amp;x%100!=0||x%400==0?1:0)
int dayofmonth[13][2]={
    0,0,
    31,31...]]></description><category></category></item><item><title><![CDATA[九度oj 1070 今年的第几天？]]></title><link>https://blog.youkuaiyun.com/a3709/article/details/79617393</link><guid>https://blog.youkuaiyun.com/a3709/article/details/79617393</guid><author>a3709</author><pubDate>Mon, 19 Mar 2018 20:57:06 +0800</pubDate><description><![CDATA[2003年清华大学计算机研究生机试真题/*  //这是直接计算
#include &amp;lt;iostream&amp;gt;
#define isyear(x) (x%100!=0&amp;amp;&amp;amp;x%4==0||x%400==0?1:0)
using namespace std;
int md1[]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int md2[]={...]]></description><category></category></item><item><title><![CDATA[九度oj1070 今年的第几天？]]></title><link>https://blog.youkuaiyun.com/a3709/article/details/79606529</link><guid>https://blog.youkuaiyun.com/a3709/article/details/79606529</guid><author>a3709</author><pubDate>Mon, 19 Mar 2018 01:24:09 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
#define isyear(x) (x%100!=0&amp;amp;&amp;amp;x%4==0||x%400==0?1:0)
using namespace std;
int md1[]={0,31,29,31,30,31,30,31,31,30,31,30,31};
int md2[]={0,31,28,31,30,31,30,31,31,30,31,...]]></description><category></category></item><item><title><![CDATA[九度oj1054 字符串内排序]]></title><link>https://blog.youkuaiyun.com/a3709/article/details/79584622</link><guid>https://blog.youkuaiyun.com/a3709/article/details/79584622</guid><author>a3709</author><pubDate>Fri, 16 Mar 2018 17:28:03 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
#include&amp;lt;cstring&amp;gt;
#include&amp;lt;algorithm&amp;gt;
using namespace std;
char a[250];
int main()
{
    while(cin&amp;gt;&amp;gt;a){
        sort(a,a+strlen(a));
        cout&amp;lt;&amp;lt;a&amp;l...]]></description><category></category></item><item><title><![CDATA[（九度oj亦有）HDU 1862 EXCEL排序]]></title><link>https://blog.youkuaiyun.com/a3709/article/details/79584331</link><guid>https://blog.youkuaiyun.com/a3709/article/details/79584331</guid><author>a3709</author><pubDate>Fri, 16 Mar 2018 17:13:47 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
#include&amp;lt;algorithm&amp;gt;
#include&amp;lt;cstring&amp;gt;
using namespace std;
struct sexcel{
    char num[10];
    char name[10];
    int score;
}excel[100050];
bool cmp1(sexcel c1,...]]></description><category></category></item><item><title><![CDATA[九度oj 特殊排序]]></title><link>https://blog.youkuaiyun.com/a3709/article/details/79583001</link><guid>https://blog.youkuaiyun.com/a3709/article/details/79583001</guid><author>a3709</author><pubDate>Fri, 16 Mar 2018 16:02:38 +0800</pubDate><description><![CDATA[#include &amp;lt;iostream&amp;gt;
#include&amp;lt;algorithm&amp;gt;
using namespace std;

int main()
{
    int n;
    int a[1050];
    while(cin&amp;gt;&amp;gt;n){
        for(int i=0;i&amp;lt;n;++i){
            cin&amp;gt;&amp;gt;a[i]...]]></description><category></category></item></channel></rss>