TREASURE HUNT

CodeChefOpen on judge ↗

Chef and his friend have found treasure in the garden, in which coins are represented in form of an array $coins$. Treasure is magical so they cannot picks all coins in one go. There is a certain rule of picking up the coins. Chef has to choose 2 indices $i$ and $j$ with $coins[i]<=coins[j]$ and if $coins[i]<coins[j]$ insert back $coins[j]-coins[i]$ into coins array. Given that Chef can make any

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