ZZULIOJ 1259:Fibbonacci Number_zzulioj1259-CSDN博客

本文链接：https://blog.csdn.net/KNeeg_/article/details/128893955

文章讲述了如何使用C++编程解决斐波那契数列的问题。首先介绍了递归方法，但由于效率低可能导致超时，然后提出了使用数组存储计算结果以提高效率的解决方案。

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

题目描述

Your objective for this question is to develop a program which will generate a fibbonacci number. The fibbonacci function is defined as such:

f(0) = 0

f(1) = 1

f(n) = f(n-1) + f(n-2)

Your program should be able to handle values of n in the range 0 to 50.

输入

Each test case consists of one integer n in a single line where 0≤n≤50. The input is terminated by -1.

输出

Print out the answer in a single line for each test case.

样例输入 Copy

-1

样例输出 Copy

来源/分类

浙江工业大学网络选拔赛

首先想到的是递归但递归会时间超限，自己用vs跑需要多几分钟才能出结果

int f(int n)
{
    if (n == 0)  //出口
        return 0;
    if (n == 1)
        return 1;
    else
        return f(n - 1) + f(n - 2);//关系
}
int main()
{
    int n;
    while (cin>>n)
    {
        if (n == -1)
            break;
        else
        cout << f(n) << endl;
    }
    return 0;
}

关于递归思想我也是看b战老师讲解懂得

递归思想点击可以学习一下

其次就是用数组这个特别简单了

#include<iostream>
using namespace std;
int main()
{
    long long a[50],t;  //注意这里要 longlong类型 int会超出
    a[0] = 0; a[1] = 1;
    while (cin >> t)
    {
        if (t == -1)
            break;
        else {
            for (int i = 2; i <= t; i++)
                a[i] = a[i - 1] + a[i - 2];
            cout << a[t] << endl;
        }
    }
    return 0;
}