[BOJ] 9084번 : 동전

1. problem : 

https://www.acmicpc.net/problem/9084

 

2. solution1  :

#include <bits/stdc++.h>
using namespace std;
int n, m; 
int a[10005];
int d[10005];

int main(void) {
	ios::sync_with_stdio(0);
	cin.tie(0); 
	int t;
	cin >> t;
	while (t--) {
		cin >> n; 
		for (int i = 0; i < n; i++) cin >> a[i]; 
		fill(d, d + 10005, 0);
		d[0] = 1; 
		cin >> m; 
		for (int i = 0; i < n; i++) {
			for (int j = a[i]; j <= m; j++) {
				d[j] += d[j - a[i]];
			}
		}
		cout << d[m] << '\n';

	}
}

source code 출처 : https://github.com/encrypted-def/basic-algo-lecture/blob/master/0x10/solutions/9084.cpp

basic-algo-lecture/0x10/solutions/9084.cpp at master · encrypted-def/basic-algo-lecture