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
#include <cstdio>

#define MAXN 1000009
int t, n;
int A[MAXN];

int wyliczanka()
{
    int s = 1;
    int i;
    int last;

    for (last = n-1; last >= 0; --last) 
        if (A[last])
            break;

    /* skip zeros */
    for (i = 0; i < n-1; ++i) 
        if (A[i])
            break;

    for (; i < last; ++i) 
    {
        if (A[i] == 0) {
            return 0;
        }
        if (A[i+1] - A[i] <= 0 && s > 0) {
            A[i]--;
            s--;
        }

        A[i+1] -= A[i];

        if (A[i+1] < 0) {
            return 0;
        }
    }

    if (A[last] == s) {
        return 1;
    } else {
        return 0;
    }
}

int main()
{
    scanf("%d", &t);

    for (int i = 0; i < t; ++i) {
        scanf("%d", &n);
        for (int j = 0; j < n; ++j)
            scanf("%d", &A[j]);

        int ret = wyliczanka();
        printf(ret ? "TAK\n" : "NIE\n");
    }
}