Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 1.0 Seconds Memory Limit: 65536K

Total Runs: 2920 Accepted Runs: 1088 Multiple test files

Poor Bessie has taken a job in the convenience store located just
over the border in Slobbovia. Slobbovians use different coinages
than the USA; their coin values change day-by-day! ### Input

* Line 1: Two space-separate integers: *C* and *N*
### Output

* Line 1: A single integer that is the minimum number of coins to
create *C* cents
### Sample Input

### Sample Output

Help Bessie make optimal change for Slobbovian shoppers. You will
need to create *C* (1 ≤ *C* ≤ 1000) cents of change using *N* (1 ≤ *N*
≤ 10) coins of various values. All test cases will be solvable
using the supplied coins.

If 5 coins of values 50, 25, 10, 5, and 1 were available, Bessie would make optimum change (minimal coins) of 93 cents by using 1 x 50, 1 x 25, 1 x 10, 1 x 5, and 3 x 1 coins (a total of 7 coins).

How hard could it be? The final two test cases will be challenging.

* Lines 2..*N* + 1: Each line contains a single unique integer that is a
coin value that can be used to create change

93 5 25 50 10 1 5

7

Maintance:Fxz. Developer: SuperHacker, G.D.Retop, Fxz