Efficient Currency

CodeChefOpen on judge ↗

The Currency of some country has 'k' number of denominations. For each denominaion , there is a coin . Whenever a transaction happens with the shopkeeper, then to pay an amount 'X', you give exactly or some amount greater than 'X' ( let us say 'Y' ) to the shopkeeper. He then pays back the extra amount ( Y-X ) back to you. Both of you try to minimize the number of coins exchanged in the process. F

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