Diane solution codeforces
You are given an integer odd number of times. If there are multiple such strings, output any. It can be shown that such string always exists under the given constraints.. Find any string of length consisting only of English lowercase letters such that each non-empty substring of occurs in an
A stringis a substring of a string if can be obtained from by deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end.
The first line contains a single integer( ) — the number of test cases.
The first line of each test case contains a single integer( ).
It is guaranteed that the sum ofover all test cases doesn’t exceed .
For each test case, print a single line containing the string. If there are multiple such strings, output any. It can be shown that such string always exists under the given constraints.
4 3 5 9 19
abc diane bbcaabbba youarethecutestuwuu
In the first test case, each substring of “abc” occurs exactly once.
In the third test case, each substring of “bbcaabbba” occurs an odd number of times. In particular, “b” occurs times, “a” and “bb” occur times each, and each of the remaining substrings occurs exactly once.