Anokha

CodeChefOpen on judge ↗

Its Anokha time and everybody is busy! Especially, the Registrations team. They are given a server that runs some tasks on a first come, first serve basis. Each day, these tasks can run for atmost N minutes. When given the time for each task, calculate how many tasks can be finished today. Example: N=180 and tasks take 45,30,20,55,80 and 20 minutes respectively. Then only first four tasks can be

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