Unfortunately we were unable to fully decode your file, as it is not encoded in UTF-8. You can try to decode it yourself by downloading it here.
 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
// Micha� Figlus
#include<cstdio>
#include<cmath>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<fstream>
#include<vector>
#include<queue>
#include<stack>
#include<list>
#include<algorithm>

using namespace std;

int main()
{
 long long i,j,k,l,n,f[46];
 bool b;
 f[0]=0;
 f[1]=1;
 for(i=2;i<=45;i++) f[i]=f[i-1]+f[i-2];
 scanf("%lld",&k);
 for(l=1;l<=k;l++)
 {
     scanf("%lld",&n);
     b=true;
     for(i=0;i<=45&&b;i++) for(j=0;j<=i&&b;j++) if(f[i]*f[j]==n) b=false;
     if(b) printf("NIE\n");
     else printf("TAK\n");           
                
 }

 return 0;
}