#include<bits/stdc++.h> using namespace std; using pii = pair<int, int>; using pll = pair<long long, long long>; using pil = pair<int, long long>; using pli = pair<long long, int>; using ll = long long; #define X first #define Y second #define pb push_back #define mp make_pair int n, k, t[100]; string a; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; while(n--){ cin >> a; k=3*(a[0]-'1')+a[1]-'A'; t[k]++; } for(int i = 0; i<12; i++){ if(t[i]<1){ cout << "NIE"; return 0; } } for(int i = 12; i<15; i++){ if(t[i]<2){ cout << "NIE"; return 0; } } 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; using pii = pair<int, int>; using pll = pair<long long, long long>; using pil = pair<int, long long>; using pli = pair<long long, int>; using ll = long long; #define X first #define Y second #define pb push_back #define mp make_pair int n, k, t[100]; string a; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cin >> n; while(n--){ cin >> a; k=3*(a[0]-'1')+a[1]-'A'; t[k]++; } for(int i = 0; i<12; i++){ if(t[i]<1){ cout << "NIE"; return 0; } } for(int i = 12; i<15; i++){ if(t[i]<2){ cout << "NIE"; return 0; } } cout << "TAK"; return 0; } |