OJ_1092

最新推荐文章于 2024-05-02 22:51:59 发布

jerryzcx

最新推荐文章于 2024-05-02 22:51:59 发布

阅读量772

点赞数

CC 4.0 BY-SA版权

分类专栏：九度OJ

本文链接：https://blog.youkuaiyun.com/jerryzcx/article/details/19615667

九度OJ 专栏收录该内容

152 篇文章

订阅专栏

#include <iostream>
using namespace std;
int a[31]={0};
void cal()
{
     a[0]=0;
     a[1]=1;
     for(int i=2;i<=30;i++)
     {
             a[i]=a[i-1]+a[i-2];
     }
 }
void func()
{
     cal();
     int n;
     while(cin>>n)
     {
                  cout<<a[n]<<endl;
     }
    
   
}
int main(int argc, char *argv[])
{
    
	//printf("Hello, world\n");
	func();
	return 0;
}

记录

题目描述：

    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.

样例输入：

样例输出：