PROBLEM LINK:
DIFFICULTY:
CAKEWALK
PROBLEM:
Given three distinct integers S_A,S_B,S_C, the number of successful submissions to problems A,B,C respectively. Determine the hardest problem (the one with the least number of successful submissions).
EXPLANATION:
Do just as the problem states. If
-
C < A, B - output
Alice -
B < A,C - output
Bob - else output
Draw
TIME COMPLEXITY:
O(1) per test case.
SOLUTIONS:
Editorialist’s solution can be found here
Experimental: For evaluation purposes, please rate the editorial (1 being poor and 5 excellent)
- 1
- 2
- 3
- 4
- 5
0 voters