#A802. Coin Change
Coin Change
Problem Description
Suppose there are types of coins: 50
-cent, 25
-cent, 10
-cent, 5
-cent, and 1
-cent. We want to make changes with these coins for a given amount of money.
For example, if we have cents, then we can make changes with one 10
-cent coin and one 1
-cent coin, or two 5
-cent coins and one 1
-cent coin, or one 5
-cent coin and six 1
-cent coins, or eleven 1
-cent
coins. So there are four ways of making changes for cents with the above coins. Note that we count that there is one way of making change for zero cent.
Write a program to find the total number of different ways of making changes for any amount of money in cents. Your program should be able to handle up to coins.
Input
The input file contains any number of lines, each one consisting of a number ( ) for the amount of money in cents.
Output
For each input line, output a line containing the number of different ways of making changes with the above types of coins.
Samples
11
26
4
13