首页 > 其他 > 详细

HDU 1250: Hat's Fibonacci

时间:2014-07-08 14:00:23      阅读:386      评论:0      收藏:0      [点我收藏+]

Hat‘s Fibonacci

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


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.BigInteger;     
import java.util.Scanner;     
  
public class Main {     
    
    public static void main(String[] args) {     
        Scanner cin = new Scanner((System.in));     
        int  n;  
        BigInteger[] f = new BigInteger[10000];  
        f[1] = BigInteger.ONE;  
        f[2] = BigInteger.ONE;  
        f[3] = BigInteger.ONE;  
        f[4] = BigInteger.ONE;  
        for(int i=5; i<f.length;i++)   
            f[i] = f[i-1].add(f[i-2].add(f[i-3].add(f[i-4])));  
        while(cin.hasNext()){  
            n = cin.nextInt();  
            System.out.println(f[n]);  
        }  
    }     
} 


HDU 1250: Hat's Fibonacci,布布扣,bubuko.com

HDU 1250: Hat's Fibonacci

原文:http://blog.csdn.net/u013487051/article/details/37082041

(0)
(0)
   
举报
评论 一句话评论(0
关于我们 - 联系我们 - 留言反馈 - 联系我们:wmxa8@hotmail.com
© 2014 bubuko.com 版权所有
打开技术之扣,分享程序人生!