# HDU 3389 Game【Nim博弈变形】阶梯博弈

Bob and Alice are playing a new game. There are n boxes which have been numbered from 1 to n. Each box is either empty or contains several cards. Bob and Alice move the cards in turn. In each turn the corresponding player should choose a non-empty box A and choose another box B that B<A && (A+B)%2=1 && (A+B)%3=0. Then, take an arbitrary number (but not zero) of cards from box A to box B. The last one who can do a legal move wins. Alice is the first player. Please predict who will win the game.

Input

The first line contains an integer T (T<=100) indicating the number of test cases. The first line of each test case contains an integer n (1<=n<=10000). The second line has n integers which will not be bigger than 100. The i-th integer indicates the number of cards in the i-th box.

Output

For each test case, print the case number and the winner's name in a single line. Follow the format of the sample output.

Sample Input

2
2
1 2
7
1 3 3 2 2 1 2

Sample Output

Case 1: Alice
Case 2: Bob

1 3 4号盒子是不能够再转移卡片到其他盒子中去了的，其他盒子中的卡片经过若干步的转移最终也一定会转移到1 3 4号盒子中去。

import java.util.*;
import java.math.*;

public class Main{
static int maxn=(int)(1e5+10);

public static void main(String[] args) {
Scanner cin=new Scanner(System.in);
int T=cin.nextInt();
int ca=1;
while((T--)!=0) {
int n=cin.nextInt();
int ret=0;
for(int i=1;i<=n;i++) {
int x=cin.nextInt();
if(i%6==0||i%6==2||i%6==5)
ret^=x;
}
System.out.print("Case "+ ca++ +": ");
if(ret==0)
System.out.println("Bob");
else
System.out.println("Alice");
}
cin.close();
}
}


• 广告
• 抄袭
• 版权
• 政治
• 色情
• 无意义
• 其他

120