菲波那契数列
#include<iostream>
using namespace std;
int main()
{
int k, i;
int a[50];
cin >> k;
a[0] = 1;
a[1] = 1;
for (i = 2; i <= k; ++i)
{
a[i] = a[i - 1] + a[i - 2];
}
cout << a[k-1] << endl;
return 0;
}