hdu5011Game
来源:互联网 发布:电视盒直播软件 编辑:程序博客网 时间:2024/06/06 05:04
Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 493 Accepted Submission(s): 380
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,k;int a;while(scanf("%d",&n)!=EOF){k=0;for(i=0;i<n;i++){scanf("%d",&a);k^=a;}printf(k?"Win\n":"Lose\n");}return 0;}
思路:
一道纯粹的Nim博弈题,题中的可以再选择分开剩余的珠子,是没有影响的,可以选择忽视这一条件!
0 1
- hdu5011Game
- hdu5011Game nim博弈
- 中文 iOS/Mac 开发博客列表
- sql语句执行顺序
- HDU 3128 What is the air speed velocity…(数学)
- vector的reserve和resize
- UVALive_6284_Hyperdrome(可重排回文子串数+hash)
- hdu5011Game
- Android 手电筒(最强适配版)
- Android checkCallingPermission()方法返回值问题
- UVA - 10405 Longest Common Subsequence
- Objective-C 的“多继承”
- glob获取相关路径
- 数据处理DAO
- QT对话框中show和exec的区别
- 不喜欢做技术该怎么办