Chef and Candies

CodeChefRating 570Open on judge ↗

There are $N$ children and Chef wants to give them $1$ candy each. Chef already has $X$ candies with him. To buy the rest, he visits a candy shop. In the shop, packets containing **exactly** $4$ candies are available. Determine the **minimum** number of candy packets Chef must buy so that he is able to give $1$ candy to each of the $N$ children. ### Input - The first line of input will contain a

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