#include <iostream> using namespace std; int counter [100]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, idx, letter_idx, final_idx; string s; cin>>n; for(int i=1; i<=n; i++) { cin>>s; idx = int(s[0]) - 48; letter_idx = int(s[1]) - 65; final_idx = (idx-1)*3 + letter_idx; counter[final_idx]++; } for(int i=0; i<=11; i++) if (counter[i] == 0) { cout<<"NIE"<<endl; return 0; } for(int i=12; i<=14; i++) if (counter[i] < 2) { cout<<"NIE"<<endl; return 0; } cout<<"TAK"<<endl; 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 44 45 | #include <iostream> using namespace std; int counter [100]; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n, idx, letter_idx, final_idx; string s; cin>>n; for(int i=1; i<=n; i++) { cin>>s; idx = int(s[0]) - 48; letter_idx = int(s[1]) - 65; final_idx = (idx-1)*3 + letter_idx; counter[final_idx]++; } for(int i=0; i<=11; i++) if (counter[i] == 0) { cout<<"NIE"<<endl; return 0; } for(int i=12; i<=14; i++) if (counter[i] < 2) { cout<<"NIE"<<endl; return 0; } cout<<"TAK"<<endl; return 0; } |