Example 6: Solve the Denomination Problem

Problem

Consider a currency system in which there are bills of seven denominations: $1, $2, $5, $10, $50, and $100.

Write a program that takes $N amount as a parameter and computes the minimum number of bills required, which sum up to $N.