HDU 1250 Hat's Fibonacci (Java大数,类似Fib数,有个坑!!)

本文介绍了一种使用Java实现的四阶斐波那契数列求解方法,通过预先计算并存储数列值的方式快速响应输入请求。文章提供了完整的代码示例,并讨论了测试数据规模的问题。

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

Hat's Fibonacci

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


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
戴帽子的


坑,题目下面的
"Note:
    No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits."
意思不是测试的数据结果不会超过2005位??!!我开了3000了WA,看别人的代码开了10005,就A了,看来我的英语真的有待提高!!????

AC代码:

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

public class Main {

    public static void main(String[] args) {
        
        Scanner sc = new Scanner(System.in);
        BigDecimal a[] = new BigDecimal [10005];
        //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)
        a[1]=a[2]=a[3]=a[4]=new BigDecimal(1);
        for (int i = 5; i <10005 ; i++) {
            a[i] = a[i-1].add(a[i-2]).add(a[i-3]).add(a[i-4]);
        }
        while(sc.hasNext()){
            int n = sc.nextInt();
            System.out.println(a[n]);
        }
    }
    
}



评论 2
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值