hdu5011 Game
来源:互联网 发布:tcl电视软件升级 编辑:程序博客网 时间:2024/06/04 20:50
Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 253 Accepted Submission(s): 195
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
WinLoseLoseNIM 博弈论,还没彻底搞懂这个神奇的解法 ,当时看到一下子一片AC,原来是他们做过的#include<iostream>using namespace std;int main(void){int n,j,k;while(cin>>n){ j=0;for(int i=0;i<n;i++) { cin>>k; j ^=k;}if(j) cout<<"Win"<<endl;else cout<<"Lose"<<endl; }}
0 0
- hdu5011 Game
- hdu5011 Game
- HDU5011-Game(博弈)
- HDU5011:Game(博弈)
- HDU5011 Game(尼姆博奕)
- HDU5011 Game(Nim博弈)
- HDU5011 Game(Nim博弈)
- hdu5011 西安邀请赛E题 Game 博弈论
- HDU5011-Game-西安赛区网络赛-博弈论-水题
- hdu5011(Nim博弈)
- HDU5011 尼姆博奕模板水
- hdu5011(Nim游戏变形+证明)
- game
- game
- game
- game...
- Game
- Game
- 取得datalist中所选取的项目的id值
- [IIS] 不能加载类型System.ServiceModel.Activation.HttpModule
- Ehcache缓存配置
- 【google apec 2015 1b】 problem c: Card Game 三连扑克消除 DP
- LungoJS框架学习笔记——导航菜单
- hdu5011 Game
- js中节点的类型
- python list添加
- ubuntu mysql 编码
- 'Icon already includes gloss effects' doesn't work on iOS 6 compiled on xCode 5 with SDK 7
- Ehcache Storage Options
- 深入理解java虚拟机笔记:高效并发
- TIM_OCMode_Timing TIM_OCMode_Toggle 含义
- Spring和Struts的区别?