zoj 3818 Pretty Poem(模擬)

zoj 3818 Pretty Poem(模擬)

# include 
# include 
# include 
# define  MAX 55
using namespace std;
int L;
char a[MAX];
int vis[MAX];
int judge1()//ababa
{
    int i,j;
    int xx,yy,zz;
    char x[MAX],y[MAX],z[MAX];
    for(i=2; i*2=i)
            continue;
        char A[MAX],B[MAX];
        for(j=0; j='a')||(b[i]<='Z'&&b[i]>='A'))
                a[L++]=b[i];
        }
        a[L]='\0';
        if(judge1())
        {
            printf("Yes\n");
            continue;
        }
        if(judge2())
        {
            printf("Yes\n");
            continue;
        }
        printf("No\n");
    }
    return 0;
}