菲波那契数列(c++)

解题思路:

注意事项:

参考代码:

#include<iostream>

using namespace std;

int main()

{

int k,sum;

int f1 = 1, f2 = 1;

cin >> k;

if (k <= 2)

sum = 1;

else

for (int i = 3; i <= k; i++)

{

sum = f1 + f2;

f1 = f2;

f2 = sum;

}

cout << sum << endl;

}