Hello 2024 |
---|
Finished |
Alice and Bob are bored, so they decide to play a game with their wallets. Alice has $$$a$$$ coins in her wallet, while Bob has $$$b$$$ coins in his wallet.
Both players take turns playing, with Alice making the first move. In each turn, the player will perform the following steps in order:
The player who cannot make a valid move on their turn loses. If both Alice and Bob play optimally, determine who will win the game.
Each test contains multiple test cases. The first line contains a single integer $$$t$$$ ($$$1 \leq t \leq 1000$$$) — the number of test cases. The description of the test cases follows.
The first and only line of each test case contains two integers $$$a$$$ and $$$b$$$ ($$$1 \le a, b \le 10^9$$$) — the number of coins in Alice's and Bob's wallets, respectively.
For each test case, output "Alice" if Alice will win the game, and "Bob" if Bob will win the game.
101 11 45 34 511 983 911032 9307839204 72811000000000 100000000053110 2024
Bob Alice Bob Alice Bob Bob Alice Alice Bob Bob
In the first test case, an example of the game is shown below:
In the second test case, an example of the game is shown below:
Name |
---|