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
48
49
50
51
52
53
54
55
56
57
58
59
60
61
#include <iostream>
#include <cstdio>
#include <unordered_map>
#include <algorithm>

using namespace std;

const string categories[] = {"A", "B", "C"};
const string rounds[] = {"1", "2", "3", "4", "5"};

int main()
{
    ios_base::sync_with_stdio(0);

    unordered_map<string, int> m;

    int n;
    cin >> n;

    for (int i = 0; i < n; ++i)
    {
        string s;
        cin >> s;

        if (m.count(s) == 0)
        {
            m.insert({s, 1});
        }
        else
        {
            m[s]++;
        }
    }

    for (auto round : rounds)
    {
        for (auto category : categories)
        {
            // cout << round + category << " " << m.at(round + category) << endl;
            if (round == "5")
            {
                if (m.count(round + category) == 0 || m.at(round + category) < 2)
                {
                    cout << "NIE\n";
                    return 0;
                }
            }
            else
            {
                if (m.count(round + category) == 0 || m.at(round + category) < 1)
                {
                    cout << "NIE\n";
                    return 0;
                }
            }
        }
    }

    cout << "TAK\n";
    return 0;
}