【CF1461A】 String Generation

最新推荐文章于 2024-06-20 01:44:41 发布

不可知论大祭司

最新推荐文章于 2024-06-20 01:44:41 发布

阅读量148

点赞数

文章标签： C++ 字符串处理算法字符数组排列

本文链接：https://blog.csdn.net/weixin_50070650/article/details/112959685

版权

code

#include <cstdio>
#include <algorithm>
#include <cstring>
#include <cctype>
#include <vector>
#include <iostream>

using namespace std;
inline int read(){
    int x = 0, op = 1; char ch = getchar();
    while (!isdigit(ch)){
        if (ch == '-') op = -1; ch = getchar();}
    while (isdigit(ch)){
        x = (x << 1) + (x << 3) + (ch ^ 48);
        ch = getchar();
    }
    return x * op;
}
inline void write(int x){
    if (x < 0) putchar('-'), x = - x;
    if (x > 9) write(x / 10);
    putchar('0' + x % 10);
}

char a[1005] = {'a', 'b', 'c', 'a'};
char s[] = {'a', 'b', 'c'};
void solve(){
    int n = read(), k = read();
    if (n <= 4){
        for (int i = 0; i < n; ++i) {
            putchar(a[i]);
        }
        putchar('\n');
        return;
    }
    for (int i = 0; i < 4; ++i) {
        putchar(a[i]);
    }
    for (int i = 4; i < n; ++i) {
        for (int j = 0; j < 3; ++j) {
            if (s[j] != a[i - 1] && s[j] != a[i - 2]){
                a[i] = s[j];
                break;
            }
        }
        putchar(a[i]);
    }
    putchar('\n');
}

signed main(){
    int cases = read();
    while (cases--){
        solve();
    }
    return 0;
}