2019.01.03-sg函数模板

#include<bits/stdc++.h>
#define il inline
#define _(d) while(d(isdigit(ch=getchar())))
using namespace std;
const int N=1e5+5;
int f[N],Sg[N],s[N];
il int read(){int x,f=1;char ch;_(!)ch=='-'?f=-1:f;x=ch^48;_()x=(x<<1)+(x<<3)+(ch^48);return f*x;}
void sg(int n){
    for(int i=1;i<=n;i++){
        memset(s,0,sizeof(s));
        for(int j=0;f[j]<=i&&j<N;j++)
            s[Sg[i-f[j]]]=1;
        for(int j=0;;j++)if(!s[j]){
            Sg[i]=j;break;
        }
    }
}
int main()
{
    return 0;
}
View Code

//后期填坑

原文地址:https://www.cnblogs.com/Jessie-/p/10213288.html