AcWing 741. 斐波那契数列
原题链接
简单
作者:
citrus_7
,
2021-02-01 11:33:20
,
所有人可见
,
阅读 204
#include <cstdio>
#include <iostream>
using namespace std;
int main()
{
int t;
cin >> t;
while (t -- )
{
int n;
cin >> n;
long a = 0, b = 1;
for (int i = 0; i < n; i ++ )
{
long c = a + b;
a = b;
b = c;
}
printf("Fib(%d) = %ld\n", n, a);
}
return 0;
}
#include <cstdio>
#include <iostream>
using namespace std;
int main()
{
long long f[61];
f[0] = 0, f[1] = 1;
for (int i = 2; i < 61; i ++ ) f[i] = f[i - 1] + f[i - 2];
int t;
cin >> t;
while (t -- )
{
int n;
cin >> n;
printf("Fib(%d) = %lld\n", n, f[n]);
}
return 0;
}