SCUT - 290 - PARCO的因数游戏 - 博弈论

#include<bits/stdc++.h>
using namespace std;
#define ll long long

#define MAXN 1000005
#define N 1000005

//f[N]:可改变当前状态的方式，N为方式的种类，f[N]要在getSG之前先预处理
//SG[]:0~n的SG函数值
//S[]:为x后继状态的集合
vector<int> nextofSG[MAXN];
int f[N],SG[MAXN],S[MAXN];
void  getSG(int n){
    for(int i = 2; i <= n; i++){
        int l=nextofSG[i].size();
        //后继状态 最多有l 种
        for(int j=0;j<=l;j++){
            S[j]=0;
        }
        for(auto vi:nextofSG[i]){
            //vi：从i状态能取走的石子数
            S[SG[i-vi]]=1;
        }
        for(int j=0;j<=l;j++){
            if(!S[j]){
                SG[i] = j;
                break;
            }
        }
        //cout<<"SG["<<i<<"]="<<SG[i]<<endl;
    }

}

int a[1000005];

unsigned generateai(unsigned &n,unsigned &x,unsigned &y, unsigned &z){
    x=x^(x<<11);
    x=x^(x>>4);
    x=x^(x<<5);
    x=x^(x>>14);
    unsigned w=x^(y^z);
    x=y;
    y=z;
    z=w;
    return z;
}

int main(){
    unsigned n,x,y,z;
    for(int i=1;i<=1000000;i++){
        for(int j=i+i;j<=1000000;j+=i){
            nextofSG[j].push_back(i);
        }
    }
    getSG(1000000);
    for(int t=0;t<100;t++){
        cin>>n>>x>>y>>z;
        int sumSG=0;
        for(int i=0;i<n;i++){
            a[i]=generateai(n,x,y,z)%n+1;
            //cout<<a[i]<<endl;
            sumSG^=SG[a[i]];
        }
        //cout<<"!"<<sumSG<<endl;
        if(sumSG==0)
            cout<<"Parco"<<endl;
        else{
            cout<<"Kaildls"<<endl;
        }
    }
}