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
#include <iostream>
using namespace std;
long long tab[40]={0, 1, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946, 17711, 28657, 46368, 75025, 121393, 196418, 317811, 514229, 832040, 1346269, 2178309, 3524578, 5702887, 9227465, 14930352, 24157817, 39088169, 63245986};

bool ilo(long long liczba) {
    int i=0;
    int j=39;
    bool found = false;
    while (i<=j&&!found) {
        long long iloczyn=tab[i]*tab[j];
        if (iloczyn<liczba) i++;
        else if (iloczyn>liczba) j--;
        else found=true;
    }
    return found;
}

int main()
{
    ios_base::sync_with_stdio(0);
    int k;
    cin >> k;
    bool *wyniki=new bool[k];
    long long liczba;

    for (int i=0; i<k; i++) {
        cin >> liczba;
        wyniki[i]=ilo(liczba);
    }

    for (int i=0; i<k; i++) {
        if (wyniki[i])
            cout << "TAK";
        else
            cout << "NIE";
        cout << endl;
    }

}