#include <bits/stdc++.h> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<set<int>> diff(3); for(int i = 0; i < n; ++i) { string s; cin >> s; int x = (int) s[0] - (int) '0', id = (int) s[1] - (int) 'A'; if(x == 5) { if(diff[id].find(x) != diff[id].end()) { diff[id].insert(x + 1); } else { diff[id].insert(x); } } else { diff[id].insert(x); } } bool nope = false; for(int i = 0; i < 3; ++i) { if((int) diff[i].size() != 6) { nope = true; } } cout << (nope == false ? "TAK" : "NIE"); 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; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; vector<set<int>> diff(3); for(int i = 0; i < n; ++i) { string s; cin >> s; int x = (int) s[0] - (int) '0', id = (int) s[1] - (int) 'A'; if(x == 5) { if(diff[id].find(x) != diff[id].end()) { diff[id].insert(x + 1); } else { diff[id].insert(x); } } else { diff[id].insert(x); } } bool nope = false; for(int i = 0; i < 3; ++i) { if((int) diff[i].size() != 6) { nope = true; } } cout << (nope == false ? "TAK" : "NIE"); return 0; } |