//
// Created by CyIce on 2021/1/30.
//
#include <stdio.h>
const int MAXN = 40;
int f[MAXN] = {0};
int fibonacci(int n){
if(n==0) return 0;
if(n==1) return 1;
if(f[n]==0)
f[n] = fibonacci(n-1)+fibonacci(n-2);
return f[n];
}
int main(){
int n;
while (scanf("%d",&n)!=EOF){
printf("%d\n",fibonacci(n));
}
return 0;
}
问题 A: Fibonacci
最新推荐文章于 2024-03-27 14:48:30 发布