【ZCMU1041】二哥的困惑 Ⅳ（大整数）

题目链接

 

1041: 二哥的困惑 Ⅳ

Time Limit: 1 Sec  Memory Limit: 128 MB
Submit: 275  Solved: 89
[Submit][Status][Web Board]

Description

 

 

A Fibonacci sequence is calculated by adding the previous two members of the sequence, with the first two members being both 1.

f(1) = 1, f(2) = 1, f(n > 2) = f(n - 1) + f(n - 2)

Your task is to take a number as input, and print that Fibonacci number.

 

Input

Input contains several cases, every case contains a positive integer number N.

Output

print the Nth Fibonacci number.

Sample Input

100

Sample Output

354224848179261915075

HINT

 

Source

 

解题思路：

布吉岛有没有别的方法，反正我是用Java大整数类做的。

 

代码：

import java.math.BigInteger;
import java.util.Scanner;
public class Main {
	public static void main(String args[]) {
		Scanner in=new Scanner(System.in);
		int n;
		BigInteger a[]=new BigInteger[1005];
		while(in.hasNext()) {
			n=in.nextInt();
			a[1]=BigInteger.valueOf(1);
			a[2]=BigInteger.valueOf(1);
			for(int i=3;i<=n;i++)
				a[i]=a[i-1].add(a[i-2]);
			System.out.println(a[n]);
		}
	}
}