Category "coin-change"

Need help solving boins change problem with constriants

I have a coins change problems but with 1 constraint: for each sum k> 0 we have exactly 2 coins with values of 2^k. example: if we are given the sum 3 we wou

Simple algorithm to compute coins that form minimum number of coins (or any valid number of coins) from a limited number of coins

I need to find the coins needed to make up a specified amount, not the number of ways or the minimum number of coins, but if the coins end up a minimal number t