Diane

题意翻译

### 题意简述 要求您构造一个长度为 $n$ 的由小写字母构成的字符串，使得字符串内每个字串出现奇数次。 ### 输入格式 第一行输入一个整数 $t$ 表示数据组数。 对于每组数据输入一个整数 $n$ 表示字符串长度。 ### 输出格式 对于每组数据，输出一行长度为 $n$ 的满足题意的字符串。若有多组解任意输出一组即可。 ### 说明/提示 在第一组数据里， $\texttt{abc}$ 的每个子串都恰好只出现一次。 在第三组数据里，$\texttt{bbcaabbba}$ 的每个子串出现奇数次，其中 $\texttt{b}$ 出现 $5$ 次，$\texttt{a}$ 和 $\texttt{bb}$ 各出现 $3$ 次，其它子串各出现 $1$ 次。 ### 数据范围及约定 对于 $100\%$ 的数据，$1\le t\le 500$，$1\le n \le 10^5$，$1\le \sum n\le 3\times 10^5$。

题目描述

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.

输入输出格式

输入格式

The first line contains a single integer $ t $ ( $ 1 \le t \le 500 $ ) — the number of test cases. The first line of each test case contains a single integer $ n $ ( $ 1 \le n \le 10^5 $ ). It is guaranteed that the sum of $ n $ over all test cases doesn't exceed $ 3 \cdot 10^5 $ .

输出格式

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.

输入输出样例

输入样例 #1

4
3
5
9
19

输出样例 #1

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 $ 5 $ times, "a" and "bb" occur $ 3 $ times each, and each of the remaining substrings occurs exactly once.