← All problemsSign in

Lazy Chef

CodeChefRating 801Open on judge ↗

Chef is a very lazy person. Whatever work is supposed to be finished in $x$ units of time, he finishes it in $m * x$ units of time. But there is always a limit to laziness, so he delays the work by at max $d$ units of time. Given $x, m, d$, find the maximum time taken by Chef to complete the work. ### Input - First line will contain $T$, number of testcases. Then the testcases follow. - Each tes

HINT LADDERno hints yet
L1 Observation
L2 Technique
L3 Approach
L4 Pseudo-code
🔒
L5 Full solution
L5 unlocks only if you insist twice
solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI

Sign in to chat with the tutor and save your progress.

Sign in to start