-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathAsymTiling.java
More file actions
50 lines (42 loc) · 1.43 KB
/
AsymTiling.java
File metadata and controls
50 lines (42 loc) · 1.43 KB
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
import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.Arrays;
class AsymTiling {
private static int[] cache = new int[101];
private static final int INF = 1000000007;
public static void main(String[] args) {
try {
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
BufferedWriter writer = new BufferedWriter(new OutputStreamWriter(System.out));
int cases = Integer.parseInt(reader.readLine());
Arrays.fill(cache, -1);
cache[0] = 1; cache[1] = 1; cache[2] = 2; cache[3] = 3;
while (cases-- > 0) {
int number = Integer.parseInt(reader.readLine());
writer.append(String.valueOf(asymTiling(number)));
writer.append("\n");
}
writer.flush();
writer.close(); reader.close();
} catch (Exception e) {
e.printStackTrace();
}
}
public static int asymTiling(int number) {
if (number % 2 == 1) return fibonacciSequence(number) - fibonacciSequence(number/2);
int ret = fibonacciSequence(number);
ret = (ret - fibonacciSequence(number / 2) + INF) % INF;
ret = (ret - fibonacciSequence(number / 2 - 1) + INF) % INF;
return ret;
}
public static int fibonacciSequence(int number) {
int ret = cache[number];
if (ret != -1) return ret;
ret = fibonacciSequence(number - 1) + fibonacciSequence(number - 2);
if (ret > INF) ret %= INF;
cache[number] = ret;
return ret;
}
}