|시간 제한||메모리 제한||제출||정답||맞은 사람||정답 비율|
|1 초||1024 MB||0||0||0||0.000%|
Consider the following scheme: for permuting a string of letters: first we create all different rotations of the string, then we sort them in lexicographical order, and finally we take the last letter of each rotation and concatenate them to form a new string.
For the string "
LEIDEN.", for example, the seven rotation in lexicographical order are(where the period '
.' comes before any letter):
.LEIDEN DEN.LEI EIDEN.L EN.LEID IDEN.LE LEIDEN. N.LEIDE
so this results in the string "
At first glance this permutation doesn't seem useful at all but it has an interesting property. If there are a lot of equal substrings in the original string (which might happen in case of a real language), the a lot of equal consecutive letters occur after the permutation. Therefor the resulting string is very suitable for block compression. where blocks of equals letters are replaced by that letter followed by a number which specifies how often that letter occurs. If the letter only occurs once, no number is added. For example the string "
AAABCC" would be replaced by "
Your task is now to decompress this final string to the original string. Note however, that permuting the string it not entirely reversible: you can only obtain the original string up to a rotation (i.e.: each rotation would lead to same permuted string). To overcome this, the original string will consist of uppercase letters followed by a single period('
.'), this will define the initial rotation.
The first line of the input contains a single number: the number of test cases to follow. Each test case has the following format:
For every test case in the input, the output should contain a single line with the decompressed string.
3 NILDE.E N13.E13 LRSGORTNOMOMAIOSROC2.GAPTE2NS
LEIDEN. ENENENENENENENENENENENENEN. PROGRAMMINGCONTESTSARESOCOOL.