标签:first ane win each opp ssi limit form content
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 4704 Accepted Submission(s): 2720
1 #include <bits/stdc++.h> 2 using namespace std; 3 4 int main() 5 { 6 int t; 7 int n; 8 int a; 9 int i; 10 int sum, ones; 11 12 scanf("%d", &t); 13 14 while (t--) { 15 scanf("%d", &n); 16 sum = 0, ones = 0; 17 for (i = 0; i < n; ++i) { 18 scanf("%d", &a); 19 sum ^= a; 20 if (a == 1) { 21 ++ones; 22 } 23 } 24 25 //win : t0, s1, s2 26 //lose : s0, t2 27 if (sum == 0) {//t 28 if (n - ones == 0) {//t0 29 printf("John\n"); 30 } else {//t2 31 printf("Brother\n"); 32 } 33 } else {//s 34 if (n - ones == 0) {//s0 35 printf("Brother\n"); 36 } else {//s1, s2 37 printf("John\n"); 38 } 39 } 40 } 41 42 return 0; 43 }
标签:first ane win each opp ssi limit form content
原文地址:http://www.cnblogs.com/bofengyu/p/6776304.html