change-making problem

This can be used to solve Change-making problems (where the set T specifies the available coins).

The change-making problem addresses the following question: how can a given amount of money be made with the least number of coins of given denominations?

An application of change-making problem can be found in computing the ways one can make a nine dart finish in a game of darts.