#include <bits/stdc++.h> using namespace std; int main() { int n, k; string in_k; cin >> n >> in_k; int size_k = in_k.size(); k = 0; for (int i = 0; i < size_k; i++) { if (in_k[i] == '1') { k++; } } if (k < n * 3 || k > n * 6) { cout << "NIE" << endl; return 0; } int base = k / n; int rest = k % n; map <int, char> reps = {{3, 'a'}, {4, 'c'}, {5, 'g'}, {6, 'o'}}; for (int i = 0; i < n - rest; i++) { cout << reps[base]; } for (int i = 0; i < rest; i++) { cout << reps[base + 1]; } cout << endl; }
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 | #include <bits/stdc++.h> using namespace std; int main() { int n, k; string in_k; cin >> n >> in_k; int size_k = in_k.size(); k = 0; for (int i = 0; i < size_k; i++) { if (in_k[i] == '1') { k++; } } if (k < n * 3 || k > n * 6) { cout << "NIE" << endl; return 0; } int base = k / n; int rest = k % n; map <int, char> reps = {{3, 'a'}, {4, 'c'}, {5, 'g'}, {6, 'o'}}; for (int i = 0; i < n - rest; i++) { cout << reps[base]; } for (int i = 0; i < rest; i++) { cout << reps[base + 1]; } cout << endl; } |