John
来源:互联网 发布:java byte 转base64 编辑:程序博客网 时间:2024/06/10 20:12
John
Time Limit : 5000/1000ms (Java/Other) Memory Limit : 65535/32768K (Java/Other)
Total Submission(s) : 66 Accepted Submission(s) : 31
Problem 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.
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
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
233 5 111
Sample Output
JohnBrother
Source
Southeastern Europe 2007
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;int main(){ int t, n, a, sum, flag; scanf("%d", &t); while (t--) { scanf("%d", &n); sum = 0; flag = 0; for (int i = 1; i <= n; i++) { scanf("%d", &a); sum = sum^a; if (a > 1)flag = 1; } if (flag == 0) { if (n % 2 == 0) printf("John\n"); else printf("Brother\n"); } else if (sum == 0) printf("Brother\n"); else printf("John\n"); } return 0;}
0 0
- John
- John
- John
- John
- John Carmack
- 《John Q》
- John感悟
- John感悟
- 【HDU1097】John
- HDU1907-John
- hdu1907 John
- John Keats
- 【poj3480】John
- hdu1907 John
- 1907 John
- hdu1907 John
- Professor John
- 关于John Carmack
- Northcott Game
- PHP vs node.js: 真正的评测数据
- 动态库的链接和链接选项-L,-rpath-link,-rpath
- Being a Good Boy in Spring Festival
- HBase概念学习(十)HBase与MongDB等NoSQL数据库对比
- John
- S-Nim
- Stone Game
- [转]winXP 完全退出VMware方法
- Fibonacci again and again
- Win7系统下Jenkins Plugin开发过程和问题解决
- unity3d c# error CS0052解决方法
- Struts2安全漏洞
- UVA 514 - Rails(模拟)