POJ 2234 Matches Game/hdu 1907 John(尼姆博奕中取完胜与取完负的模板)

Matches Game

Time Limit: 1000MS		Memory Limit: 65536K
Total Submissions: 9535		Accepted: 5529

Description

Here is a simple game. In this game, there are several piles of matches and two players. The two player play in turn. In each turn, one can choose a pile and take away arbitrary number of matches from the pile (Of course the number of matches, which is taken away, cannot be zero and cannot be larger than the number of matches in the chosen pile). If after a player’s turn, there is no match left, the player is the winner. Suppose that the two players are all very clear. Your job is to tell whether the player who plays first can win the game or not.

Input

The input consists of several lines, and in each line there is a test case. At the beginning of a line, there is an integer M (1 <= M <=20), which is the number of piles. Then comes M positive integers, which are not larger than 10000000. These M integers represent the number of matches in each pile.

Output

For each test case, output "Yes" in a single line, if the player who play first will win, otherwise output "No".

Sample Input

2 45 45
3 3 6 9

Sample Output

No
Yes

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define N 50
int a[N];
int main()
{
    int T,n;
    while(~scanf("%d",&n))
    {
        for(int i=1; i<=n; i++)
            scanf("%d",&a[i]);
        int ans=0;
        for(int i=1; i<=n; i++)
            ans=ans^a[i];
        if(!ans) printf("No\n");
        else printf("Yes\n");
    }
    return 0;
}

John

Time Limit: 5000/1000 MS (Java/Others)    Memory Limit: 65535/32768 K (Java/Others)
Total Submission(s): 4108    Accepted Submission(s): 2337

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.

 

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

  
  

   
   2
3
3 5 1
1
1
  
  

 

Sample Output

  
  

   
   John
Brother
  
  
  
  


  
  

代码：

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define N 50
int a[N];
int main()
{
    int T,n;
    scanf("%d",&T);
    while(T--)
    {
        int ans=0,flag=0;
        scanf("%d",&n);
        for(int i=1; i<=n; i++)
            {
                scanf("%d",&a[i]);
                ans^=a[i];
                if(a[i]>1) flag=1;
            }
        if((!ans&&flag)||(ans&&!flag)) printf("Brother\n");
        else printf("John\n");
    }
    return 0;
}