PROBLEM LINK:
Contest Division 1
Contest Division 2
Contest Division 3
Contest Division 4
Setter: Lavish Gupta
Tester: Nishank Suresh, Utkarsh Gupta
Editorialist: Pratiyush Mishra
DIFFICULTY:
To be Calculated
PREREQUISITES:
None
PROBLEM:
Chef is fond of burgers and decided to make as many burgers as possible.
Chef has A patties and B buns. To make 1 burger, Chef needs 1 patty and 1 bun.
Find the maximum number of burgers that Chef can make.
EXPLANATION:
Since each burger requires 1 patty and 1 bun, therefore the number of burgers that can be made would be the minimum of the two, i.e minimum of A and B.
Thus
ans = min(A,B)
TIME COMPLEXITY:
O(1), for each test case.
SOLUTION:
Editorialist’s Solution
Tester1’s Solution
Tester2’s Solution