Problem E. Game
时间限制 1000 ms
内存限制 32 MB
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.
输入数据
输出数据
For each test case, print the case number and the winner's name in a single line. Follow the format of the sample output.
样例输入
复制
2
2
1 2
7
1 3 3 2 2 1 2
样例输出
复制
Case 1: Alice
Case 2: Bob
$ Mathjax font initiator $