Hardest Problem Bet Problem Code: HARDBET Codechef Solutions
Hardest Problem Bet Problem Code: HARDBET
There are problems in a contest namely respectively. Alice bets Bob that problem is the hardest while Bob says that problem will be the hardest.
You are given three integers which denotes the number of successful submissions of the problems respectively. It is guaranteed that each problem has a different number of submissions. Determine who wins the bet.
1) If Alice wins the bet (i.e. problem is the hardest), then output .
2) If Bob wins the bet (i.e. problem is the hardest), then output .
3) If no one wins the bet (i.e. problem is the hardest), then output .
Note: The hardest problem is the problem with the least number of successful submissions.
Input Format
- The first line of input contains a single integer denoting the number of test cases. The description of test cases follows.
- The first and only line of each test case contains three space-separated integers , denoting the number of successful submissions of problems respectively.
Output Format
For each test case, output the winner of the bet or print Draw in case no one wins the bet.
Constraints
- are all distinct.
Sample Input 1
3
1 4 2
16 8 10
14 15 9
Sample Output 1
Draw
Bob
Alice
Explanation
Test case : Problem turns out to be the hardest so no one wins the bet.
Test case : Problem turns out to be the hardest so Bob wins the bet.
Test case : Problem turns out to be the hardest so Alice wins the bet.
Comments
Post a Comment