Robin and Gold coins

CodeChefOpen on judge ↗

A thief named 'Robin' stole X amount of gold coins from a millionare and was escaping from the cops. During his escape he ran through N cities (numbered from 1 to N) . He knew that his gold would be gone if he was caught by the cops. So he dicided to hide his gold coins at each of the N cities. If he were to hide coins, at each of the N cities, find the minimum length he had to travel so that he h

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