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: Wrong Answer)

import java.io.*;

public class Main{
    public static void main(String[] args) throws IOException{
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] input = br.readLine().split(" ");
        
        int n = Integer.parseInt(input[0]);
        if(n < 1 || n > 50000){
            System.out.println("Error");
        }
        int m = Integer.parseInt(input[1]);
        if(m < 1 || m > 10000){
            System.out.println("Error");
        }
        
        String[] buf = br.readLine().split(" ");
        int ne[] = new int[m];
        for(int i = 0; i < m; i++){
            ne[i] = Integer.parseInt(buf[i]);
        }
        
        int min[] = new int[m];
        for(int i = 0; i < m; i++){
            min[i] = n / ne[i];
        }
        
        int mmin = min[0];
        for(int i = 0; i < m; i++){
            if(mmin > min[i]){
                mmin = min[i];
            }
        }
        
        System.out.println(mmin);
    }

}