hdu 3032 Nim or not Nim? （一言不合就打表）

                          Nim or not Nim?

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

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

Sample Output

Alice
Bob

Source
2009 Multi-University Training Contest 13 - Host by HIT

也是一道多校的题，今年的多校也出了一道很是相似的题，只是把题中的一拆二，变成了一拆三。道理就是一样的。打表找规律。。。
打表代码：

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#define MEM(a,x) memset(a,x,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int sg[100];
int mex(set<int>& s)
{
    int a = 0;
    while(s.count(a)) a++;
    return a;
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    MEM(sg, 0);
    sg[0] = 0;
    sg[1] = 1;
    for(int i = 2; i < 20; i++)
    {
        set<int> s;
        for(int j = 1; j < i; j++)
            s.insert(sg[j]^sg[i-j]);
        for(int j = 0; j < i; j++)
            s.insert(sg[j]);
        sg[i] = mex(s);
    }
    for(int i = 0; i < 20; i++)
        cout << i << " ," << sg[i] << endl;
    return 0;
}

运行结果 为：
0 ，0
1 ，1
2 ，2
3 ，4
4 ，3
5 ，5
6 ，6
7 ，8
8 ，7
。。。
小学生的找规律题。
AC代码：

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <iostream>
#include <algorithm>
#define MEM(a,x) memset(a,x,sizeof(a))
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
int sg(int x)
{
    if(x % 4 == 3) return x+1;
    if(x % 4 == 0) return x-1;
    return x;
}
int main()
{
    //freopen("in.txt","r",stdin);
    //freopen("out.txt","w",stdout);
    int t;
    cin >> t;
    while(t--)
    {
        int n;
        cin >> n;
        ll ans = 0;
        for(int i = 0; i < n; i++)
        {
            ll a;
            cin >> a;
            ans ^= sg(a);
        }
        puts(ans == 0 ? "Bob": "Alice");
    }
    return 0;
}