1005 game-博弈
来源:互联网 发布:男装破洞牛仔裤淘宝网 编辑:程序博客网 时间:2024/05/07 20:30
Game
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 0 Accepted Submission(s): 0
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.
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.
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 <iostream>#include <cstdio>using namespace std;int main(){ int n; __int64 a[100005]; while(scanf("%d",&n)!=EOF){for(int i=0;i<n;i++){scanf("%I64d",&a[i]);}if(n==1){printf("Win\n");}else{ __int64 sum=0; for(int i=0;i<n;i++)sum=sum^a[i]; if(sum==0) printf("Lose\n"); elseprintf("Win\n");}} return 0;}
0 0
- 1005 game-博弈
- game--博弈
- Northcott Game + 博弈 + nim博弈
- Game Theory: 公平博弈
- 2234-Matches Game-博弈
- HDU1846 Brave Game 博弈
- HDU_3389 Game 博弈
- Brave Game + 博弈
- Northcott Game + nim博弈
- Play a game + 博弈
- A Multiplication Game + 博弈
- hdu 4701 Game----博弈
- zoj 2290 GAME 博弈
- HDU 3389 Game (博弈)
- hdu3389 Game NIM博弈
- hdu1846Brave Game (博弈)
- UVa11489 - Integer Game(博弈)
- UVA 11249 - Game(博弈)
- MyEclipse 2013_新建javaWeb 项目, Servlet不能访问 问题
- 数据库的事务处理必须满足ACID原则,ACID分别是指什么
- 大数据时代的企业管理——读《量化》的随手札记
- hibernate中的一些方言的写法
- [LeetCode] Word Search
- 1005 game-博弈
- POJ1000
- 顺序队列
- js中prototype方法
- nyoj218 Dinner
- UNIX 高手的 10 个习惯
- 网络流量监控技术与方法
- jbpm 中一个 开始就会遇到的错误
- iOS页面跳转及数据传递