ACM刷题之HDU————Hat's Fibonacci

最新推荐文章于 2020-09-03 16:59:59 发布

小时的枫

最新推荐文章于 2020-09-03 16:59:59 发布

阅读量318

点赞数

分类专栏： ACM题目文章标签： ACM 杭电 java BigInteger

本文链接：https://blog.csdn.net/xiaofeng187/article/details/51878460

版权

ACM题目专栏收录该内容

78 篇文章 0 订阅

订阅专栏

Hat's Fibonacci

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

Total Submission(s): 2053 Accepted Submission(s): 802

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

JAVA 大数大法好！

这题之前一直卡着。原来用高精度来做，但是提交每次都会爆内存。于是就放着没做了。这两天自学了点JAVA，于是又捡起来。

大数的基本操作就不罗列了，下面是ac代码：

import java.math.BigInteger;
import java.util.Scanner;
import java.math.*;
import java.text.*;
public class Main {

	public static void main(String[] args) {
		// TODO 自动生成的方法存根
		Scanner cin=new Scanner(System.in);
		int i;
		BigInteger[] big = new BigInteger[12000];
		big[1] = new BigInteger("1");
		big[2] = new BigInteger("1");
		big[3] = new BigInteger("1");
		big[4] = new BigInteger("1");
		for(i=5;i<11111;i++)
		{
			 big[i] =big[i-1].add(big[i-2]);
			 big[i] = big[i].add(big[i-3]);
			 big[i] = big[i].add(big[i-4]);
		}
		
		while(cin.hasNext())   //等同于!=EOF
		{
			i=cin.nextInt();
			System.out.println(big[i]);
		}
	}

}