Unbounded knapsack for minimum coins.
dp[a] = minimum coins to make amount a.
For each a, try every coin c and relax from dp[a-c] + 1.
Any optimal solution for a ends with some last coin c, leaving subproblem a-c.
Unbounded knapsack for minimum coins.
dp[a] = minimum coins to make amount a.
For each a, try every coin c and relax from dp[a-c] + 1.
Any optimal solution for a ends with some last coin c, leaving subproblem a-c.