hdu 5011 Game 博弈
来源:互联网 发布:java接收安卓上传图片 编辑:程序博客网 时间:2024/06/05 00:24
这道题目以前做过,其实就是一个nim游戏
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 < 10 5) 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 a i beads in the i-th pile.
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 ai(ai < 231) 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
1121 131 2 3
Sample Output
WinLoseLose
#include<cstdio>#include<iostream>#include<algorithm>#include<cstring>using namespace std;int main(){ int n,m; while(~scanf("%d",&n)) { int ans=0; for(int i=1; i<=n; i++) { scanf("%d",&m); ans^=m; } if(ans==0) printf("Lose\n"); else printf("Win\n"); } return 0;}
不知道为什么这样可以水过去,但是根据尼姆博弈,下面的才是正确的(区域赛的题目也水吗,还是我不懂啊,求解释)。。。----->>>尼姆博弈点击打开链接
#include<iostream>#include<cstdio>#include<string.h>#include<algorithm>#define N 1000001using namespace std;int main(){ int n; while(~scanf("%d",&n)) { int s=0,ans=0; for(int i=0; i<n; i++) { int a; scanf("%d",&a); if(a%2==1) s++; ans^=a; } //printf("********%d %d\n",s,ans); if((ans==0&&s==0)||(ans!=0&&s>=1)) { printf("Win\n"); } if((ans!=0&&s==0)||(ans==0&&s>1)) printf("Lose\n"); } return 0;}
0 0
- HDU 5011-Game(博弈)
- HDU-5011 Game 博弈
- hdu 5011 Game(博弈)
- [博弈] hdu 5011 Game
- hdu 5011 Game 博弈
- HDU 5011-Game(博弈)
- HDU 5011 Game (博弈)
- HDU 5011 Game nim博弈
- HDU 5011 Game 【Nim博弈】
- HDU 5011 Game(Nim博弈)
- HDU 5011-Game(尼姆博弈)
- HDU 5011 Game(尼姆博弈)
- hdu 5011 Game【尼姆博弈】
- HDU 5011Game-多个堆的NIM博弈
- hdu 4701 Game----博弈
- HDU 3389 Game (博弈)
- hdu 3389 Game 博弈
- hdu 1846 Brave Game(博弈)
- 训练--最短路--01
- SQLSERVER中根据字符截取字符串
- mysql_connect()“No such file or directory”错误排除
- ERROR 1418 (HY000): This function has none of DETERMINISTIC, NO SQL, or READS SQL DATA...
- Spring学习 事务回滚
- hdu 5011 Game 博弈
- CSRF攻击2
- 深入理解java多态性
- Volley 设置setRetryPolicy中Retry 为0后 还出现重复连接的问题
- PCB分层及堆叠
- Android 和 ios都能够和javascript交互了!!!
- <IMG>标签的方方面面
- 正则:正则表达式在js中的高级应用
- 法雷数列浅谈