hdoj problem 5011Game（博弈论之尼姆博弈&&ACM模板）

Game

http://acm.hdu.edu.cn/showproblem.php?pid=5011

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

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⁵) means there are n piles of beads. The next line contains n postive integer, the i-th postive integer a_i(a_i < 2³¹) 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
  
  

 

Source

2014 ACM/ICPC Asia Regional Xi'an Online

 

Recommend

hujie   |   We have carefully selected several similar problems for you:  5099 5098 5097 5096 5095 

/*

尼姆博奕(Nimm Game):

有n堆各若干个物品,两个人轮流从某一堆取任意多的物品,规定每次至少取一个,多者不限,最后取光者得胜.

任何奇异局势(a1, a2, … , an)都有a1(+)a2(+)…(+)an =0. ( (+)为 按位^)

引入 局势 (X1,X2,X3····Xn)的Nim-Sum = X1^X2^X3^············Xn;

 任何奇异局势都有Nim-SUm = 0。

*/

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int main()
{
int n;
while(~scanf("%d",&n))
{
int i,t=0,a;
for(i=1;i<=n;i++)
{
     scanf("%d",&a);
 t^=a; 
}
if(t)
 printf("Win\n");
 else
 printf("Lose\n");
}
return 0;
}