zoj 3818 Pretty Poem （模擬）

zoj 3818 Pretty Poem （模擬）

Poetry is a form of literature that uses aesthetic and rhythmic qualities of language. There are many famous poets in the contemporary era. It is said that a few ACM-ICPC contestants can even write poetic code. Some poems has a strict rhyme scheme like "ABABA" or "ABABCAB". For example, "niconiconi" is composed of a rhyme scheme "ABABA" with A = "ni" and B = "co".

More technically, we call a poem pretty if it can be decomposed into one of the following rhyme scheme: "ABABA" or "ABABCAB". The symbol A, B and C are different continuous non-empty substrings of the poem. By the way, punctuation characters should be ignored when considering the rhyme scheme.

You are given a line of poem, please determine whether it is pretty or not.

Input

There are multiple test cases. The first line of input contains an integer T indicating the number of test cases. For each test case:

There is a line of poem S (1 <= length(S) <= 50). S will only contains alphabet characters or punctuation characters.

Output

For each test case, output "Yes" if the poem is pretty, or "No" if not.

Sample Input

3
niconiconi~
pettan,pettan,tsurupettan
wafuwafu

Sample Output

Yes
Yes
No

給你一個竄，取出裡面的字母，問是否滿足 ABABA 或 ABABCAB，形似

思路：

分別兩個函數判斷，判斷兩種形式，ABABA 的枚舉AB的長度，可以變成XYZ 形式，判斷X==Y，然後從X中取出Z長度的字符串，判斷是否和Z相等，還有Z與X剩余的竄必須不相等（A！=B）；

對於ABABCAB 基本相似；

上代碼了：

#include
#include
#include
#include
using namespace std;
#define N 55

char a[N],b[N];
int k;
int vis[N];

int judge()
{
    int i,j;

    char x[N],y[N],z[N];
    int xx,yy,zz;

    for(i=2;i*2=i) continue;

          char A[N],B[N];
          int AA,BB;

          for(j=0;j='a'&&a[i]<='z'||a[i]>='A'&&a[i]<='Z')
        b[k++]=a[i];
       b[k]='\0';

       if(judge())
       {
           printf("Yes\n");
           continue;
       }

       if(judgee())
       {
           printf("Yes\n");
           continue;
       }

       printf("No\n");
   }
   return 0;
}

/*

2
ababa


ababcab

*/