D. Diane- 构造 -打表

最新推荐文章于 2024-10-18 23:40:34 发布

qinsanma and Code

最新推荐文章于 2024-10-18 23:40:34 发布

阅读量109

点赞数

分类专栏： # CF 1800 文章标签： codeforces 算法打表

本文链接：https://blog.csdn.net/jisuanji2606414/article/details/128695092

版权

CF 1800 专栏收录该内容

45 篇文章 0 订阅

订阅专栏

文章描述了一个在Codeforces平台上的编程问题，要求找到一个由小写字母组成的字符串，其所有非空子串在原字符串中出现的次数为奇数。给出了样例输入和输出，并提供了一个简单的C++解决方案，该方案特别处理了字符串长度为1的情况，并依据字符串长度的奇偶性构建满足条件的字符串。

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

Problem - D - Codeforces

D. Diane

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an integer nn. Find any string ss of length nn consisting only of English lowercase letters such that each non-empty substring of ss occurs in ss 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 aa is a substring of a string bb if aa can be obtained from bb 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 tt (1≤t≤5001≤t≤500) — the number of test cases.

The first line of each test case contains a single integer nn (1≤n≤1051≤n≤105).

It is guaranteed that the sum of nn over all test cases doesn't exceed 3⋅1053⋅105.

Output

For each test case, print a single line containing the string ss. If there are multiple such strings, output any. It can be shown that such string always exists under the given constraints.

Example

input

Copy

output

Copy

abc
diane
bbcaabbba
youarethecutestuwuu

Note

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

---------------------------------------------------------------------------------------------------------------------------------

首先猜测只需要两种字母，打表发现偶数是满足的，猜测奇数需要3种字母，打表发现也是满足的。直接找规律即可。特判1，否则白WA一次

# include<bits/stdc++.h>

using namespace std;
typedef long long int ll;


int main ()
{



int t;
cin>>t;

while(t--)
{
    int n;
    cin>>n;

    if(n==1)
    {
        cout<<'a'<<endl;
        continue;
    }

    if(n%2==0)
    {
        for(int i=1;i<=n/2;i++)
        {
            cout<<'a';
        }
        cout<<'b';
        for(int i=n/2+2;i<=n;i++)
        {
            cout<<'a';
        }

        cout<<endl;
    }
    else
    {
        for(int i=1;i<=n/2;i++)
        {
            cout<<'a';
        }
        cout<<'b';
        for(int i=n/2+2;i<n;i++)
        {
            cout<<'a';
        }

        cout<<'c';

        cout<<endl;

    }
}
    return 0;
}