小白题解 Codeforces 805B 3-palindrome

题目链接：点击打开链接

B. 3-palindrome

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

In the beginning of the new year Keivan decided to reverse his name. He doesn't like palindromes, so he changed Naviek to Navick.

He is too selfish, so for a given n he wants to obtain a string of n characters, each of which is either 'a', 'b' or 'c', with no palindromes of length 3 appearing in the string as a substring. For example, the strings "abc" and "abca" suit him, while the string "aba" doesn't. He also want the number of letters 'c' in his string to be as little as possible.

Input

The first line contains single integer n (1 ≤ n ≤ 2·10⁵) — the length of the string.

Output

Print the string that satisfies all the constraints.

If there are multiple answers, print any of them.

Examples

Input

2

Output

aa

Input

3

Output

bba

Note

A palindrome is a sequence of characters which reads the same backward and forward.

题目大意：给定一个数n，要求输出不含长度为3的回文子列的字符串，只能使用a,b,c，且要尽可能少使用c。

分析：对于一个长度为3的子列，它是否是回文子列只需看两边的字母是否相同即可，所以只需保证字符串中间隔为1的元素不相同即可。由此可以构造出我们的字符串：第一种：以aabb为循环节，如aabbaabbaabbaab...第二种：以abba为循环节，如abbaabbaabbaab...（当然这两种字符串中可以把a和b相应互换） 所以只需提前把char arr[]数组打好，输入n后依次输出arr[0]-arr[n-1]即可。

下面是AC代码。

//以第一种字符串构造方法编写程序

#include<cstdio>
const int maxn=(int)2e5+8;
char arr[maxn];
int main()
{
    for(int i=0;i<maxn;i+=4)
    {
        arr[i]=arr[i+1]='a';
        arr[i+2]=arr[i+3]='b';
    }
    int n;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
        printf("%c",arr[i]);
    printf("\n");
    return 0;
}

很简单是不是，但是，一开始我是这么写代码的！！！

//以下为代码为脑子进水时写的，看官请绕行

#include<cstdio>
char arr[(int)2e5+5];
int main()
{
    int n;
    scanf("%d",&n);
    if(n%2==0)
    {
        for(int i=0;i<n-1;i+=4)
            arr[i]=arr[i+1]='a';
        for(int i=2;i<n-1;i+=4)
            arr[i]=arr[i+1]='b';
    }
    else if(n%4==1)
    {
        for(int i=0;i<n-1;i+=4)
        {
            arr[i]=arr[i+1]='a';
            arr[i+2]=arr[i+3]='b';
        }
        arr[n-1]='a';
    }
    else
    {
        for(int i=0;i<n-3;i+=4)
        {
            arr[i]=arr[i+1]='a';
            arr[i+2]=arr[i+3]='b';
        }
        arr[n-3]=arr[n-2]='a';
        arr[n-1]='b';
    }
    for(int i=0;i<n;i++)
        printf("%c",arr[i]);
    printf("\n");
    return 0;
}