-
Notifications
You must be signed in to change notification settings - Fork 1
Expand file tree
/
Copy pathBOJ1003.java
More file actions
58 lines (46 loc) · 1.5 KB
/
BOJ1003.java
File metadata and controls
58 lines (46 loc) · 1.5 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
51
52
53
54
55
56
57
58
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;
public class BOJ1003 {
static int n;
static List<Integer> list;
static int[][] fibonacci;
private static void input() throws IOException {
BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
n = Integer.parseInt(br.readLine());
// set list
list = new ArrayList<>();
for(int i = 0 ; i < n; i++){
list.add(Integer.parseInt(br.readLine()));
}
fibonacci = new int[41][2];
}
public static void main(String[] args) throws IOException {
input();
process();
}
private static void process(){
setFibonacci();
// print answer
StringBuilder sb = new StringBuilder();
for(int i : list)
sb.append(fibonacci[i][0]).append(" ").append(fibonacci[i][1]).append("\n");
System.out.println(sb.toString());
}
private static void setFibonacci(){
// set init
fibonacci[0][0] = 1;
fibonacci[1][1] = 1;
for(int i = 2; i <= 40; i++){
// set 0 count
fibonacci[i][0] += fibonacci[i-1][0];
fibonacci[i][0] += fibonacci[i-2][0];
// set 1 count
fibonacci[i][1] += fibonacci[i-1][1];
fibonacci[i][1] += fibonacci[i-2][1];
}
}
}