SG函数

study from:

https://blog.csdn.net/luomingjun12315/article/details/45555495

SG[0]=0

https://zhuanlan.zhihu.com/p/20611132

https://www.jianshu.com/p/e215fe4797c1

Fibonacci again and again

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

下面的vis数组大小可根据实际的打表数值进行减小

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <cmath>
#include <algorithm>
#include <iostream>
using namespace std;
#define ll long long

const int maxn=1e3+10;
const int maxv=1e3;

int a[maxn],mex[maxn];
bool vis[maxn];

int main()
{
    int n,m,p,i,j;
    a[1]=1;
    a[2]=1;
    for (i=3;a[i-1]<=maxv;i++)
        a[i]=a[i-1]+a[i-2];
    for (i=1;i<=maxv;i++)
    {
        memset(vis,0,sizeof(vis));
        for (j=1;a[j]<=i;j++)
            vis[mex[i-a[j]]]=1;
        for (j=0;j<=maxv;j++)
            if (!vis[j])
                break;
        mex[i]=j;
    }
//    for (i=0;i<=100;i++)
//        printf("%d ",mex[i]);
    /*
0 1 2 3 0 1 2 3 4 5 0 1 2 3 0 1 2 3 4 5 0 1 2 3 0 1 2 3 4 5 0 1 2 3 4 5 0 1 2 3 0 1 2 3 4 5 0 1 2 3 0 1 2 3 4 5 0 1 2 3 0 1 2 3 4 5 0 1 2 3 4 5 0 1 2 3 0 1 2 3 4 5 0 1 2 3 0 1 2 3 4 5 0 1 2 3 0 1 2 3 4
0 1 2 3 0 1 2 3 4 5 一个循环节
    */
    while (~scanf("%d%d%d",&n,&m,&p))
    {
        if (n==0)
            break;
        if (mex[n]^mex[m]^mex[p])
            printf("Fibo
");
        else
            printf("Nacci
");
    }
    return 0;
}

石子相关：

https://blog.csdn.net/qq_33765907/article/details/51174524

……