HDOJ 1760 Fibonacci again and again 博弈 SG函数

//HDOJ 1760 Fibonacci again and again SG函数
/*
题意：有3堆石子，每次能从一堆中取走f个，f是Fib数列(1,2,3,5...)
         给定3堆石子的数量，问先手的胜负态
思路：SG函数
*/
#include<stdio.h>
#include<string.h>
#include<stdlib.h>

#define N 20
#define M 1005
int op[N];
int sg[M],s[M];
int n,m,k,cnt;

void init(){
	int i,tmp;
	op[1] = 1;op[2] = 2;
	for(i = 3; ;++i){
		tmp = op[i-1] + op[i-2];
		if(tmp > 1000)
			break;
		op[i] = tmp;
	}
	cnt = i;
}
int mex(int n){
	int i,res,judge[N] = {0};
	for(i = 1; i < cnt; ++i){
		res = n-op[i];
		if(res<0)
			break;
		if(sg[res] == -1)
			sg[res] = mex(res);
		judge[sg[res]] = 1;
	}
	for(i = 0; ; ++i)
		if(judge[i]==0)
			return i;
}
void bx(){
	int i;
	for(i = 1; i <= 1000; ++i)
		sg[i] = mex(i);
}
int main(){
	init();
	memset(sg,-1,sizeof(sg));
	bx();
	while(scanf("%d %d %d",&n,&m,&k)!=EOF){
		if(n == 0 && m == 0 && k == 0)
			break;
		int ans = 0;
		ans^=sg[n];
		ans^=sg[m];
		ans^=sg[k];
		
		puts(ans?"Fibo":"Nacci");
	}
	return 0;
}