#include <bits/stdc++.h> #define boost \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0) #define debug(x) cerr << #x << " " << x << endl #define ll long long #define st first #define nd second using namespace std; int n, t; string s; char buf[5]; map<string, int> positions; int main() { boost; cin >> n; while (n--) { cin >> s; positions[s]++; } for (int i = 1; i <= 5; i++) { for (int j = 0; j <= 2; j++) { sprintf(buf, "%d%c", i, 'A' + j); if (positions[buf] == 0 || i == 5 && positions[buf] == 1) { 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 | #include <bits/stdc++.h> #define boost \ ios_base::sync_with_stdio(0); \ cin.tie(0); \ cout.tie(0) #define debug(x) cerr << #x << " " << x << endl #define ll long long #define st first #define nd second using namespace std; int n, t; string s; char buf[5]; map<string, int> positions; int main() { boost; cin >> n; while (n--) { cin >> s; positions[s]++; } for (int i = 1; i <= 5; i++) { for (int j = 0; j <= 2; j++) { sprintf(buf, "%d%c", i, 'A' + j); if (positions[buf] == 0 || i == 5 && positions[buf] == 1) { cout << "NIE\n"; return 0; } } } cout << "TAK\n"; } |