#include <iostream>
using namespace std;
int main()
{
int n;
__int64 Lu[52];
Lu[0] = 0;
Lu[1] = 1;
for (int i = 2; i <= 50; i++)
Lu[i] = Lu[i - 1] + Lu[i - 2];
while (cin >> n && n >= 0)
{
cout << Lu[n] << endl;
}
return 0;
}
HDU ACM 11 2070 Fibbonacci Number超级水题
最新推荐文章于 2020-05-06 18:13:07 发布