← All problemsSign in

Round 1 Confusion

Hey congratulate you all for qualified upto final Round, but this is not the end, final round it still remaining for that you need to crack some more problems. So here we go. Our team is in confusion that how to work efficiect in given period of time. There are total $N$ paper's out of which $X$ are already checked and there are total $K$ crew members to check the paper's. But now we want to div

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