#P1931A. Recovering a Small String
Recovering a Small String
No submission language available for this problem.
Description
Nikita had a word consisting of exactly lowercase Latin letters. The letters in the Latin alphabet are numbered from to , where the letter "a" has the index , and the letter "z" has the index .
He encoded this word as the sum of the positions of all the characters in the alphabet. For example, the word "cat" he would encode as the integer , because the letter "c" has the index in the alphabet, the letter "a" has the index , and the letter "t" has the index .
However, this encoding turned out to be ambiguous! For example, when encoding the word "ava", the integer is also obtained.
Determine the lexicographically smallest word of letters that could have been encoded.
A string is lexicographically smaller than a string if and only if one of the following holds:
- is a prefix of , but ;
- in the first position where and differ, the string has a letter that appears earlier in the alphabet than the corresponding letter in .
The first line of the input contains a single integer () — the number of test cases in the test.
This is followed by the descriptions of the test cases.
The first and only line of each test case contains an integer () — the encoded word.
For each test case, output the lexicographically smallest three-letter word that could have been encoded on a separate line.
Input
The first line of the input contains a single integer () — the number of test cases in the test.
This is followed by the descriptions of the test cases.
The first and only line of each test case contains an integer () — the encoded word.
Output
For each test case, output the lexicographically smallest three-letter word that could have been encoded on a separate line.