hdu-5011 Game
来源:互联网 发布:长春学历网络教育 编辑:程序博客网 时间:2024/06/05 11:00
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又是博弈,看着代码是尼姆博弈。。。但是对我这种很水的人来说,下次就不知道能不能做得出来了代码如下:大致就是求一个异或值#include<stdio.h>int main(){int a[100010];int n;while(~scanf("%d",&n)){int sum=0;for(int i=0;i<n;i++){scanf("%d",&a[i]);sum^=a[i];}if(sum) printf("Win\n");else 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
- hdu 5011 Game
- hdu 5011 Game 博弈
- HDU 5011-Game(博弈)
- HDU 5011 Game (博弈)
- HDU 5011 Game nim博弈
- hdu 5011——Game
- HDU—— 5011 Game
- HDU 5011 Game 【Nim博弈】
- Game HDU
- Game HDU
- ZooKeeper场景实践:(7) 分布式锁
- 小马哥经典摘抄语录之------成功秘诀
- 【笨木头Lua专栏】基础补充07:协同程序初探
- subversion版本控制
- 新浪SAE云用python和web.py连接数据库的问题
- hdu-5011 Game
- 寻找N以内的素数(《编程珠玑(续)》第1章)
- 【笨木头Lua专栏】基础补充08:协同程序之resume-yield间的数据返回
- 汇编-ASCⅡ码转二进制码
- shared_ptr线程安全性分析
- unity3D一些教程
- angularjs $scope.$apply()
- Socket使用大全
- HashMap与ConcurrentHashMap的区别