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

using namespace std;

const int FibTabMax = 44;

int main()
{
	int T[10], t;
	cin >> t;
	for (int i = 0; i < t; ++i)
	{
		cin >> T[i];
	}

	long long FibTab[FibTabMax];
	FibTab[0] = 0;
	FibTab[1] = 1;
	for (int i = 2; i < FibTabMax; ++i)
	{
		FibTab[i] = FibTab[i-1] + FibTab[i-2];
	}
	int j;
	bool res;
	for (int i = 0; i < t; ++i)
	{
		j = 2;
		res = false;
		while (!res && j < FibTabMax)
		{
			if (T[i] == FibTab[j])
				res = true;
			if (T[i] % FibTab[j] == 0)
			{
				if (binary_search(FibTab,FibTab+FibTabMax,T[i]/FibTab[j]))
					res = true;
			}
			++j;
		}

		if (res)
			cout << "TAK\n";
		else
			cout << "NIE\n";
	}
	
	return 0;
}