<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[深秋的落叶]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/lmyclever</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; lmyclever]]></copyright><item><title><![CDATA[博客搬家至[http://limyao.com/]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8725884</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8725884</guid><author>lmyclever</author><pubDate>Wed, 27 Mar 2013 11:56:45 +0800</pubDate><description><![CDATA[博客搬家至  http://limyao.com/]]></description><category></category></item><item><title><![CDATA[EOJ 2782 Welcome to 2009 ACM selective trial [2010年研究生机试]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8725881</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8725881</guid><author>lmyclever</author><pubDate>Wed, 27 Mar 2013 11:55:49 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
 
struct In
{
    char key[20];
    char value[20];
}s[6];
 
int main()
{
    strcpy(s[0].key,"E");strcpy(s[0].value,"Excellent");
    strcpy(s[1].key,"C");strc]]></description><category></category></item><item><title><![CDATA[EOJ 2690 Soda Surpler [2010年研究生机试]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8725878</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8725878</guid><author>lmyclever</author><pubDate>Wed, 27 Mar 2013 11:55:23 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
 
 
int main()
{
    int e,f,c;
    while(scanf("%d %d %d",&e,&f,&c)!=EOF)
    {
        int num=0;
        e=e+f;
        while(true)
        {
            if(]]></description><category></category></item><item><title><![CDATA[EOJ 2537 统计字符 [2010年研究生机试]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8725875</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8725875</guid><author>lmyclever</author><pubDate>Wed, 27 Mar 2013 11:54:55 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
 
int main()
{
    int N;
    scanf("%d",&N);
    getchar();
    char str[10005];
    while(N--)
    {
        gets(str);
        int len=strlen(str);
        i]]></description><category></category></item><item><title><![CDATA[C++ 条件编译]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8720536</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8720536</guid><author>lmyclever</author><pubDate>Tue, 26 Mar 2013 10:29:25 +0800</pubDate><description><![CDATA[#define Max


#if Min
a=1;
#elif define Max
a=2;
#else
//a=3;
#endif


#ifdef Max
//a=4;
#endif


#ifndef Max
a=5;
#endif


#undef Max]]></description><category></category></item><item><title><![CDATA[Range Minimum Query and Lowest Common Ancestor[翻译]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8716121</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8716121</guid><author>lmyclever</author><pubDate>Mon, 25 Mar 2013 11:19:55 +0800</pubDate><description><![CDATA[转自：http://www.cnblogs.com/drizzlecrj/archive/2007/10/23/933472.html


                                       Range
 Minimum Query and Lowest Common Ancestor

    【原文见  http://www.topcoder.com/tc]]></description><category></category></item><item><title><![CDATA[EOJ 2575 Separate Connections [2009年研究生机试]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8711051</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8711051</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 21:16:02 +0800</pubDate><description><![CDATA[带花树开花算法




#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
 
using namespace std;
 
#define MAXN 250
#define MAXE MAXN*MAXN*2
#defin]]></description><category></category></item><item><title><![CDATA[EOJ 2574 Principles of Compiler [2009年研究生机试]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8709953</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8709953</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 15:12:25 +0800</pubDate><description><![CDATA[在大神的指点下AC了，起初用了编译原理的下推自动机，没AC掉，看来是自己把题目想复杂了……




#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

char ex[110]]]></description><category></category></item><item><title><![CDATA[EOJ 2143 端午节快乐 [2010研究生机试-热身]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8709729</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8709729</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 13:57:41 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
 
using namespace std;
 
int num[1030];
 
int main()
{
    int n,a,b;
    scanf("%d",&n);
    while(n--)
    {
        s]]></description><category></category></item><item><title><![CDATA[EOJ 2610 工程 [2010研究生机试-热身]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8709727</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8709727</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 13:56:54 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
 
using namespace std;
 
int num[1030];
 
int main()
{
    int t,m,k,tmp;
    scanf("%d",&t);
    while(t--)
    {]]></description><category></category></item><item><title><![CDATA[EOJ 2573 Hub Connection plan [2009年研究生机试]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8709323</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8709323</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 11:14:04 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
 
struct Mmap
{
    int a,b;
    int cost;
}mmap[15005];
 
int cmp( const void *a ,const void *b)
{
	return (*(Mmap *)a).cost > (*(Mmap *)b).cost ? 1 : -1;
}
in]]></description><category></category></item><item><title><![CDATA[EOJ 2572 Sort it… [2009年研究生机试]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8709320</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8709320</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 11:12:54 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
 
 
int main()
{
    int N,K,t;
    int arr[100010];
    memset(arr,0,sizeof(arr));
    scanf("%d",&N);
    while(N--)
    {
        scanf("%d",&t);
        arr[t]++;]]></description><category></category></item><item><title><![CDATA[EOJ 2571 GCD and LCM [2009年研究生机试]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8709318</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8709318</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 11:12:08 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
int gcd(int a,int b)
{
    while(a!=b)
    {
        if (a>b)
            a=a-b;
        else
            b=b-a;
    }
    return a;
}
 
int main()
{
    int mgcd,mlcm;]]></description><category></category></item><item><title><![CDATA[EOJ 2570 Primes Pair [2009年研究生机试]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8709304</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8709304</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 11:10:00 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
 
int main()
{
    int prime[10010];
    memset(prime,1,sizeof(prime));
    prime[0]=prime[1]=0;
    for(int i=2;i<10010;i++)
    {
        for(int j=2;j<i;j++)
        {]]></description><category></category></item><item><title><![CDATA[EOJ 2569 Capitalize [2009年研究生机试]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8709283</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8709283</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 11:06:03 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
 
int main()
{
    char str[5000];
    while( gets(str) )
    {
        int len=strlen(str);
        for(int i=0;i<len;i++)
        {
            if('a'<=str[i]&&str[i]<=]]></description><category></category></item><item><title><![CDATA[EOJ 2568 Sum of digit  [2009年研究生机试]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8709274</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8709274</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 11:04:41 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
 
int main()
{
    int n;
    int sum;
    int a,b;
    scanf("%d",&n);
    while(n--)
    {
        scanf("%d %d",&a,&b);
        sum=a+b;
        int i=1;
        while]]></description><category></category></item><item><title><![CDATA[EOJ 2857 编辑距离 [2011年研究生机试 热身]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8709244</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8709244</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 10:58:53 +0800</pubDate><description><![CDATA[动态规划



#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

int dp[510][510];
char strA[510];
char strB[510];
int f]]></description><category></category></item><item><title><![CDATA[EOJ 2856 仰望星空 [2011年研究生机试 热身]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8709018</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8709018</guid><author>lmyclever</author><pubDate>Sat, 23 Mar 2013 09:58:27 +0800</pubDate><description><![CDATA[深搜  dfs

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

char mmap[1000+10][80+10];
bool mark[1000+10][80+10];
in]]></description><category></category></item><item><title><![CDATA[EOJ 2855 贪吃蛇 [2011年研究生机试 热身]]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8708300</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8708300</guid><author>lmyclever</author><pubDate>Fri, 22 Mar 2013 22:03:39 +0800</pubDate><description><![CDATA[模拟题





#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

int f[1010];
int h,w,t;
void init()
{
    f[0]=0;f[1]]></description><category></category></item><item><title><![CDATA[ZOJ 1854 Election]]></title><link>https://blog.youkuaiyun.com/lmyclever/article/details/8706886</link><guid>https://blog.youkuaiyun.com/lmyclever/article/details/8706886</guid><author>lmyclever</author><pubDate>Fri, 22 Mar 2013 16:12:45 +0800</pubDate><description><![CDATA[#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 

using namespace std;

struct E
{
    char name[100];
    char party[100];
    int vote;
}]]></description><category></category></item></channel></rss>