斐波那契数列

#include<bits/stdc++.h>
using namespace std;
int fib(int n){
    int a=1;
    int b=1;
    int c=1;
    while(n>2){
        c=a+b;
        a=b;
        b=c;
        n--;
    }
    return c;
}
int main(){
    int k;
    cin>>k;
    if(k<=2)cout<<1<<endl;
    else
    cout<<fib(k)<<endl;
    return 0;
}