[백준] 11047번 - 동전 0

문제URL:https://www.acmicpc.net/problem/11047

 

 

 

import java.util.Scanner;
 
public class Main {
	public static int n,k;
	public static int[] A_array = new int[100000000];
	public static int A_array_end=0,coin_count=0;
	
	public static void main(String[] args) {		
		Scanner sc = new Scanner(System.in);
		n = sc.nextInt();
		k = sc.nextInt();		
		for(int i=0;i<n;i++) {
			A_array[i] = sc.nextInt();
		}
		for(int i=n-1;i>=0;i--) {
			if(k==0) {
				break;
			}
			if(A_array[i] <= k) {
				coin_count += k / A_array[i];
				k = k % A_array[i];
			}
		}
		System.out.println(coin_count);
	}
}