All the possible ways

CodeChefOpen on judge ↗

Tarun has been given a value, V and has been provided with an unlimited supply of coins. The denominations of the coins are represented by an array, arr of size N. Tarun needs to find the total number of ways by which he can get the value V using these coins. Display 0 if it is not possible to get the value V. For example, arr = { 1, 2 ,3, 4, 5 } indicates that Tarun has an infinite supply of coin

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