#include <bits/stdc++.h> #define fi first #define se second #define pb push_back using namespace std; typedef long long ll; typedef pair<int, int> pii; const int maxn = 200005; int tab[5][3]; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; for (int i = 0; i < n; i++) { string s; cin >> s; tab[s[0] - '1'][s[1] - 'A']++; } bool ok = true; for (int i = 0; i < 5; i++) { for (int j = 0; j < 3; j++) { if (tab[i][j] < 1 || (i == 4 && tab[i][j] < 2)) ok = false; } } if (ok) cout << "TAK\n"; else cout << "NIE\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 41 | #include <bits/stdc++.h> #define fi first #define se second #define pb push_back using namespace std; typedef long long ll; typedef pair<int, int> pii; const int maxn = 200005; int tab[5][3]; int main() { ios_base::sync_with_stdio(0); int n; cin >> n; for (int i = 0; i < n; i++) { string s; cin >> s; tab[s[0] - '1'][s[1] - 'A']++; } bool ok = true; for (int i = 0; i < 5; i++) { for (int j = 0; j < 3; j++) { if (tab[i][j] < 1 || (i == 4 && tab[i][j] < 2)) ok = false; } } if (ok) cout << "TAK\n"; else cout << "NIE\n"; return 0; } |