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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
//
//  main.cpp
//  Wyliczanka
//
//  Created by dzmitry kavaliou on 11/03/2025.
//

#include <iostream>
#include <vector>

using namespace std;

bool Recur(int conts[], int i, int size);

bool RRecur(int conts[], int i, int size){
    if(conts[--i]==0){
        return size == 0;
    }
    else {
        conts[i]--;
        size--;
        return (RRecur(conts, i, size) || Recur(conts, i, size));
    }
}
bool Recur(int conts[], int i, int size){
    if(conts[++i]==0){
        return size == 0;
    }
    else {
        conts[i]--;
        size--;
        return RRecur(conts, i, size) || Recur(conts, i, size);
    }
}

int main(int argc, const char * argv[]) {
    int t;
    cin >> t;
    vector<bool> memo(t);
    for(int  i  = 0 ;  i <  t; i++){
        int not0=0;
        bool endnum=0;
        memo[i] = 0;
        int si;
        cin >> si;
        int fi[++si+1];
        fi[0]=0;
        fi[si]=0;
        for(int y = 1; y < si; y++){
            cin >> fi[y];
            if(not0 != 0 && fi[y] == 0) endnum = 1;
            if(endnum && fi[y] > 0 && not0 !=0) memo[i] = 1;
            not0 += fi[y];
        }
        if(memo[i]) memo[i] = 0;
        else {
            int x = 0;
            bool isit = 0;
            for(; fi[x] == 0; x++);
            for(; fi[x] > 0 && x < si && !isit; x++){
                int fo[si+1];
                for(int u = 0; u <= si; u++){
                    fo[u]=fi[u];
                }
                fo[x]--;
                int h = not0;
                h--;
                isit = Recur(fo, x, h);
                fo[x]++;
            }
            memo[i] = isit;
        }
    }
    for(int  i =0; i < t; i++){
        if(memo[i]) cout << "TAK" << endl;
        else cout << "NIE" << endl;
    }
    return 0;
}