#include <iostream>
using namespace std;
int main()
{
int n;
__int64 Lu[51];
while (cin >> n)
{
Lu[0] = 1;
Lu[1] = 2;
for (int i = 2; i < n; i++)
Lu[i] = Lu[i - 1] + Lu[i - 2];
cout << Lu[n - 1] << endl;
}
return 0;
}
HDU ACM 2046 骨牌铺方格
最新推荐文章于 2019-12-09 14:39:47 发布