Codeforces Round #411 B.3-palindrome (构造)
来源:互联网 发布:临沂数据恢复 编辑:程序博客网 时间:2024/05/22 17:48
CodeForces - 805B 3-palindrome
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.
Example
Input
2
Output
aa
Input
3
Output
bba
题意:只用‘a’’b’ ‘c’构造一个长n的字符串,并且不存在长度为3
的子串为回文串,‘c’要尽量的少。
分析:因为要有长度为3的回文串必定需要b[0]==b[2]
所以只需要每一段都保证是“aab”或者”bba”就可以了
AC代码
#include<stdio.h>char a[5]="aabb";int main(){ int n; scanf("%d",&n); int count=0; for(int i=0;i<n;i++) { printf("%c",a[count%4]); count++; } printf("\n");}
- Codeforces Round #411 B.3-palindrome (构造)
- Codeforces Round #411 (Div. 2) B. 3-palindrome
- Codeforces Round #411 (Div. 2) B. 3-palindrome(思维题)
- Codeforces - Educational Codeforces Round 14B - s-palindrome(模拟)
- Educational Codeforces Round 2C. Make Palindrome(贪心构造)
- Codeforces Round #272 (Div. 1)B(构造)
- Codeforces Round #277 (Div. 2)(B)构造
- Educational Codeforces Round 10(B)排序,构造
- Codeforces Round #347 (Div. 2) B Rebus (贪心构造)
- Codeforces Round #411(A. Fake NP; B. 3-palindrome; C. Find Amir; D.Minimum number of steps)
- CodeForces 805B 3-palindrome
- Codeforces 805B 3-palindrome
- Codeforces Round #209 (Div. 2) B && Codeforces 359 B(构造)
- Codeforces Round #351 (VK Cup 2016 Round 3, Div. 2 Edition) A B C D 构造
- Codeforces Beta Round #3 B
- Educational Codeforces Round 3 B
- Codeforces 691B. s-palindrome(模拟)
- Codeforces-691B-s-palindrome(模拟)
- Linux之apache+tomcat实现
- Spring配置Bean的详细信息
- 码农看车之纸上谈兵
- JSP中的动态包含和静态包含的区别
- 计算机协会Android培训_001
- Codeforces Round #411 B.3-palindrome (构造)
- php中在变量和函数前加static关键字之后的区别
- 使用python sklearn下的k_means聚类分析算法时遇到的问题
- 1035. 插入与归并
- 我去济南 为见你
- 基于junit4+Robotium+spoon+as二次开发自动化框架,支持失败重试和失败截图
- linux初学者——数据类型
- mongodb索引长度限制
- springIoC--Bean装配的3种方式比较