Partitioning Game （SG函数）

 

原题目：

Alice and Bob are playing a strange game. The rules of the game are:

1. Initially there are n piles.
2. A pile is formed by some cells.
3. Alice starts the game and they alternate turns.
4. In each tern a player can pick any pile and divide it into two unequal piles.
5. If a player cannot do so, he/she loses the game.

Now you are given the number of cells in each of the piles, you have to find the winner of the game if both of them play optimally.

Input

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

Each case starts with a line containing an integer n (1 ≤ n ≤ 100). The next line contains n integers, where the ith integer denotes the number of cells in the ith pile. You can assume that the number of cells in each pile is between 1 and 10000.

Output

For each case, print the case number and 'Alice' or 'Bob' depending on the winner of the game.

Sample Input

3

1

4

3

1 2 3

1

7

Sample Output

Case 1: Bob

Case 2: Alice

Case 3: Bob

 

中文概要：

几堆石头，可以拿选一堆石头拿一个以上的石头数，或者将这一堆分成两堆，问最后谁赢

SG函数，对于每一堆石头，后继状态有{1,n-1},{2,n-2}，.....然后直接算SG函数就行了

#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
const int maxn=1e5+7;
bool vis[maxn];
int SG[maxn];
void getSG(int n)
{
    for(int i=1;i<=n;i++)
    {
        memset(vis,false,sizeof(vis));
        for(int j=1;j*2<i;j++)
        {
            if(i!=j*2)
            {
                vis[SG[j]^SG[i-j]]=true;
            }
        }
        for(int j=0;j<10001;j++)
        {
            if(!vis[j])
            {
                SG[i]=j;
                break;
            }
        }
    }
    return;
}
int main()
{
    int test;
    scanf("%d",&test);
    getSG(10000);
    for(int cas=1;cas<=test;cas++)
    {
        int n;
        scanf("%d",&n);
        int ans=0;
        for(int i=1;i<=n;i++)
        {
            int x;
            scanf("%d",&x);
            ans^=SG[x];
        }
        if(ans==0) printf("Case %d: Bob\n",cas);
        else printf("Case %d: Alice\n",cas);
    }
    return 0;
}

上面第一个函数就是求SG函数的模板