Remainder Game
You cannot submit for this problem because the contest is ended. You can click "Open in Problem Set" to view this problem in normal mode.
Time Limit: 1.0 s
Memory Limit: 128.0 MB
Description
Alice and Bob are two very good friends. One day, while going to school, they started playing a
game called "Remainder Game." Each of them chose different Divisors, Dividends, and
Quotients in sequence.
- Alice chose 'a', 'b', 'c'
- Bob chose 'd', 'e', 'f'
According to the "Remainder Game Rules," the player with the Greater remainder will be
declared the winner. Both of them are determined to win the game.
For clarity, here are the definitions of the key terms:
Dividend: The number that is being divided.
Divisor: The number by which the dividend is divided.
Quotient: The result of the division when the divisor divides the dividend (ignoring the remainder).
Remainder: The part left over after dividing the dividend by the divisor.
Input
- a,b,c - Alice values
- d,e,f - Bob values
- 1≤a,b,c,d,e,f≤\(10^6\)
Output
- Print "Alice" if Alice wins.
- Print "Bob" if Bob wins.
- If both have the same remainder, print "Draw".
Sample
Input | Output |
---|---|
|
|
|
|
|
|
Lu IEEE testing round
- Status
- Done
- Rule
- ACM/ICPC
- Problem
- 8
- Start at
- 2025-02-23 08:15
- End at
- 2025-02-26 04:15
- Duration
- 68.0 hour(s)
- Host
- Partic.
- 8