Problem
Find coin (or note, or whatever) denominations which, for integers D and N, satisfy that:
- We have at most D different denominations.
- The largest number of coins required to sum to any number less than or equal to N is as small as possible.
Sub-problems
For a number n and a list of denominations l, find the smallest combination of elements of l that sum to n.