Problem
In Python, design an algorithm to find the minimum combination of coins that can be used to make change for a given amount (in cents) less than one dollar. You can assume that the coins that can be used are quarters, dimes, nickels and pennies. For example, if you were given 48 cents, your algorithm should print out 1 quarters, 2 dime, and 3 pennies.