HDU 1848 Fibonacci again and again

#include<stdio.h>
#include<string.h>
#define MAXD 1010
int f[20], h[MAXD][20], sg[MAXD];
void prepare()
{
int i;
f[0] = f[1] = 1;
for(i = 2; i <= 15; i ++)
f[i] = f[i - 1] + f[i - 2];
memset(h, 0, sizeof(h));
memset(sg, -1, sizeof(sg));
}
int dfs(int n)
{
int i;
if(sg
!= -1)
return sg
;
for(i = 1; i <= 15; i ++)
if(n - f[i] >= 0)
h
[dfs(n - f[i])] = 1;
for(i = 0; h
[i]; i ++);
return sg
= i;
}
int main()
{
prepare();
for(;;)
{
int m, n, p;
scanf("%d%d%d", &m, &n, &p);
if(!m && !n && !p)
break;
printf("%s\n", (dfs(m) ^ dfs(n) ^ dfs(p)) == 0 ? "Nacci" : "Fibo");
}
return 0;
}