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
#include <iostream>
#include <algorithm>
using namespace std;

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int n{};
    cin >> n;
    short zadania[5][3]{};
    for (int i = 0; i < n; i++)
    {
        string zadanie{};
        cin >> zadanie;
        int runda = zadanie[0] - 49;
        int dywizja = zadanie[1] - 65;
        zadania[runda][dywizja]++;
        
    }
    for (int i = 0; i < 4; i++)
    {
        for (int j = 0; j < 3; j++)
        {
            if (zadania[i][j] < 1)
            {
                cout << "NIE";
                return 0;
            }
        }
    }
    for (int j = 0; j < 3; j++)
        {
            if (zadania[4][j] < 2)
            {
                cout << "NIE";
                return 0;
            }
        }
    cout << "TAK";
}