#include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for (int i = (a); i <= (b); ++i) #define REPD(i,a,b) for (int i = (a); i >= (b); --i) #define FORI(i,n) REP(i,1,n) #define FOR(i,n) REP(i,0,int(n)-1) #define mp make_pair #define pb push_back #define pii pair<int,int> #define vi vector<int> #define ll long long #define SZ(x) int((x).size()) #define DBG(v) cerr << #v << " = " << (v) << endl; #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define fi first #define se second const int N = 100100; int n, bits; char s[N*8]; int main() { scanf("%d %s", &n, s); FOR(i,n*8) bits += s[i]=='1'; bits -= n*3; if (bits < 0 || bits > n*3) { printf("NIE\n"); return 0; } int o = bits / 3; int a = n-1-o; int r = bits%3; char m = r == 0 ? 'a' : r == 1 ? 'c' : 'g'; FOR(i,a) putchar('a'); if (o<n) putchar(m); FOR(i,o) putchar('o'); putchar('\n'); 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 | #include <bits/stdc++.h> using namespace std; #define REP(i,a,b) for (int i = (a); i <= (b); ++i) #define REPD(i,a,b) for (int i = (a); i >= (b); --i) #define FORI(i,n) REP(i,1,n) #define FOR(i,n) REP(i,0,int(n)-1) #define mp make_pair #define pb push_back #define pii pair<int,int> #define vi vector<int> #define ll long long #define SZ(x) int((x).size()) #define DBG(v) cerr << #v << " = " << (v) << endl; #define FOREACH(i,t) for (typeof(t.begin()) i=t.begin(); i!=t.end(); i++) #define fi first #define se second const int N = 100100; int n, bits; char s[N*8]; int main() { scanf("%d %s", &n, s); FOR(i,n*8) bits += s[i]=='1'; bits -= n*3; if (bits < 0 || bits > n*3) { printf("NIE\n"); return 0; } int o = bits / 3; int a = n-1-o; int r = bits%3; char m = r == 0 ? 'a' : r == 1 ? 'c' : 'g'; FOR(i,a) putchar('a'); if (o<n) putchar(m); FOR(i,o) putchar('o'); putchar('\n'); return 0; } |