Codeforces Round #411 B. 3-palindrome

B. 3-palindrome

time limit per test

1 second

memory limit per test

256 megabytes

 

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·105) — the length of the string.

Output

Print the string that satisfies all the constraints.

If there are multiple answers, print any of them.

 

input

2

output

aa

input

3

output

bba

Note：

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

---------------------------------------华丽的分割线--------------------------------------------

题目大意： 输入一个整数n，代表字符串的长度

　　　　　输出一个字符串（该字符串自包含a、b、c三种字符，且不会出现长度为3的回文字符串，保证c字符的个数出现的尽量少）

解题思路：

　　　　　该题最重要的要保证字符串中不会出现长度为3的回文字符串，我们可以先设计一个“子串”，保证以这个子串为基础的字符串不会出现长度为3的回文字符串即可

　　　　　例如 “aabb” 当然也可以是别的哈（但是长度要尽量的短）

　　　　　题目要求c字符的个数要尽可能的少，我们不输出c字符就好了。

AC代码：

 #include <stdio.h>
 #include <string.h>
 #include <math.h>
 #include <stdlib.h>
 #include <algorithm>
 using namespace std;
 
 int main ()
 {
     int n,i;
     while (~scanf("%d",&n))
     {
         if (n == )
             printf("a\n");
         else if (n == )
             printf("ab\n");
         else if(n == )
             printf("aab\n");
         else{
             for (i = ; i < n/; i ++)   // 处理最后剩余长度不足4的情况
                 printf("aabb");
             for (i = ; i < n%; i ++){
                 if (i >= )
                     printf("b");
                 else
                     printf("a");
             }
             printf("\n");
         }
     }
     return ;
 }