用递归的思想求斐波那契数

#include <iostream>using namespace std;int f (int x){    if(x<=1)        return x;    else    {        return f(x-2)+f(x-1);    }}int main (){    int n;    cin >> n;    cout << f(n) << endl;    return 0;}