#include <bits/stdc++.h> using namespace std; #define st first #define nd second #define iamspeed ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0) int n, jed; string s, res; char t[5]; int main() { iamspeed; cin >> n >> s; t[0] = 'a' ; t[1] = 'c' ; t[2] = 'g' ; t[3] = 'w'; for(int i = 0 ; i < s.size() ; i++) { if(s[i] == '1') jed++; } jed -= n * 3; if(jed < 0) { cout << "NIE" << endl; return 0; } for(int i = 1 ; i <= n ; i++) { res += t[min(3, jed)]; jed -= min(3, jed); } if(jed == 0) cout << res << endl; else cout << "NIE" << 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 30 31 32 33 34 | #include <bits/stdc++.h> using namespace std; #define st first #define nd second #define iamspeed ios_base :: sync_with_stdio(0); cin.tie(0); cout.tie(0) int n, jed; string s, res; char t[5]; int main() { iamspeed; cin >> n >> s; t[0] = 'a' ; t[1] = 'c' ; t[2] = 'g' ; t[3] = 'w'; for(int i = 0 ; i < s.size() ; i++) { if(s[i] == '1') jed++; } jed -= n * 3; if(jed < 0) { cout << "NIE" << endl; return 0; } for(int i = 1 ; i <= n ; i++) { res += t[min(3, jed)]; jed -= min(3, jed); } if(jed == 0) cout << res << endl; else cout << "NIE" << endl; } |