Skip to content

Commit e5328d2

Browse files
authored
Merge pull request #1855 from AlgorithmWithGod/JHLEE325
[20260129] BOJ / G4 / 개근상 / 이준희
2 parents b3f694b + 7aa550c commit e5328d2

File tree

1 file changed

+45
-0
lines changed

1 file changed

+45
-0
lines changed
Lines changed: 45 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,45 @@
1+
```java
2+
import java.util.*;
3+
import java.io.*;
4+
5+
public class Main {
6+
7+
static int MOD = 1000000;
8+
9+
public static void main(String[] args) throws Exception {
10+
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
11+
int N = Integer.parseInt(br.readLine());
12+
13+
int[][][] dp = new int[N + 1][2][3];
14+
15+
dp[0][0][0] = 1;
16+
17+
for (int i = 0; i < N; i++) {
18+
for (int j = 0; j < 2; j++) {
19+
for (int k = 0; k < 3; k++) {
20+
if (dp[i][j][k] == 0) continue;
21+
22+
dp[i + 1][j][0] = (dp[i + 1][j][0] + dp[i][j][k]) % MOD;
23+
24+
if (j + 1 < 2) {
25+
dp[i + 1][j + 1][0] = (dp[i + 1][j + 1][0] + dp[i][j][k]) % MOD;
26+
}
27+
28+
if (k + 1 < 3) {
29+
dp[i + 1][j][k + 1] = (dp[i + 1][j][k + 1] + dp[i][j][k]) % MOD;
30+
}
31+
}
32+
}
33+
}
34+
35+
int ans = 0;
36+
for (int j = 0; j < 2; j++) {
37+
for (int k = 0; k < 3; k++) {
38+
ans = (ans + dp[N][j][k]) % MOD;
39+
}
40+
}
41+
42+
System.out.println(ans);
43+
}
44+
}
45+
```

0 commit comments

Comments
 (0)