-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy path15990.java
42 lines (28 loc) · 1.07 KB
/
15990.java
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
import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int t = sc.nextInt();
int[][] cases = new int[100001][4];
cases[1][1] = 1;
cases[2][2] = 1;
cases[3][1] = 1;
cases[3][2] = 1;
cases[3][3] = 1;
for(int tc=0; tc<t; tc++) {
int n = sc.nextInt();
for(int i=4; i<=n; i++) {
if(cases[i][1]+cases[i][2]+cases[i][3] != 0)
continue;
cases[i][1] = cases[i-1][2] % 1000000009 + cases[i-1][3] % 1000000009;
cases[i][1] %= 1000000009;
cases[i][2] = cases[i-2][1] % 1000000009 + cases[i-2][3] % 1000000009;
cases[i][2] %= 1000000009;
cases[i][3] = cases[i-3][1] % 1000000009 + cases[i-3][2] % 1000000009;
cases[i][3] %= 1000000009;
}
int answer = (cases[n][1] + cases[n][2]) % 1000000009 + cases[n][3];
System.out.println(answer % 1000000009);
}
}
}