菲波那契数列#include<iostream>using namespace std;int main(){ int num1 = 1, num2 = 1,temp; int k,i; cin >> k; if (k <= 2) { cout << "1" << endl; } else { for (i = 1; i <= k - 2; ++i) { temp = num1 + num2; num1 = num2; num2 = temp; } cout << num2; } return 0;}