问题描述 |
---|
Alice and Bob is
playing a game. Each of them has a
number. Alice’s number is A, and Bob’s number is B. Each turn, one player
can do one of the following actions on his own number: 1. Flip: Flip the number. Suppose X = 123456 and
after flip, X = 654321 2. Divide. X = X/10. Attention all the numbers are
integer. For example X=123456 , after this action X become 12345(but not 12345.6). 0/10=0. Alice and Bob moves in
turn, Alice moves first. Alice can only modify A, Bob can only modify B. If A=B
after any player’s action, then Alice win. Otherwise the game keep going on! Alice wants to win the
game, but Bob will try his best to stop Alice.
Suppose Alice and Bob
are clever enough, now Alice wants to know whether she can win the game in
limited step or the game will never end. |
输入描述 |
First line contains an
integer T (1 ≤ T ≤ 10), represents there are T test cases.
For each test case:
Two number A and B. 0<=A,B <=10100000. |
输出描述 |
For each test case, if
Alice can win the game, output “Alice”. Otherwise output “Bob”. |
样例输入复制样例 |
4 11111 1 1 11111 12345 54321
123 123 |
样例输出 |
Alice Bob Alice
Alice |
提示说明 |
For the third sample,
Alice flip his number and win the game.
For the last sample,
A=B, so Alice win the game immediately even nobody take a move. |
来源 |
2017年第八届福建省大学生程序设计竞赛正式赛D |