【牛客网】上海交通大学 Fibonacci 解题报告

98 阅读 0 评论 65 点赞

我是靠谱客的博主文静网络，最近开发中收集的这篇文章主要介绍【牛客网】上海交通大学 Fibonacci 解题报告，觉得挺不错的，现在分享给大家，希望可以做个参考。

概述

题目描述

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

输入

复制

输出

复制

题解

#include <cstdio>
#include <string.h>
int main()
{
int n;
while(scanf("%d", &n) != EOF){
int a[31];
a[0] = 0, a[1] = 1;
int i;
for(i = 2; i < 31; i++){
a[i] = a[i - 1] + a[i - 2];
}
printf("%dn", a[n]);
}
return 0;
}