#834693 (C++17) No.2198 Concon Substrings (COuNt-CONstruct Version)

• 問題: No.2198 Concon Substrings (COuNt-CONstruct Version)
• ユーザー: nono00
• 提出日時: 2023-01-21 00:18:27
• 言語: C++17 (gcc 13.3.0 + boost 1.87.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 2,144 bytes
• コンパイル時間: 1,867 ms
• コンパイル使用メモリ: 195,044 KB
• 最終ジャッジ日時: 2025-02-10 06:02:49
• ジャッジサーバーID （参考情報）: judge4 / judge3

ファイルパターン	結果
sample	AC * 4
other	AC * 104

ソースコード

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
#include <bits/stdc++.h>
using namespace std;
void solve() {
    long long m;
    cin >> m;
    int x, y, z;
    z = m % 10000;
    m /= 10000;
    y = m % 10000;
    m /= 10000;
    x = m;
    string s;
    if (z == 0) {
        for (int i = 0; i < 10000; i++) {
            s.push_back('c');
        }
        s.push_back('o');
    } else if (z == 1) {
        s.push_back('c');
        s.push_back('o');
        s.push_back('n');
        for (int i = 0; i < 9998; i++) {
            s.push_back('c');
        }
        s.push_back('o');
        s.push_back('c');
    } else if (z == 3) {
        s.push_back('c');
        s.push_back('o');
        s.push_back('o');
        s.push_back('o');
        s.push_back('n');
        for (int i = 0; i < 9996; i++) {
            s.push_back('c');
        }
        s.push_back('o');
        for (int i = 0; i < 3; i++) {
            s.push_back('c');
        }
    } else {
        bool flag = z & 1;
        z /= 2;
        if (flag) {
            s.push_back('c');
            s.push_back('o');
            s.push_back('n');
            z -= 2;
        }
        for (int i = 0; i < z; i++) {
            s.push_back('c');
        }
        s.push_back('o');
        s.push_back('n');
        s.push_back('n');
        if (flag) {
            z += 2;
            s.push_back('c');
        }
        // (z, z, 2 * z + flag)
        for (int i = 0; i < (10000 - 2 * z); i++) {
            s.push_back('c');
        }
        s.push_back('o');
        for (int i = 0; i < z; i++) {
            s.push_back('c');
        }
    }
    // (10000, 10000, xxxx)
    if (y == 0) {
        for (int i = 0; i < 9999; i++) {
            s.push_back('o');
        }
    } else {
        for (int i = 0; i < (y - 1); i++) {
            s.push_back('o');
        }
        s.push_back('n');
        for (int i = 0; i < (10000 - y); i++) {
            s.push_back('o');
        }
    }
    // (10000, 100000000, xxxxxxxx)
    for (int i = 0; i < x; i++) {
        s.push_back('n');
    }
    cout << s << '\n';
}
int main() {
    int q = 1;
    // cin >> q;
    while (q--) {
        solve();
    }
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX