游客 注册 | 登录
中文 | En

1386 - Fibonacci

通过次数

0

提交次数

0

时间限制 : 1 秒 内存限制 : 32 MB

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

C语言解答

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

C++解答

#include <stdio.h>

int Fibonacci(int n){
	if(n==0){
		return 0;
	}else if(n <= 2){
		return 1;
	}else{
		return Fibonacci(n-1) + Fibonacci(n-2);
	}
}

int main(){
    int f[33] = {0, 1, 1};
    for(int i=3; i<=30; i++){
        f[i] = f[i-1] + f[i-2];
    }
    int n;
    while(scanf("%d", &n) != EOF){
        printf("%d\n", f[n]);
    }

    return 0;
}

Python解答

while True:
    n=int(input())
    a1 = 1  
    a2 = 1 
    an = 0
    if(n>2):
        for i in range(1,n-1):
            an=a1+a2
            a1=a2
            a2=an
    elif(n>0):
        an=1
    else:
        an=0
    print(an)
请先登陆