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
#include <iostream>
#include <set>
using namespace std;

typedef unsigned long long int big;

big fibo[45]= {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,102334155,165580141,267914296,
    433494437,701408733
};

int main() {
    // preproc
    int i,j;
    big n,lim=1000000000;
    set<big> ilo;
    ilo.clear();
    for (i=0; i<45; i++) {
        for (j=i; j<45; j++) {
            n=fibo[i]*fibo[j];
            if (n<=lim) {
                ilo.insert(n);
            }
        }
    }
    // proc
    int t;
    n=0;
    set<big>::iterator it;
    cin >> t;
    for (i=0; i<t; i++) {
        cin >> n;
        it=ilo.find(n);
        if (it==ilo.end()) {
            cout << "NIE";
        }
        else {
            cout << "TAK";
        }
        cout << endl;
    }
    
    return 0;
}

// 44 : 701408733
// 45 : 1134903170
// 4 (2*2) - tak