Hat's Fibonacci //Java大数数组相加_java fib 大数数组-优快云博客

本文链接：https://blog.youkuaiyun.com/LMengi000/article/details/80141338

本文介绍了一个基于Java实现的四阶斐波那契数列算法，该算法利用BigInteger来处理大整数运算，确保计算结果的准确性。通过预先计算并存储数值的方式，实现了快速查找指定项的功能。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Hat's Fibonacci

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

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 | We have carefully selected several similar problems for you: 1753 1865 1002 2100 1042

Statistic | Submit | Discuss | Note

import java.math.*;
import java.util.Scanner;
public class Main {
  public static void main(String args[]){
	 BigInteger a[]=new BigInteger [10002]; //数组开小了，所以交了好多遍
	 a[1]=BigInteger.ONE;
	 a[2]=BigInteger.ONE;
	 a[3]=BigInteger.ONE;
	 a[4]=BigInteger.ONE;
	 int n;
	 Scanner scan=new Scanner(System.in);
	 for(int i=5;i<=10000;i++)//数组开小了
	 {
		 a[i]=a[i-1].add(a[i-2].add(a[i-3].add(a[i-4])));
	 }
	 while(scan.hasNext())
	 {
		 n=scan.nextInt();
		 System.out.println(a[n]);
	 }
  }
}