BestdayCelebration
CodeChefOpen on judge ↗
It is Rohit's best day of life, he has made it to ICPC world finals, and in order to celebrate that he has $N$ candy boxes each of them contains a non-zero number of candies (between 1 and 1000000000). Rohit want to distribute these candies among his $K$ classmates. He want to distibute them in a way such that: 1. All students get equal number of candies. 2. All the candies which a student ge
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.
Sign in to chat with the tutor and save your progress.
Sign in to start