Algorithm/BOJ
[BOJ] 동전 1, 동전 2
goakgoak
2020. 9. 3. 18:51
[2293] 동전 1
https://www.acmicpc.net/problem/2293
소스코드
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
|
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
public class Main {
public static void main(String[] args) throws IOException {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(reader.readLine());
int n = Integer.parseInt(st.nextToken());
int k = Integer.parseInt(st.nextToken());
int[] coins = new int[n + 1];
int[] dp = new int[k + 1];
dp[0] = 1;
for (int i = 1; i <= n; i++) {
coins[i] = Integer.parseInt(reader.readLine());
}
for (int i = 1; i <= n; i++) {
for (int j = coins[i]; j <= k; j++) {
dp[j] += dp[j - coins[i]];
}
}
System.out.println(dp[k]);
}
}
|
cs |
[2294] 동전 2
https://www.acmicpc.net/problem/2294
소스코드
|
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
package boj;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.StringTokenizer;
public class _2294 {
/* BOJ - 동전 2 */
static int n, k;
static int[] coins;
static Case[] dp;
static class Case {
private int num;
private int count;
public Case() {
this.num = 0;
this.count = Integer.MAX_VALUE;
}
}
public static void main(String[] args) throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
StringTokenizer st = new StringTokenizer(br.readLine());
n = Integer.valueOf(st.nextToken());
k = Integer.valueOf(st.nextToken());
coins = new int[n];
for (int i = 0; i < n; i++) {
coins[i] = Integer.valueOf(br.readLine());
}
Arrays.sort(coins);
dp = new Case[k + 1];
for (int i = 0; i <= k; i++) {
dp[i] = new Case();
}
dp[0].num = 1;
dp[0].count = 0;
for (int i = 0; i < n; i++) {
for (int j = coins[i]; j <= k; j++) {
dp[j].num += dp[j - coins[i]].num;
if (dp[j - coins[i]].num == 0)
continue;
dp[j].count = Math.min(dp[j].count, dp[j - coins[i]].count + 1);
}
}
System.out.println(dp[k].count == Integer.MAX_VALUE ? -1 : dp[k].count);
}
}
|
cs |