820. 递归求斐波那契数列

https://www.acwing.com/problem/content/submission/code_detail/14063990/

AcWing/820/820.cpp

@@ -0,0 +1,20 @@
+#include <iostream>
+
+using std::cin;
+using std::cout;
+const char endl = '\n';
+
+int f(int x) {
+    return x == 1 || x == 2 ? 1 : f(x - 1) + f(x - 2);
+}
+
+int n;
+
+int main() {
+    std::ios::sync_with_stdio(false);
+
+    cin >> n;
+    cout << f(n) << endl;
+
+    return 0;
+}