| Submit | All submissions | Best solutions | Back to list |
|
Problem hidden
EVNOD - Stone tumi kar |
Alice and Bob decide to play with stone. A box Contain N stone.
Each will take a stone at a time. You need to determine who will take the last stone if Alice start the game.
Input
First line contains one integer T denotes the number of testcase.
Then the following T(1<=T<=1000) lines contains an integer N (2<=N<=10^9) - number of stones.
Output
Output the name of winner of the game.
Example
Input:
2
1
2
Output:
Alice
Bob
Problem Setter : Murad Al WAjed (Dept. of CSE)
Bangladesh University of Business and Technology(BUBT)
Alice and Bob decide to play with stone. A box Contain N stone.
Each will take a stone at a time. You need to determine who will take the last stone if Alice start the game.
Input
First line contains one integer T denotes the number of testcase.
Then the following T(1<=T<=1000) lines contains an integer N (2<=N<=10^9) - number of stones.
Output
Output the name of winner of the game.
Example
Input:
2
1
2
Output:
Alice
Bob
Problem Setter : Murad Al WAjed (Dept. of CSE)
Bangladesh University of Business and Technology(BUBT)
| Added by: | Murad |
| Date: | 2016-05-03 |
| Time limit: | 1s |
| Source limit: | 50000B |
| Memory limit: | 1536MB |
| Cluster: | Cube (Intel G860) |
| Languages: | All except: ASM64 GOSU JS-MONKEY |
RSS