1005 game-博弈

Game

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 0    Accepted Submission(s): 0

Problem Description

  
  

   
      Here is a game for two players. The rule of the game is described below: 

   ● In the beginning of the game, there are a lot of piles of beads.

   ● Players take turns to play. Each turn, player choose a pile i and remove some (at least one) beads from it. Then he could do nothing or split pile i into two piles with a beads and b beads.(a,b > 0 and a + b equals to the number of beads of pile i after removing) 

   ● If after a player's turn, there is no beads left, the player is the winner.

   Suppose that the two players are all very clever and they will use optimal game strategies. Your job is to tell whether the player who plays first can win the game.
  
  

 

Input

  
  

   
      There are multiple test cases. Please process till EOF.

   For each test case, the first line contains a postive integer n(n < 10
   
   5) means there are n piles of beads. The next line contains n postive integer, the i-th postive integer a
   
   i(a
   
   i < 2
   
   31) means there are a
   
   i beads in the i-th pile.
  
  

 

Output

  
  

   
      For each test case, if the first player can win the game, ouput "Win" and if he can't, ouput "Lose"
  
  

 

Sample Input

  
  

   
   1
1
2
1 1
3
1 2 3
  
  

 

Sample Output

  
  

   
   Win
Lose
Lose
  
  

 
博弈知识，用到的是^异或命令，但不知道是什么原因

#include <iostream>
#include <cstdio>
using namespace std;

int main()
{
    int n;
    __int64 a[100005];
    while(scanf("%d",&n)!=EOF)
	{
		for(int i=0;i<n;i++)
		{
			scanf("%I64d",&a[i]);
		}
		if(n==1)
			{printf("Win\n");}
		else
		{
		 __int64 sum=0;
		 for(int i=0;i<n;i++)
			sum=sum^a[i];
		 if(sum==0) printf("Lose\n");
		 else
			printf("Win\n");

		}


	}
    return 0;
}