HDU 1847 Good Luck in CET-4 Everybody SG函数 博弈论

#include<iostream>
#include<iomanip>
#include<queue>
#include<algorithm>
#include<cstdlib>
#include<cstdio>
#include<cstring>
#include<cmath>

using namespace std;

const int MAX=1111;
int N,M,SG[MAX],S[MAX];
vector<int> F;

void GetSG()
{
    memset(SG,0,sizeof(SG));
    for (int i=1;i<=N;i++)
    {
        memset(S,0,sizeof(S));
        for (int j=0;j<M&&i-F[j]>=0;j++)
            S[SG[i-F[j]]]=1;
        for (int j=0;j<=N;j++)
            if (!S[j])
                SG[i]=j,j=N+12345;
    }
}

int main()
{
    cin.sync_with_stdio(false);
    F.push_back(1);
    while (F.back()<MAX)
        F.push_back(F.back()*2);
    M=F.size();
    while (cin>>N)
    {
        GetSG();
        if (SG[N])
            cout<<"Kiki\n";
        else
            cout<<"Cici\n";
    }
    return 0;
}