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
// Author: Artur Hibner
#include <cstdio>
#include <vector>
#include <set>

std::vector<int> fib_nums;
std::set<int> products;

int main() {
  fib_nums.clear();
  products.clear();
  int a = 0;
  int b = 1;
  while (a <= 1000000000) {
    fib_nums.push_back(a);
    int c = a + b;
    a = b;
    b = c;
  }
  for (int i = 0 ; i < fib_nums.size(); i++) {
    for (int j = i ; j < fib_nums.size(); j++) {
      int prod = fib_nums[i] * fib_nums[j];
      products.insert(prod);
    }
  }
  int t;
  scanf("%d", &t);
  for (int i = 0 ; i < t ; i++) {
    int num;
    scanf("%d", &num);
    if (products.find(num) != products.end()) {
      printf("TAK\n");
    } else {
      printf("NIE\n");
    }
  }
  return 0;
}