F(1)=1,F(2)=1,F(n)=F(n-1)+F(n-2),试求F(50)值
#include<stdio.h>
int main() {
long long a[51];
a[0] = a[1] = 1;
for (int i = 2; i < 50; ++i)
a[i] = a[i - 1] + a[i - 2];
printf("%lld", a[49]);
}
代码实现如下
#include <stdio.h>
long long fibonacci(int n) {
if (n == 1 || n == 2) {
return 1;
}
return fibonacci(n - 1) + fibonacci(n - 2);
}
int main() {
printf("%lld\n", fibonacci(50));
return 0;
}
输出结果:
20365011074