D - Diane

最新推荐文章于 2021-09-13 14:24:04 发布

Prime me

最新推荐文章于 2021-09-13 14:24:04 发布

阅读量142

点赞数

分类专栏：思维

本文链接：https://blog.csdn.net/weixin_46574282/article/details/119256864

版权

给定一个整数n，找到一个长度为n的仅包含小写字母的字符串s，使得s的每个非空子串在s中出现奇数次。如果存在多个这样的字符串，输出任意一个。已知在给定条件下这样的字符串总是存在的。

摘要由CSDN通过智能技术生成

You are given an integer n. Find any string s of length n consisting only of English lowercase letters such that each non-empty substring of s occurs in s an 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.
A string a is a substring of a string b if a can be obtained from b by deletion of several (possibly, zero or all) characters from the beginning and several (possibly, zero or all) characters from the end.
Input
The first line contains a single integer t (1≤t≤500) — the number of test cases.
The first line of each test case contains a single integer n (1≤n≤105).
It is guaranteed that the sum of n over all test cases doesn’t exceed 3⋅105.
Output
For each test case, print a single line containing the string s. If there are multiple such strings, output any. It can be shown that such string always exists under the given constraints.
Example
Input
4
3
5
9
19
Output
abc
diane
bbcaabbba
youarethecutestuwuu