Nim or not Nim? HDU - 3032 （Nim博弈变形）

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
Sample Output
Alice
Bob

题意：n堆石子，每次操作从任意一堆中取任意个（至少一个），或者把任意一堆石子变成更小的两堆。

思路：和原nim游戏其实差不多，只不过原nim游戏它每一堆的sg值就是它本身，这个题发生了一些变化，那么就找找规律，发现如果石子数k%4=1或者2的话，sg值就等于它本身，如果%4=3的话等于k+1，如果%4=0的话等于
k-1，那么将所有石子数的sg值异或起来看是否为0就行了

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
/*int sg[1005];
int get_sg(int x)
{
	if(sg[x]!=-1)
		return sg[x];
	int vis[1005];
	memset(vis,0,sizeof vis);
	for(int i=1;i<=x;i++)
		vis[get_sg(x-i)]=1;
	for(int i=1;i<=x/2;i++)
	{
		vis[get_sg(i)^get_sg(x-i)]=1;
	}
	for(int i=0;;i++)
		if(!vis[i])
			return sg[x]=i;
}
int main()
{
	memset(sg,-1,sizeof sg);
	get_sg(100);
	for(int i=1;i<=100;i++)
	{
		printf("sg[%d]: %d\n",i,sg[i]);
	}
	return 0;
 } */
 int main()
 {
 	int t;
 	cin>>t;
 	while(t--)
 	{
 		int n,ans=0;
 		cin>>n;
 		for(int i=0;i<n;i++)
 		{
 			int x;
 			scanf("%d",&x);
 			if(x%4==3)
 				ans^=(x+1);
 			else if(x%4==0)
 				ans^=(x-1);
 			else 	
 				ans^=x;
		 }
		 if(!ans)
		 	printf("Bob\n");
		else 
			printf("Alice\n");
	 }
 	return 0;
 }