algorithm'''problem solve
[백준] 11047 - 동전 0(설명X)
JunHwa Park
2020. 5. 9. 22:15
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 | #include <cstdio> int main() { int N, K; scanf("%d %d", &N, &K); int* cost = new int[N]; for (int i = 0; i < N; i++) scanf("%d", &cost[N - i - 1]); int num = 0; for (int i = 0; i < N; i++) { num += K / cost[i]; K %= cost[i]; } printf("%d\n", num); } | cs |