POJ 2311 博弈

 #include<stdio.h>
 #include<string.h>
 #include<set>
 using namespace std;

 int sg[][];

 int solve(int w,int h){
     if(sg[w][h]!=-){
         return sg[w][h];
     }
     set<int> my_set;
     for(int i=;w-i>=;i++){
         my_set.insert(solve(i,h)^solve(w-i,h));
     }
     for(int j=;h-j>=;j++){
         my_set.insert(solve(w,j)^solve(w,h-j));
     }
     int g=;
     while(my_set.count(g)){
         g++;
     }
     return sg[w][h]=g;
 }

 int main(){
     int w,h;
     memset(sg,-,sizeof(sg));
     while(~scanf("%d%d",&w,&h)){
         if(solve(w,h)){
             puts("WIN");
         }
         else{
             puts("LOSE");
         }
     }
 }