hdu 5011 nim博弈 （2014西安网赛E题）

n堆石子，每次可以选一堆取走至少一个，之后你可以不操作或者把该堆石子分成两堆，每堆至少一个，和还是原来（取完石子后）的石子个数。

Sample Input
1
1
2
1 1
3
1 2 3

Sample Output
Win
Lose
Lose

 # include <iostream>
 # include <cstdio>
 # include <cstring>
 # include <string>
 # include <algorithm>
 # include <cmath>
 # include <queue>
 # define LL long long
 using namespace std ;
 
 int main ()
 {
    // freopen("in.txt","r",stdin) ;
     int n ;
     while(scanf("%d" , &n) != EOF)
     {
         int i , x ;
         int sum =  ;
         for (i =  ; i <= n ; i++)
         {
             scanf("%d", &x) ;
             sum ^= x ;
         }
         if (sum)
            printf("Win\n") ;
         else
            printf("Lose\n") ;
     }
 
     return  ;
 }