Cake Baking

CodeChefRating 339Open on judge ↗

Chef knows $N$ customers will come to his bakery today, and so he has baked $M$ cakes ($M \ge N$). Every customer needs at least one cake, otherwise they will for sure be unhappy. Further, if a customer is able to buy **two** or more cakes, then they will be happy. Chef wants to maximize the number of happy customers while not having any unhappy customers. What is the maximum possible happy cus

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