Pretty Poem
1555 ワード
The 2014 ACM-ICPC Asia Mudanjiang Regional First Round - J
Pretty Poem
Time Limit: 2 Seconds
Memory Limit: 65536 KB
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
Sample Output
/*自分の考えに沿って书いて、时间が足りなくて、提出することができなくて、先に问题を贴り出して、最后に正しいかどうか分かりません*/
Pretty Poem
Time Limit: 2 Seconds
Memory Limit: 65536 KB
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
/*自分の考えに沿って书いて、时间が足りなくて、提出することができなくて、先に问题を贴り出して、最后に正しいかどうか分かりません*/