LEONARDO  Leonardo Notebook
— I just bought Leonardo's secret notebook!
Rare object collector Stan Ucker was really agitated but
his friend, special investigator Sarah Keptic was unimpressed.
— How do you know it is genuine?
— Oh, it must be, at that price. And it is written in the
da Vinci code.
Sarah browsed a few of the pages. It was obvious
to her that the code was a substitution cipher, where each
letter of the alphabet had been substituted by another letter.
— Leonardo would have written the plaintext and left it to his
assistant to encrypt, she said. And he must have supplied the
substitution alphabet to be used. If we are lucky, we can find
it on the back cover!
She turned up the last page and, lo and behold, there was a single
line of all 26 letters of the alphabet:
QWERTYUIOPASDFGHJKLZXCVBNM
— This may be Leonardo's instructions meaning that each A in the
plaintext was to be replaced by Q, each B with W, etcetera. Let us see...
To their disappointment, they soon saw that this could not be the
substitution that was used in the book. Suddenly, Stan brightened.
— Maybe Leonardo really wrote the substitution alphabet on the
last page, and by mistake his assistant coded that line as he had
coded the rest of the book. So the line we have here is the result
of applying some permutation TWICE to the ordinary alphabet!
Sarah took out her laptop computer and coded fiercely for a few
minutes. Then she turned to Stan with a sympathetic expression.
— No, that couldn't be it. I am afraid that you have been duped
again, my friend. In all probability, the book is a fake.
Write a program that takes a permutation of the English alphabet as
input and decides if it may be the result of performing some
permutation twice.
Input
The input begins with a positive number on a line of its own telling the number of test cases (at most 500). Then for each test case there is one line containing a permutation of the 26 capital letters of the English alphabet.
Output
For each test case, output one line containing Yes if the given permutation can result from applying some permutation twice on the original alphabet string ABC...XYZ, otherwise output No.
Example
Input: 2 QWERTYUIOPASDFGHJKLZXCVBNM ABCDEFGHIJKLMNOPQRSTUVWXYZ Output: No Yes
hide comments
nadstratosfer:
20191129 02:27:51
Enjoyed a lot =) 

bahaaelden:
20170914 00:47:55
any one can explain this problem ? 
Added by:  overwise 
Date:  20071002 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: ERL JSRHINO NODEJS PERL6 VB.NET 
Resource:  ACM ICPC NWERC 2006 