Problem D. Coin Change
The tasks in this section contain test function calls. Please do not change this code; otherwise, the assignment may not be accepted.
The problem is to find the possible number of ways to get N cents with coins of different denominations. Imagine you have an infinite amount of coins valued c[0], c[1], c[2], …, c[m-1]
– some values (for example, coins of 1, 2, 5, and 10 cents; these values are stored to input as an array).
You can combine these coins to achieve N
cents in sum. Calculate the number of possible variations.
Order does not matter, i. e. for N=10 combinations 1+2+2+5, 2+1+2+5, and 5+2+1+2 are equal.
Example 1: N = 5, coins = [1,2,5]
-> 4
There are 4 ways to combine coins: 5=1+1+1+1+1, 5=1+1+1+2, 5=1+2+2, 5=5.
Example 2: N=4, coins=[1,2,3,7]
-> 4
Answer is 4: 4=1+1+1+1, 4=2+2, 4=1+3, 4=1+1+2
Example 3: N=100, coins = [1,3,5,7,10] -> 6426
Swipe to start coding
Implement the function and call it for the given test calls.
- How many ways to reach the
K
coins if you know the number of how to reachK-c[0]
,K-c[1]
, ... ,K-c[m-1]
coins? - What is the least sum you can change using only one coin of
c[0]
,c[1]
, ..., orc[-1]
?
Solution
Merci pour vos commentaires !
single
Demandez à l'IA
Demandez à l'IA
Posez n'importe quelle question ou essayez l'une des questions suggérées pour commencer notre discussion
Résumer ce chapitre
Expliquer le code dans file
Expliquer pourquoi file ne résout pas la tâche
Awesome!
Completion rate improved to 8.33
Problem D. Coin Change
Glissez pour afficher le menu
The tasks in this section contain test function calls. Please do not change this code; otherwise, the assignment may not be accepted.
The problem is to find the possible number of ways to get N cents with coins of different denominations. Imagine you have an infinite amount of coins valued c[0], c[1], c[2], …, c[m-1]
– some values (for example, coins of 1, 2, 5, and 10 cents; these values are stored to input as an array).
You can combine these coins to achieve N
cents in sum. Calculate the number of possible variations.
Order does not matter, i. e. for N=10 combinations 1+2+2+5, 2+1+2+5, and 5+2+1+2 are equal.
Example 1: N = 5, coins = [1,2,5]
-> 4
There are 4 ways to combine coins: 5=1+1+1+1+1, 5=1+1+1+2, 5=1+2+2, 5=5.
Example 2: N=4, coins=[1,2,3,7]
-> 4
Answer is 4: 4=1+1+1+1, 4=2+2, 4=1+3, 4=1+1+2
Example 3: N=100, coins = [1,3,5,7,10] -> 6426
Swipe to start coding
Implement the function and call it for the given test calls.
- How many ways to reach the
K
coins if you know the number of how to reachK-c[0]
,K-c[1]
, ... ,K-c[m-1]
coins? - What is the least sum you can change using only one coin of
c[0]
,c[1]
, ..., orc[-1]
?
Solution
Merci pour vos commentaires !
Awesome!
Completion rate improved to 8.33single