time limit per test:1s
memory limit per test：256MB
Alice and Bob are playing a game.
There are monsters in the game, and they stand in a line. Alice and Bob take turns. Each turn, the player can choose one of two actions:
Destroy a consecutive monster sequence of size less than or equal to . Note that you must destroy allall monsters in the continuous sequence of your choice.
Select consecutive monsters to destroy, and after destroying these monsters, the sequential monster sequence in which they were originally located must be divided into two non-empty sequences. The two remaining sequences will not be considered continuous.
Here is an example of operation , if and there are four monsters ABCD in the field. Now we can destroy monsters BC because they are continuous, and after destroying them we can be left with monsters AeeD ( ee means the area is empty). But we cannot destroy the monster AB or CD , because the remaining two sequences must be non-empty (in fact, if we do this, only one continuous sequence remains). Similarly, we can't destroy monsters AC or BD because monsters A and C are not continuous.
When a player cannot operate, he loses. Now, Alice will play the game first. She wants to know, can she win at this game?
An integer indicates that there are groups of data.
Next rows. Enter two integers and on each line.
Guarantee .
Output total lines.
If Alice can win, output "Alice", otherwise output "Bob".
2 2 2 2 3
Alice Bob
时间限制: 1s
内存限制：256MB
爱丽丝和鲍勃正在玩一个游戏。
游戏中有 个怪物，它们站成一排。爱丽丝和鲍勃轮流玩。每轮游戏中，玩家可以从以下两个操作中选择一个：
摧毁一个大小小于或等于 连续怪物序列。请注意，您必须摧毁您所选择的连续序列中的所有怪物。
选择 个连续的怪物进行摧毁，在摧毁这 个怪物后，必须将它们原来所在的连续怪物序列分成两个非空序列。剩下的两个序列将不被视为连续序列。
下面是操作 的一个示例，假设 ，场上有 ABCD 四个怪物。现在我们可以消灭怪物 BC ，因为它们是连续的，消灭它们后我们可以剩下怪物 AeeD（ee 表示该区域为空）。但我们不能消灭怪物 AB 或 CD ，因为剩下的两个序列必须是非空的（事实上，如果我们这样做，就只剩下一个连续序列了）。同样，我们也不能消灭怪物 AC 或 BD ，因为怪物 A 和 C 不是连续的。
一个整数 表示有 组数据。
接下来 行。每行输入两个整数 和 。
保证 .
输出行。 如果 Alice 能赢，则输出 "Alice"，否则输出 "Bob"。
2 2 2 2 3
Alice Bob
| 难度等级： | 0 |
| 总通过次数： | 1 |
| 总提交次数： | 35 |