Making Change

CodeChefOpen on judge ↗

Given a list of $N$ possible coin denominations ${C_1, C_2, C_3, ..., C_N}$, and a value $V$, find the **minimum number** of coins required to make the value $V$ out of an arbitrary selection of the available coins. ###Input Format - The first line will contain the natural number $N$ denoting number of different unique coin values available, followed by the positive rational number $V$ denotin

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