1795 Problem A Fibonacci

最新推荐文章于 2021-02-06 21:34:14 发布

fantasydreams

最新推荐文章于 2021-02-06 21:34:14 发布

阅读量317

点赞数

分类专栏： C/C++ OJ codeup 文章标签： codeup 1795

本文链接：https://blog.csdn.net/fantasydreams/article/details/79411470

版权

C/C++ 同时被 3 个专栏收录

421 篇文章 3 订阅

订阅专栏

389 篇文章 1 订阅

订阅专栏

codeup

144 篇文章 2 订阅

订阅专栏

问题 A: Fibonacci
时间限制: 1 Sec 内存限制: 32 MB
献花: 109 解决: 42
[献花][花圈][TK题库]
题目描述
The Fibonacci Numbers{0,1,1,2,3,5,8,13,21,34,55…} are defined by the recurrence:
F0=0 F1=1 Fn=Fn-1+Fn-2,n>=2
Write a program to calculate the Fibonacci Numbers.
输入
Each case contains a number n and you are expected to calculate Fn.(0<=n<=30) 。
输出
For each case, print a number Fn on a separate line,which means the nth Fibonacci Number.
样例输入
1
样例输出
1

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>

using namespace std;
const int MaxN = 33;
int main()
{
#ifdef _DEBUG
    freopen("data.txt", "r+", stdin);
#endif // _DEBUG

    std::ios::sync_with_stdio(false);
    int Fibo[MaxN]; Fibo[0] = 0; Fibo[1] = 1;

    for (int i = 2; i < MaxN ; ++i)
        Fibo[i] = Fibo[i - 2] + Fibo[i - 1];

    int n;
    while (cin >> n)
        cout << Fibo[n] << endl;

    return 0;
}
/**************************************************************
    Problem: 1795
    User: Sharwen
    Language: C++
    Result: 升仙
    Time:1 ms
    Memory:1696 kb
****************************************************************/