E - K BOXES

CodeChefOpen on judge ↗

The chef is very happy as tomorrow is his best friend's birthday. Chef wants to gift him $N$ number of presents but his friend doesn't like more than $K$ number of presents, So the chef has to put these $N$ presents into $K$ New Boxes. Every present has some value. $\text{ The chef must fulfill these conditions and put these $N$ presents in $K$ new boxes.}$ - Any $m$ number of consecutive pres

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