Nim or not Nim?
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2012 Accepted Submission(s): 1044
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.
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
题目大意:
有n堆石子,每次可以选择两种操作中的一种。
(1)从其中一堆中取走任意多个石子。
(2)将其中一堆分成两堆。
可以证明这种分成两堆的,就是将当前局面分割成子局面的情况是也可以用sg函数来求解的。假设有3个棋子将其分成(1,2)那么(1,2)这个局面的sg=sg(1)^sg(2)
但是这个题目的范围显然不支持sg函数这种暴力做法,所以我们就需要打表找规律啦。
x%4==0 sg[x]=x-1
x%4==3 sg[x]=x+1
x%4==1||x%4==2 sg[x]=x
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int n;
int get_sg(int x)
{
if (!x) return 0;
if (x%4==1||x%4==2) return x;
if (x%4==3) return x+1;
if (!(x%4)) return x-1;
}
int main()
{
int T;
scanf("%d",&T);
for (int t=1;t<=T;t++) {
scanf("%d",&n);
int ans=0;
for (int i=1;i<=n;i++) {
int x; scanf("%d",&x);
ans^=get_sg(x);
}
if (ans) printf("Alice\n");
else printf("Bob\n");
}
}