#include <bits/stdc++.h> using namespace std; #define mk make_pair #define fi first #define sz(x) x.size() #define se second #define pb push_back #define VAR(v) #v << " = " << v << " " #define debug if(0) #define M_PI 3.14159265358979323846 typedef complex<long double> C; typedef long long ll; typedef pair<int, int> ii; typedef vector<ll> Matrix; const int maxn = (int)1e6 + 9; const int INF = (int)1e9 + 7; int mod = (int)1e9 + 7; int n; int tab[5][3]; int main(int argc, char* argv[]) { ios::sync_with_stdio(false); debug; else cin.tie(NULL), cout.tie(NULL); cin>>n; for(int i = 0; i < n; i++) { string s; cin>>s; int a = s[0] - '1'; int b = s[1] - 'A'; debug cout << VAR(a) << VAR(b) << endl; tab[a][b]++; } bool ans = true; for(int i = 0; i < 4; i++) for(int j = 0; j < 3; j++) if(tab[i][j] < 1) ans = false; for(int j = 0; j < 3; j++) if(tab[4][j] < 2) ans = false; if(ans) 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 42 43 44 45 46 47 | #include <bits/stdc++.h> using namespace std; #define mk make_pair #define fi first #define sz(x) x.size() #define se second #define pb push_back #define VAR(v) #v << " = " << v << " " #define debug if(0) #define M_PI 3.14159265358979323846 typedef complex<long double> C; typedef long long ll; typedef pair<int, int> ii; typedef vector<ll> Matrix; const int maxn = (int)1e6 + 9; const int INF = (int)1e9 + 7; int mod = (int)1e9 + 7; int n; int tab[5][3]; int main(int argc, char* argv[]) { ios::sync_with_stdio(false); debug; else cin.tie(NULL), cout.tie(NULL); cin>>n; for(int i = 0; i < n; i++) { string s; cin>>s; int a = s[0] - '1'; int b = s[1] - 'A'; debug cout << VAR(a) << VAR(b) << endl; tab[a][b]++; } bool ans = true; for(int i = 0; i < 4; i++) for(int j = 0; j < 3; j++) if(tab[i][j] < 1) ans = false; for(int j = 0; j < 3; j++) if(tab[4][j] < 2) ans = false; if(ans) cout<<"TAK\n"; else cout<<"NIE\n"; return 0; } |