anti-nim博弈

首先要懂正向的。  这儿有个比较好的正向讲解，表示贡上 点击打开链接

1）所有石子堆的数目都为1：
    显然，若有偶数堆石子堆，则必胜，否则必败。

2）如果恰好只有一堆石子数目大于1。
    我们可以把这堆石子取完或者取得只剩下1，使得只剩下奇数堆数目为1的石子留给对方，由1)，必胜。

3）如果有至少2堆石子的数目大于1。
    考虑⊕值：
    若⊕值不为0，则按照NimGame走法取石。这样，当对手某次取完石子后，肯定会出现2）的情况，则必胜。

按照NimGame法则取完石子后，必定会给对手留下⊕值为0的局面。因此不可能给对手留下2）的局面（容易证明，2）局面的⊕值肯定不为0），而对手一次最多将一堆石子数大于1的石子堆处理掉。因此2）的情况肯定会出现。

相反，若⊕值为0，则无论如何走都会给对方留下2）或3）的情况，必败。

这儿有个模板题 poj  3480

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 A_i, separated by spaces – amount of M&Ms of i-th color.

Constraints:
1 <= T <= 474,
1 <= N <= 47,
1 <= A_i <= 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

题意nim找先拿到最后个的为输

自己ac代码

  
  

   
   #include<stdio.h>
#include<iostream>
#include<string.h>
#define N 2005
int main()
{  int n, m,i,T;
scanf("%d",&T);
while(T--)
{
 scanf("%d",&n);
 int sg = 0;
 bool flag = false;
 for (i = 0; i <n; i++)
 {
  int a;
  scanf("%d",&a);
  sg = sg^a;
  if (a > 1)
  {
   flag = true;
  }
 }
 if ((sg&&flag==true)||(flag==false&&n%2==0))printf("John\n");
 else  printf("Brother\n");
  
  
  
  


  
  
  
  

   
   }
 return 0;
}