POJ 2234 Matches Game/hdu 1907 John(尼姆博奕中取完胜与取完负)
来源:互联网 发布:深圳淘宝化妆品销售 编辑:程序博客网 时间:2024/04/30 11:09
Description
Here is a simple game. In this game, there are several piles of matches and two players. The two player play in turn. In each turn, one can choose a pile and take away arbitrary number of matches from the pile (Of course the number of matches, which is taken away, cannot be zero and cannot be larger than the number of matches in the chosen pile). If after a player’s turn, there is no match left, the player is the winner. Suppose that the two players are all very clear. Your job is to tell whether the player who plays first can win the game or not.
Input
The input consists of several lines, and in each line there is a test case. At the beginning of a line, there is an integer M (1 <= M <=20), which is the number of piles. Then comes M positive integers, which are not larger than 10000000. These M integers represent the number of matches in each pile.
Output
For each test case, output “Yes” in a single line, if the player who play first will win, otherwise output “No”.
Sample Input
2 45 45
3 3 6 9
Sample Output
No
Yes
取完胜。
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int main(){ int n; int a[22]; while(scanf("%d",&n)!=EOF){ int out=0; for(int i=1;i<=n;i++){ scanf("%d",&a[i]); out^=a[i]; } if(out==0) printf("No\n"); else printf("Yes\n"); } return 0;}
Description
Little John is playing very funny game with his younger brother. There is one big box filled with M&Ms of different colors. At first John has to eat several M&Ms of the same color. Then his opponent has to make a turn. And so on. Please note that each player has to eat at least one M&M during his turn. If John (or his brother) will eat the last M&M from the box he will be considered as a looser and he will have to buy a new candy box.
Both of players are using optimal game strategy. John starts first always. You will be given information about M&Ms and your task is to determine a winner of such a beautiful game.
Input
The first line of input will contain a single integer T – the number of test cases. Next T pairs of lines will describe tests in a following format. The first line of each test will contain an integer N – the amount of different M&M colors in a box. Next line will contain N integers Ai, separated by spaces – amount of M&Ms of i-th color.
Constraints:
1 <= T <= 474,
1 <= N <= 47,
1 <= Ai <= 4747
Output
Output T lines each of them containing information about game winner. Print “John” if John will win the game or “Brother” in other case.
Sample Input
2
3
3 5 1
1
1
Sample Output
John
Brother
取完负
#include<cstdio>#include<cstring>#include<algorithm>#include<cmath>using namespace std;int main(){ int t; scanf("%d",&t); while(t--){ int n; scanf("%d",&n); int ans=0; int flag=0; for(int i=0;i<n;i++){ int x; scanf("%d",&x); ans^=x; if(x>1) flag=1; } if((ans&&!flag)||(!ans&&flag)) printf("Brother\n"); else printf("John\n"); } return 0;}
- POJ 2234 Matches Game/hdu 1907 John(尼姆博奕中取完胜与取完负的模板)
- POJ 2234 Matches Game/hdu 1907 John(尼姆博奕中取完胜与取完负)
- POJ-2234:Matches Game
- POJ-2234-Matches Game
- poj 2234 matches game
- POJ 2234 Matches Game
- 【poj 2234】Matches Game
- POJ-2234:Matches Game
- poj 2234 Matches Game
- POJ 2234 Matches Game
- poj 2234 Matches Game (博弈)
- [博弈]POJ 2234 Matches Game
- POJ 2234 Matches Game(博弈论)
- POJ 2234 Matches Game(博弈)
- POJ 2234 Matches Game 笔记
- POJ 2234 Matches Game 博弈论
- HDU 1907 John ( Nim Game )
- HDU 1907 John(Nim game)
- Linux环境搭建
- js基础学习之--BOM基础知识总结
- 改善java程序之类、对象及方法
- linux 操作系统中压缩与解压缩命令的使用
- Openstack 中的消息总线 & AMQP
- POJ 2234 Matches Game/hdu 1907 John(尼姆博奕中取完胜与取完负)
- jquery利用attr、prop方法获取、设置input的checked属性
- Android群英传之Android控件架构与自定义控件
- c语言程序结构,全局变量,局部变量
- Hibernate-----Hibernate常用主键生成策略
- 多种方法实现费波纳契数列
- Android Studio 如何使用Service 的AIDL
- 算法(1)
- 在华为实习的日子