hdoj 5011 Game(基础尼姆博弈)
来源:互联网 发布:clojure编程 中文 编辑:程序博客网 时间:2024/04/27 18:26
http://acm.hdu.edu.cn/showproblem.php?pid=5011
Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)
Total Submission(s): 505 Accepted Submission(s): 386
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.
● 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.
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
1121 131 2 3
Sample Output
WinLoseLose
#include<stdio.h>int main(){int N,i,j,k,sum;while(scanf("%d",&N)!=EOF){for(i=0,sum=0;i<N;i++){scanf("%d",&k);sum^=k;}if(sum!=0)printf("Win\n");elseprintf("Lose\n");}return 0;}
0 0
- hdoj 5011 Game(基础尼姆博弈)
- HDOJ 2147 kiki's game(基础博弈)
- hdoj problem 5011Game(博弈论之尼姆博弈&&ACM模板)
- hdoj 5523 Game 【博弈】
- HDU 5011-Game(尼姆博弈)
- HDU 5011 Game(尼姆博弈)
- hdu 5011 Game【尼姆博弈】
- hdoj 1849 Rabbit and Grass(基础尼姆博弈)
- HDOJ 3951 Coin Game 博弈
- HDOJ Calendar Game 1079【博弈】
- (博弈)Fliping game--HDOJ
- hdoj博弈基础题
- hdoj 3951/ Coin Game (Albaba2011) 博弈
- hdoj 4203 Doubloon Game(博弈+找规律)
- HDOJ 3389 Game (博弈:Staircase Nim)
- HDOJ 4203 Doubloon Game 博弈 找规律
- HDOJ 1525 Euclid's Game 博弈
- HDOJ Brave Game(巴什博弈)
- C语言编译器不检查数组下标越界 困扰的很长时间
- 将System.out.println()打印的内容输出到文件
- Spring的事件处理
- MySQL数据类型
- 11.6 心得
- hdoj 5011 Game(基础尼姆博弈)
- C基础——指针
- 【C++】自我赋值问题
- 数据库查询:将查询列表列,拼成一条数据使用什么函数?
- lua学习笔记之类型和值
- 算法:归并算法的递归与非递归形式
- <黑客免杀攻防>第六章 壳在免杀中的应用 阅读笔记
- Eclipse开发Android程序如何在手机上运行
- RP导论