#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; typedef pair<long long, long long> pll; int n; int cnt[109]; int change(string x) { int c = x[0] - '1'; int b = x[1] - 'A'; return (c * 3 + b); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); string s; cin >> n; for (int i = 1; i <= n; i++) { cin >> s; cnt[change(s)]++; } for (int i = 0; i < 12; i++) { if (cnt[i] < 1) { cout << "NIE\n"; return 0; } } for (int i = 12; i < 15; i++) { if (cnt[i] < 2) { cout << "NIE\n"; return 0; } } cout << "TAK\n"; }
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 46 47 48 49 50 51 52 53 54 55 | #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; typedef pair<long long, long long> pll; int n; int cnt[109]; int change(string x) { int c = x[0] - '1'; int b = x[1] - 'A'; return (c * 3 + b); } int main() { ios_base::sync_with_stdio(0); cin.tie(NULL); string s; cin >> n; for (int i = 1; i <= n; i++) { cin >> s; cnt[change(s)]++; } for (int i = 0; i < 12; i++) { if (cnt[i] < 1) { cout << "NIE\n"; return 0; } } for (int i = 12; i < 15; i++) { if (cnt[i] < 2) { cout << "NIE\n"; return 0; } } cout << "TAK\n"; } |