Problem:
Coin Changing Problem

Find the minimum number of coins to make change for n cents using coins of denominations d1, d2,.., dm. The coins can be used any number of times.

Input

n m
d1 d2 ... dm

Two integers n and m are given in the first line. The available denominations are given in the second line.

Output

Print the minimum number of coins in a line.

Constraints

1 ≤ n ≤ 50000

1 ≤ m ≤ 20

1 ≤ denomination ≤ 10000

The denominations are all different and contain 1.

Sample Input 1

55 4
1 5 10 50

Sample Output 1

2

Sample Input 2

15 6
1 2 7 8 12 50

Sample Output 2

2

Sample Input 3

65 6
1 2 7 8 12 50

Sample Output 3

3

Solution in JAVA (judge verdict: Runtime Error)

import java.util.Scanner;

class Main {

    int size;
    int cs;
    int[] coins;

    int min = 999999;

    public void go() {
        Scanner sc = new Scanner(System.in);
        this.size = sc.nextInt();
        this.cs = sc.nextInt();
        this.coins = new int[cs];
        for (int i = 0; i < this.coins.length; i++) {
            this.coins[i] = sc.nextInt();
        }
        this.calc(0, this.size);
        System.out.println(this.min);
    }

    public void calc(int count, int remain) {
        if (this.min <= count) {
            return;
        }
        if (remain == 0) {
            if (count < this.min) {
                this.min = count;
            }
        } else {
            for (int c : coins) {
                if (c <= remain) {
                    this.calc(count + 1, remain - c);
                }
            }
        }
    }

    public static void main(String[] args) {
        Main main = new Main();
        main.go();
    }
}