HDOJ 1250

Hat's Fibonacci

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 5890    Accepted Submission(s): 1944

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.
  
  

 

Author

戴帽子的

 

Recommend

Ignatius.L

 

JAVA水过，数据范围题目没明说，10000大概够了

import java.io.*;
import java.util.*;
import java.math.*;

/**
 *
 * @author XM_zhou
 */
public class Main
{

    public static void main(String[] args)
    {
        Scanner cin = new Scanner(System.in);
        BigInteger a[] = new BigInteger [10100];
        a[1] = a[2] = a[3] = a[4] = BigInteger.ONE;
        for(int i = 5 ; i <= 10000 ; i++)
        {
            a[i] = a[i - 1].add(a[i - 2].add(a[i - 3].add(a[i - 4])));
        }
        int n ;
        while(cin.hasNext())
        {   
            n = cin.nextInt();
            System.out.println(a[n]);
            
        }

    }
}