#include <bits/stdc++.h> using namespace std; int n; int ones; char lett[4] = {'a', 'c', 'g', 'o'}; int quan[4]; int main() { scanf("%d", &n); char c; int q = n*8; for (int i = 0; i < q; i++) { cin >> c; //printf("i:%d c:%c\n", i, c); if (c == '1') ones++; } ones -= 3 * n; if (ones < 0 || ones > 3*n) { printf("NIE\n"); return 0; } quan[3] = ones / 3; ones %= 3; if (ones == 2) quan[2]++; else if (ones == 1) quan[1]++; quan[0] = n - quan[1] - quan[2] - quan[3]; for (int i = 0; i < quan[0]; i++) printf("a"); for (int i = 0; i < quan[1]; i++) printf("c"); for (int i = 0; i < quan[2]; i++) printf("g"); for (int i = 0; i < quan[3]; i++) printf("o"); return 0; }
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 | #include <bits/stdc++.h> using namespace std; int n; int ones; char lett[4] = {'a', 'c', 'g', 'o'}; int quan[4]; int main() { scanf("%d", &n); char c; int q = n*8; for (int i = 0; i < q; i++) { cin >> c; //printf("i:%d c:%c\n", i, c); if (c == '1') ones++; } ones -= 3 * n; if (ones < 0 || ones > 3*n) { printf("NIE\n"); return 0; } quan[3] = ones / 3; ones %= 3; if (ones == 2) quan[2]++; else if (ones == 1) quan[1]++; quan[0] = n - quan[1] - quan[2] - quan[3]; for (int i = 0; i < quan[0]; i++) printf("a"); for (int i = 0; i < quan[1]; i++) printf("c"); for (int i = 0; i < quan[2]; i++) printf("g"); for (int i = 0; i < quan[3]; i++) printf("o"); return 0; } |