Birthday Party

CodeChefOpen on judge ↗

It is Harsh's Birthday party and he needs some help to distribute chocalates to people equally or with a lower bound. An Array $A$ denotes the number of chocolates initially ${ A[0]--A[1]--------A[n-1] }$ taken by n people. Now harsh has to give each person a certain number of chocolates from Array ${ B[0]--B[1]--------B[n-1] }$ such that each person gets at least k chocolates. You have to c

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