HDU - 1250 Hat's Fibonacci

Problem Description A Fibonacci sequence is calculated by adding the previous two members the sequence, with the first two members being both 1. F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4) Your task is to take a number as input, and print that Fibonacci number.

Input Each line will contain an integers. Process to end of file.

Output For each case, output the result in a line.

Sample Input 100

Sample Output 4203968145672990846840663646 Note: No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits.

在BigInteger面前，一切大数都是纸老虎（微笑）

import java.math.BigInteger;
import java.util.Scanner;

public class Main {

	
	public static void main(String[] args) {
		Scanner sin=new Scanner(System.in);
		while(sin.hasNext()){
			int n=sin.nextInt();
			BigInteger f=BigInteger.ONE;
			BigInteger a=BigInteger.ONE;
			BigInteger b=BigInteger.ONE;
			BigInteger c=BigInteger.ONE;
			BigInteger d=BigInteger.ONE;
			for(int i=5;i<=n;i++){
				f=a.add(b).add(c).add(d);
				a=b;
				b=c;
				c=d;
				d=f;
			}
			System.out.println(f);
		}
	}

}