ACM--Fibonacci数列大数--HDOJ 1250--Hat's Fibonacci

HDOJ题目地址：传送门

Hat's Fibonacci

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)

Total Submission(s): 10550    Accepted Submission(s): 3495

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.
  
  

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

public class Main {
   public static void main(String[] args) {
      Scanner cin=new Scanner(System.in);
      BigDecimal [] big= new BigDecimal[10050];
      big[1]=big[2]=big[3]=big[4]=new BigDecimal("1");
      for(int i=5;i<10050;i++){
          big[i]=big[i-1].add(big[i-2]).add(big[i-3]).add(big[i-4]);
      }
      while(cin.hasNext()){
          int source=cin.nextInt();
          System.out.println(big[source].toString());
      }
      cin.close();
   }
}