Skip to content

Commit 0f27661

Browse files
committed
[20251209] BOJ / G5 / 1학년 / 김민진
1 parent dff4d18 commit 0f27661

File tree

1 file changed

+55
-0
lines changed

1 file changed

+55
-0
lines changed
Lines changed: 55 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,55 @@
1+
```java
2+
import java.io.*;
3+
import java.util.StringTokenizer;
4+
5+
public class Main {
6+
7+
private static final BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
8+
private static final BufferedWriter bw = new BufferedWriter(new OutputStreamWriter(System.out));
9+
private static StringTokenizer st;
10+
11+
private static int N;
12+
private static int[] nums;
13+
private static long[][] dp;
14+
15+
public static void main(String[] args) throws IOException {
16+
init();
17+
sol();
18+
}
19+
20+
private static void init() throws IOException {
21+
N = Integer.parseInt(br.readLine());
22+
23+
nums = new int[N];
24+
st = new StringTokenizer(br.readLine());
25+
for (int i = 0; i < N; i++) {
26+
nums[i] = Integer.parseInt(st.nextToken());
27+
}
28+
dp = new long[N][21];
29+
dp[0][nums[0]] = 1;
30+
}
31+
32+
private static void sol() throws IOException {
33+
for (int i = 1; i < N - 1; i++) {
34+
for (int prev = 0; prev <= 20; prev++) {
35+
if (dp[i - 1][prev] == 0) continue;
36+
37+
int sum = prev + nums[i];
38+
int gap = prev - nums[i];
39+
40+
if (sum <= 20) {
41+
dp[i][sum] += dp[i - 1][prev];
42+
}
43+
if (gap >= 0) {
44+
dp[i][gap] += dp[i - 1][prev];
45+
}
46+
}
47+
}
48+
bw.write(dp[N - 2][nums[N - 1]] + "");
49+
bw.flush();
50+
bw.close();
51+
br.close();
52+
}
53+
54+
}
55+
```

0 commit comments

Comments
 (0)