CHEF AND CHOCOLATES

CodeChefOpen on judge ↗

Chef had two bags of chocolates, the first of these bags contains x (x >= 1) chocolates, and the second — y (y >= 1) chocolates. Unfortunately, Chef lost the first bag of chocolates (it contains x chocolates). Chef remembers that the total amount of chocolates (x + y) in the two bags, firstly, was not gerater than n, and, secondly, was divisible by k. Help Chef to determine how many chocolates

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