B - Misere Nim 变式nim（LightOJ 1253）

Alice and Bob are playing game of Misère Nim. Misère Nim is a game playing on k piles of stones, each pile containing one or more stones. The players alternate turns and in each turn a player can select one of the piles and can remove as many stones from that pile unless the pile is empty. In each turn a player must remove at least one stone from any pile. Alice starts first. The player who removes the last stone loses the game.

Input

Input starts with an integer T (≤ 200), denoting the number of test cases.

Each case starts with a line containing an integer k (1 ≤ k ≤ 100). The next line contains k space separated integers denoting the number of stones in each pile. The number of stones in a pile lies in the range [1, 10⁹].

Output

For each case, print the case number and 'Alice' if Alice wins otherwise print 'Bob'.

Sample Input

3

4

2 3 4 5

5

1 1 2 4 10

1

1

Sample Output

Case 1: Bob

Case 2: Alice

#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <string.h>
#include <math.h>
using namespace std;
int main()
{
  int t;
  cin>>t;
  for(int i=1;i<=t;i++)
  {
      int m,a;
      cin>>m;
      int ans=0,f=0;
      for(int j=0;j<m;j++)
      {
        cin>>a;
        if(a!=1)
            f=1;
          ans^=a;
      }
      if(f)
        if(ans)
                printf("Case %d: Alice\n",i);
                else
                     printf("Case %d: Bob\n",i);
      else
        if(m%2==0)
                printf("Case %d: Alice\n",i);
                else
                     printf("Case %d: Bob\n",i);
  }
    return 0;
}

Case 3: Bob

变相的nim博弈，最后拿的那个输，先判断是不是全为1，若是，奇数堆则先手输偶数堆先手胜；若不是全为1，则异或，得0后者胜。