HDU - 5011 Game
2014-09-14 23:07
323 查看
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 < 105) means there are n piles of beads. The next line contains n postive integer, the i-th postive integer ai(ai < 231) means there are ai
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
Sample Output
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 < 105) means there are n piles of beads. The next line contains n postive integer, the i-th postive integer ai(ai < 231) means there are ai
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 题意:取完石头后,可以再把这堆分成两个堆 思路:类似Nim游戏:异或起来0为先手输#include <iostream> #include <cstdio> #include <cstring> #include <algorithm> typedef __int64 ll; using namespace std; int main() { int n; while (scanf("%d", &n) != EOF) { ll ans = 0; ll tmp; for (int i = 0; i < n; i++) { scanf("%I64d", &tmp); ans ^= tmp; } if (ans == 0) printf("Lose\n"); else printf("Win\n"); } }
相关文章推荐
- HDU-#5011 Game(Nim和)
- hdu 5011 Game(博弈)
- HDU 5011-Game(博弈)
- HDU—— 5011 Game
- HDU 5011 Game(Nim博弈)
- HDU 5011 Game (博弈)
- HDU 5011-Game(尼姆博弈)
- HDU 5011 Game(西安网络赛E题)
- HDU 5011-Game(博弈)
- hdu 5011——Game
- HDU 5011 Game 【Nim博弈】
- hdu 5011 Game(2014 西安网络赛)
- HDU 5011-game -nim游戏变种
- HDU 5011 Game(博弈论)
- hdu 5011 Game【尼姆博弈】
- hdu 5011 Game
- HDU 5011 Game-多个堆的NIM博弈
- [博弈] hdu 5011 Game
- hdu 5011 Game
- hdu 5011 Game 博弈