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
#include <ios>
#include <iostream>
#include <vector>
using namespace std;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  int k, n;
  int a, b;
  int ends;
  bool flag;
  cin >> k;
  vector<int> tab;
  for (int s = 0; s < k; ++s) {
    cin >> n;
    tab.clear();
    tab.reserve(n + 1);
    tab.push_back(0);
    flag = false;
    for (int i = 0; i < n; ++i) {
      int a;
      cin >> a;
      if (a != 0 || flag) {
        flag = true;
        tab.push_back(a * 2);
      }
    }
    while (tab.back() == 0) {
      tab.pop_back();
    }
    a = 0;
    b = 0;
    ends = 2;
    flag = true;
    for (int i = 1; i < tab.size() - 1; ++i) {
      b = tab[i] - (tab[i - 1] - b);
      if ((b > tab[i + 1] && i + 2 == tab.size()) ||
          (b >= tab[i + 1] && i + 2 != tab.size())) {
        if (ends == 0) {
          flag = false;
          break;
        }
        tab[i]--;
        b--;
        ends--;
        if ((b > tab[i + 1]) || (b == tab[i + 1] && i + 2 != tab.size())) {
          if (ends == 0) {
            flag = false;
            break;
          }
          tab[i]--;
          b--;
          ends--;
        }
      }
      if (b <= 0) {
        flag = false;
        break;
      }
      /*cout << b << " ";*/
      swap(a, b);
    }
    b = tab.back() - (tab[tab.size() - 2] - b);
    if (b != 0 && ends) {
      b--;
      ends--;
      if (b != 0 && ends) {
        b--;
        ends--;
      }
    }
    /*cout << b << endl;*/
    if (b == 0 && flag) {
      cout << "TAK\n";
    } else {
      cout << "NIE\n";
    }
  }
}