-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathFibonacci.java
69 lines (60 loc) · 2.2 KB
/
Fibonacci.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
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
public class Fibonacci {
private static int[] args_add(int[] f1, int[] f2){
int f3[] = new int[100];
for (int i = 0; i < 100; i++){
f3[i] = f1[i] + f2[i];
}
return f3;
}
private static int[] args_format(int[] args){
int len = args.length;
for (int i = 0; i < len; i++){
if (args[i] >= 1000000 ){
args[i+1] += args[i] / 1000000;
args[i] = args[i] % 1000000;
}
}
return args;
}
private static void calc(int n){
int fb[][] = new int [n+1][10000];
fb[0][0] = 0;
fb[1][0] = 1;
for (int i = 2; i <= n; i++){
fb[i] = args_add(fb[i-1], fb[i-2]);
args_format(fb[i]);
}
int len = 99;
while (fb[n][len] == 0) len--;
System.out.print(fb[n][len]);
for (int i = len - 1; i>=0; i--){
if ( fb[n][i] > 99999 ){
System.out.print(fb[n][i]);
} else if ( fb[n][i] > 9999 ){
System.out.print(0);
System.out.print(fb[n][i]);
} else if ( fb[n][i] > 999 ){
System.out.print("00");
System.out.print(fb[n][i]);
} else if ( fb[n][i] > 99 ){
System.out.print("000");
System.out.print(fb[n][i]);
} else if ( fb[n][i] > 9 ){
System.out.print("0000");
System.out.print(fb[n][i]);
}else if ( fb[n][i] > 0 ){
System.out.print("00000");
System.out.print(fb[n][i]);
} else {
System.out.print("000000");
}
}
System.out.println();
}
public static void main(String args[]){
calc(10);
calc(20);
calc(100);
calc(2048);
}
}