HDU-1907 John
http://acm.hdu.edu.cn/showproblem.php?pid=1907
John
Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 65535/32768 K (Java/Others) Total Submission(s): 2385 Accepted Submission(s): 1289
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.
Constraints: 1 <= T <= 474, 1 <= N <= 47, 1 <= Ai <= 4747
1 #include<iostream> 2 #include<algorithm> 3 using namespace std; 4 int main() 5 { 6 int t,n,i,a[50]; 7 int temp,ans; 8 scanf("%d",&t); 9 while(t--) 10 { 11 temp=0; 12 ans=-1; 13 scanf("%d",&n); 14 for(i=0;i<n;i++) 15 { 16 scanf("%d",&a[i]); 17 if(i==0) 18 ans=a[i]; 19 else 20 ans=ans^a[i]; 21 if(a[i]>1) 22 temp=1; 23 } 24 if(temp==0) 25 { 26 if(n%2==1) 27 printf("Brother\n"); 28 else 29 printf("John\n"); 30 } 31 else 32 { 33 if(ans==0) 34 printf("Brother\n"); 35 else 36 printf("John\n"); 37 38 } 39 } 40 return 0; 41 }
郑重声明:本站内容如果来自互联网及其他传播媒体,其版权均属原媒体及文章作者所有。转载目的在于传递更多信息及用于网络分享,并不代表本站赞同其观点和对其真实性负责,也不构成任何其他建议。