CHEF AND FRIENDS

CodeChefOpen on judge ↗

Problem description. Chef has M friends. He got N jars of chocolate with different amounts of chocolates in each of them. Now Chef wants to give each friend a sequential series of jars. He wants to minimise the maximum number of chocolates a friend gets. Can you help him out? Note: - All the jars must be distributed - The assignment of jars should be sequential. That means suppose a friend get

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