Examination Conundrum

CodeChefOpen on judge ↗

Chef is a procrastinator. His examinations are near and he hasn't studied anything yet. He hopes that he can complete the syllabus one day before the examination by binge-watching the lecture videos. There are $N$ lecture videos that have to be watched in order to complete the syllabus. The length of $i$-th lecture is $L_i$ minutes for $i = 1, 2, ..., N$. Chef is so good at procrastination that he

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