【题解】LightOJ-1253 Misere Nim
Misere Nim(LightOJ-1253)
题面
Alice and Bob are playing game of Misère Nim. Misère Nim is a game playing on k piles of stones, each pile containing one or more stones. The players alternate turns and in each turn a player can select one of the piles and can remove as many stones from that pile unless the pile is empty. In each turn a player must remove at least one stone from any pile. Alice starts first. The player who removes the last stone loses the game.
输入
Input starts with an integer T (≤ 200), denoting the number of test cases.
Each case starts with a line containing an integer k (1 ≤ k ≤ 100). The next line contains k space separated integers denoting the number of stones in each pile. The number of stones in a pile lies in the range [1, 109].
输出
For each case, print the case number and 'Alice' if Alice wins otherwise print 'Bob'.
样例输入
1 | 3 |
样例输出
1 | Case 1: Bob |
提示
无
思路
Anti-Nim博弈,可以参见【题解】POJ-3480 John。
代码
1 | using namespace std; |