Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Appearance settings

Latest commit

 

History

History
History
39 lines (31 loc) · 666 Bytes

File metadata and controls

39 lines (31 loc) · 666 Bytes
Copy raw file
Download raw file
Open symbols panel
Edit and raw actions
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
package charlesuu;
import java.util.Scanner;
public class BOJ_10844 {
public static long mod = 1000000000L;
public static void main(String args[]) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
long[][] d = new long[n + 1][10];
for (int i = 1; i <= 9; i++) {
d[1][i] = 1;
}
for (int i = 2; i <= n; i++) {
for (int j = 0; j <= 9; j++) {
d[i][j] = 0;
if (j - 1 >= 0) {
d[i][j] += d[i - 1][j - 1];
}
if (j + 1 <= 9) {
d[i][j] += d[i - 1][j + 1];
}
d[i][j] %= mod;
}
}
long ans = 0;
for (int i = 0; i <= 9; i++) {
ans += d[n][i];
}
ans %= mod;
System.out.println(ans);
}
}
Morty Proxy This is a proxified and sanitized view of the page, visit original site.