HDU1907 Jhon

标签：constrain   hide   show   ||   ima   include   ring   hid   rom   

InputThe 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 

OutputOutput 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
题解：考虑多个1的情况
参考代码：

 1 #include<bits/stdc++.h>
 2 using namespace std;
 3 int T,n,ans,x,num; 
 4 
 5 int main()
 6 {
 7     scanf("%d",&T);
 8     while(T--)
 9     {
10         scanf("%d",&n);ans=num=0;
11         for(int i=1;i<=n;++i) {scanf("%d",&x);ans^=x;if(x>1) num++;}
12         if((!ans&&num>1) || (ans&&!num)) puts("Brother");
13         else puts("John");
14      } 
15     
16     return 0;
17 }

View Code

HDU1907 Jhon

标签：constrain   hide   show   ||   ima   include   ring   hid   rom   

原文地址：https://www.cnblogs.com/songorz/p/10331521.html