Draicy & Momos
CodeChefOpen on judge ↗
Draicy enjoys momos and there are $N$ momo stalls at the Momo Carnival. He eats momos in an unusual way, only leaving $X$ momos at each stall. In theory, if a stall has $K$ momos, he will consume $K-X$ momos and leave $X$ momos behind. He must satiate his appetite $H$ at this carnival, which means he must eat **at least** $H$ momos. He's also thoughtful of his fellow momo lovers, so he tries to le
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