Nim or not Nim?

Time Limit: 2000/1000 MS
(Java/Others)    Memory Limit: 32768/32768 K
(Java/Others)
Total Submission(s): 858    Accepted
Submission(s): 412

Problem Description

Nim is a two-player mathematic game of strategy in
which players take turns removing objects from distinct heaps. On each turn, a
player must remove at least one object, and may remove any number of objects
provided they all come from the same heap.

Nim is usually played as a
misere game, in which the player to take the last object loses. Nim can also be
played as a normal play game, which means that the person who makes the last
move (i.e., who takes the last object) wins. This is called normal play because
most games follow this convention, even though Nim usually does
not.

Alice and Bob is tired of playing Nim under the standard rule, so
they make a difference by also allowing the player to separate one of the heaps
into two smaller ones. That is, each turn the player may either remove any
number of objects from a heap or separate a heap into two smaller ones, and the
one who takes the last object wins.

Input

Input contains multiple test cases. The first line is
an integer 1 ≤ T ≤ 100, the number of test cases. Each case begins with an
integer N, indicating the number of the heaps, the next line contains N integers
s[0], s[1], ...., s[N-1], representing heaps with s[0], s[1], ..., s[N-1]
objects respectively.(1 ≤ N ≤ 10^6, 1 ≤ S[i] ≤ 2^31 - 1)

Output

For each test case, output a line which contains
either "Alice" or "Bob", which is the winner of this game. Alice will play
first. You may asume they never make mistakes.

Sample Input

2

3

2 2 3

2

3 3

 1 #include<stdio.h>

 2 #include<string.h>

 3 #include<map>

 4 #include<math.h>

 5 #include<iostream>

 6 #include<algorithm>

 7 using namespace std;

 8

 9 int main()

10 {

11     int t,i,n,ans,j,x;

12     scanf("%d",&t);

13     for(i=1;i<=t;i++)

14     {

15         ans=0;

16         scanf("%d",&n);

17         for(j=0;j<n;j++)

18         {

19             scanf("%d",&x);

20             if(x%4==0)x--;

21             else if(x%4==3)x++;

22             ans^=x;

23         }

24         if(ans)

25             printf("Alice\n");

26             else printf("Bob\n");

27     }

28 }

Sample Output

Alice

Bob

Nim or not Nim? hdu3032 SG值打表找规律