HDU 1848 Fibonacci again and again

http://acm.hdu.edu.cn/showproblem.php?pid=1848

组合博弈 sg值

#include <stdio.h>
#include <string.h>
int main()
{
    const int N=1001,M=17;
    const char name[2][10]={"Nacci","Fibo"};
    int f[M]={1,1};
    for (int i=2;i<M;i++) f[i]=f[i-1]+f[i-2];
    int a[N]={0},vis[N],i,j,n,m,p;
    for (i=0;i<N;i++)
    {
        memset(vis,0,sizeof(vis));
        for (j=1;i-f[j]>=0;j++) vis[a[i-f[j]]]=1;
        j=0; while (vis[j]) j++;
        a[i]=j;
    }
    while (scanf("%d%d%d",&m,&n,&p),m||n||p)
        printf("%s\n",name[(a[m]^a[n]^a[p])>0]);
}