#include <iostream>
using namespace std;
int main()
{
int tab[210],t,n,il;
bool p;
tab[0]=0;
tab[1]=1;
for (int i=2;i<210;i++) tab[i]=tab[i-1]+tab[i-2];
cin>>t;
while (t--) {
p=0;
cin>>n;
for (int i=1;i<210;i++) {
if (tab[i]>n) break;
for (int j=i;j<210;j++) {
il=tab[i]*tab[j];
if (il==n) {
p=1;
break;
}
if (il>n) break;
}
}
if (p) cout<<"TAK"<<endl;
else cout<<"NIE"<<endl;
}
return 0;
}
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 | #include <iostream> using namespace std; int main() { int tab[210],t,n,il; bool p; tab[0]=0; tab[1]=1; for (int i=2;i<210;i++) tab[i]=tab[i-1]+tab[i-2]; cin>>t; while (t--) { p=0; cin>>n; for (int i=1;i<210;i++) { if (tab[i]>n) break; for (int j=i;j<210;j++) { il=tab[i]*tab[j]; if (il==n) { p=1; break; } if (il>n) break; } } if (p) cout<<"TAK"<<endl; else cout<<"NIE"<<endl; } return 0; } |
English