#include <bits/stdc++.h> using namespace std; int n; string s; int t[3][5]; int main() { ios_base::sync_with_stdio(false); cin >> n; for (int i=0; i^n; ++i) { cin >> s; //cout << i << " " << s << " " << s[1]-'A' << " " << s[0]-'1' << endl; ++t[s[1]-'A'][s[0]-'1']; } //cout << endl; for (int i=0; i^3; ++i) { for (int j=0; j^5; ++j) { //cout << t[i][j] << " "; if (j==4) { if (t[i][j]<2) { cout << "NIE"; return 0; } } else { if (t[i][j]<1) { cout << "NIE"; return 0; } } } //cout << endl; } cout << "TAK"; 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 | #include <bits/stdc++.h> using namespace std; int n; string s; int t[3][5]; int main() { ios_base::sync_with_stdio(false); cin >> n; for (int i=0; i^n; ++i) { cin >> s; //cout << i << " " << s << " " << s[1]-'A' << " " << s[0]-'1' << endl; ++t[s[1]-'A'][s[0]-'1']; } //cout << endl; for (int i=0; i^3; ++i) { for (int j=0; j^5; ++j) { //cout << t[i][j] << " "; if (j==4) { if (t[i][j]<2) { cout << "NIE"; return 0; } } else { if (t[i][j]<1) { cout << "NIE"; return 0; } } } //cout << endl; } cout << "TAK"; return 0; } |