JZYZOJ 2002 [cf] 石江豪pk李震 博弈论 sg函数

http://172.20.6.3/Problem_Show.asp?id=2002

https://blog.csdn.net/qq_24451605/article/details/50154973

 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<cmath>
 #include<iostream>
 #include<map>
 using namespace std;
 int n,k;
 int f[]={};
 int dfs(int x){
     if(x<)return f[x];
     if(x&)return ;
     return dfs(x/)==?:;
 }
 int main(){
     scanf("%d%d",&n,&k);
     int ans=,x;
     for(int i=;i<n;i++){
         scanf("%d",&x);
         if(k&){
             f[]=f[]=f[]=;f[]=f[]=;f[]=;
             if(x<)ans^=f[x];
             else ans^=x&?:dfs(x);
         }
         else{
             f[]=f[]=;
             f[]=f[]=;
             f[]=;
             if(x<)ans^=f[x];
             else ans^=x&?:;
         }
     }
     if(ans)printf("DaDeBuCuo\n");
     else printf("WoHenBaoQian\n");
     return ;
 }