UVa 674 - Coin Change

Problem Number - Problem Name

 * 

Summary
Suppose there are 5 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.

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 7489 cents.

Implementations
The high-values are computationally expensive, but can be accelerated using Dynamic Programming.

Input
11 26

Output
4 13