#include <iostream> #include <string> using namespace std; int counter[15]; void markOccurence(string task) { int pos = 3 * (task[0] - '1') + (task[1] - 'A'); ++counter[pos]; } bool isValid() { for (int i = 0; i < 12; ++i) { if (counter[i] < 1) { return false; } } for (int i = 12; i < 15; ++i) { if (counter[i] < 2) { return false; } } return true; } int main() { int n; string input; for (int i = 0; i < 15; ++i) { counter[i] = 0; } cin >> n; for (int i = 0; i < n; ++i) { cin >> input; markOccurence(input); } cout << (isValid() ? "TAK" : "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 40 41 42 43 44 45 46 | #include <iostream> #include <string> using namespace std; int counter[15]; void markOccurence(string task) { int pos = 3 * (task[0] - '1') + (task[1] - 'A'); ++counter[pos]; } bool isValid() { for (int i = 0; i < 12; ++i) { if (counter[i] < 1) { return false; } } for (int i = 12; i < 15; ++i) { if (counter[i] < 2) { return false; } } return true; } int main() { int n; string input; for (int i = 0; i < 15; ++i) { counter[i] = 0; } cin >> n; for (int i = 0; i < n; ++i) { cin >> input; markOccurence(input); } cout << (isValid() ? "TAK" : "NIE") << endl; return 0; } |