很简单 无注释
#include<iostream>
using namespace std;
int feb(int n) {
if (n == 1) return 1;
if (n == 2) return 1;
else return feb(n - 1) + feb(n - 2);
}
int main() {
int n = 0;
cin >> n;
int i = 2;
while (1) {
if (feb(i) == n){
cout << i;
break;
}
else if (feb(i) >= n) {
cout << "not inclueded in fibonacci sequence";
break;
}
else i++;
}
return 0;
}