··· #include<bits/stdc++.h> using namespace std;
int fib(int n) { if(n == 1 || n == 2) // 递归出口(基线条件) return 1; return fib(n-1) + fib(n-2); // 递推公式 }
int main() { int n; cin >> n; cout << fib(n) << endl; return 0; } ···
By signing up a Hydro universal account, you can submit code and join discussions in all online judging services provided by us.
Using your Hydro universal account