「POJ3480」John
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
|
1 2 3 4 5 |
2 3 3 5 1 1 1 |
Sample Output
|
1 2 |
John Brother |
anti-nim
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 |
#include<iostream> #include<cstdio> #include<cstring> using namespace std; int n,m,x; int main() { scanf("%d",&n); for(int i=1;i<=n;i++) { scanf("%d",&m); bool flag=0;int sg=0; for(int i=1;i<=m;i++) { scanf("%d",&x); sg^=x; if(x>1)flag=1; } if(!flag&&!sg)puts("John"); else if(flag&&sg)puts("John"); else puts("Brother"); } return 0; } |
OI 课件=>
