BZOJ3713 [PA2014]Iloczyn

n以内的斐波那契数大概是log n个，所以直接枚举就行了……

#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<map>
#include<set>
#include<bitset>
#include<queue>
#include<stack>
using namespace std;
#define MAXN 1010
#define MAXM 1010
#define INF 1000000000
#define MOD 1000000007
#define eps 1e-8
#define ll long long
int f[MAXN];
int n;
int main(){
	int i,j,x;
	f[0]=0;
	f[1]=1;
	for(n=2;;n++){
		f[n]=f[n-1]+f[n-2];
		if(f[n]>INF){
			break;
		}
	}
	int tmp;
	scanf("%d",&tmp);
	while(tmp--){
		scanf("%d",&x);
		if(!x){
			printf("TAK\n");
			continue ;
		}
		bool flag=0;
		for(i=1;f[i]<=x;i++){
			if(!(x%f[i])){
				for(j=1;f[j]<=x;j++){
					if(f[j]==x/f[i]){
						printf("TAK\n");
						flag=1;
						break;
					}
				}
				if(flag){
					break;
				}
			}
		}
		if(!flag){
			printf("NIE\n");
		}
	}
	return 0;
}

/*

*/