#include <iostream>
using namespace std;
int main() {
int i, j, n;
ios_base::sync_with_stdio(0);
cin >> n;
int grid[3][5];
for (i = 0; i < 3; ++i) {
for (j = 0; j < 5; ++j) {
grid[i][j] = 0;
}
}
int k;
char c;
for (i = 0; i < n; ++i) {
cin >> k >> c;
cin.get();
grid[c - 'A'][k - 1] += 1;
}
bool ok = true;
for (i = 0; i < 3; ++i) {
for (j = 0; ok && (j < 4); ++j) {
ok = ok && grid[i][j] >= 1;
}
ok = ok && (grid[i][4] >= 2);
}
if (ok)
cout << "TAK" << endl;
else
cout << "NIE" << endl;
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 | #include <iostream> using namespace std; int main() { int i, j, n; ios_base::sync_with_stdio(0); cin >> n; int grid[3][5]; for (i = 0; i < 3; ++i) { for (j = 0; j < 5; ++j) { grid[i][j] = 0; } } int k; char c; for (i = 0; i < n; ++i) { cin >> k >> c; cin.get(); grid[c - 'A'][k - 1] += 1; } bool ok = true; for (i = 0; i < 3; ++i) { for (j = 0; ok && (j < 4); ++j) { ok = ok && grid[i][j] >= 1; } ok = ok && (grid[i][4] >= 2); } if (ok) cout << "TAK" << endl; else cout << "NIE" << endl; return 0; } |
English