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
// PA 2024 2B - Wyliczanka
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
using namespace std;

bool checkSequence(vector<int> *nums, int n, int pos, bool isStart, bool onlyZeroes) {
	if ((*nums)[pos] < 0) {
		return false;
	}
	if ((*nums)[pos] > 0 && onlyZeroes) {
		return false;
	}
	if (pos == n - 1) {
		if ((*nums)[pos] <= 1) {
			return true;
		} else {
			return false;
		}
	}
	
	(*nums)[pos + 1] -= (*nums)[pos];
	if (!isStart) {
		if (checkSequence(nums, n, pos + 1, false, (*nums)[pos] == 0)) {
			return true;
		}
	}
	++(*nums)[pos + 1];
	if (checkSequence(nums, n, pos + 1, true, (*nums)[pos] == 0)) {
		return true;
	}
	--(*nums)[pos + 1];
	(*nums)[pos + 1] += (*nums)[pos];
	
	
	return false;
}

int main()
{
	ios_base::sync_with_stdio(0);
	int t, n, a;
	
	cin >> t;
	for (int i = 0; i < t; ++i) {
		vector<int> nums;
		cin >> n;
		for (int j = 0; j < n; ++j) {
			cin >> a;
			if (a != 0 || nums.size() > 0) {
				nums.push_back(a);
			}
		}

		while (nums.back() == 0) {
			nums.pop_back();
		}
		n = nums.size();
		
		if (checkSequence(&nums, n, 0, false, false)) {
			cout << "TAK" << endl;
		} else {
			cout << "NIE" << endl;
		}				
	}
	
	return 0;
}