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
#include <iostream>
#include <algorithm>

using namespace std;

bool *tab[26];

int main()
{
    ios_base::sync_with_stdio(false);
    int n;
    cin >> n;
    if (n == 0)
    {
        if (rand() % 2 == 0)
            cout << "TAK\n";
        else
            cout << "NIE\n";
        return 0;
    }

    for (int i = 0; i < 26; i++)
    {
        tab[i] = new bool[n / 2];
        for (int j = 0; j < n / 2; j++)
            tab[i][j] = false;
    }

    char c;
    for (int i = 0; i < n / 2; i++)
    {
        cin >> c;
        tab[c - 'a'][i] = true;
    }
    if (n % 2 == 1)
        cin >> c;
    for (int i = (n / 2) - 1; i >= 0; i--)
    {
        cin >> c;
        if (!tab[c - 'a'][i])
        {
            cout << "NIE\n";

            for (int i = 0; i < 26; i++)
                delete[] tab[i];

            return 0;
        }
    }

    cout << "TAK\n";

    for (int i = 0; i < 26; i++)
        delete[] tab[i];

    return 0;
}