CodeForces 805B 构造

题意:给你一个字符串长度,然后要求不能出现长度为3的回文子串,且c的次数尽可能少

思路:用ab两个字母构造字符串就好了   形如aabbaabbaabb就好

代码:

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int maxn=1.5e7+10;
int a[maxn];
int main()
{
  int n;
  while(~scanf("%d",&n))
  {
        //scanf("%d",&n);
        //for(int i=1;i<=n;i++)
        //scanf("%d",&a[i]);
        //int cnt=0;
        for(int i=0,j=1;i<n;i++,j++)
        {
          if(j>=1&&j<=2)
                printf("%c",'a');
          if(j>2&&j<=4)
          {
                printf("%c",'b');
                if(j==4)
                  j=0;
          }
        }
        printf("\n");
  }
  return 0;
}

题目:

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.

Examples

Input

2

Output

aa
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值