题解 | 斐波那契数列
斐波那契数列
https://www.nowcoder.com/practice/07cb775adcb443c8b65d40c580ec7901
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int feb(int a){
if(a == 0) return 0;
else if(a == 1) return 1;
return feb(a-1)+feb(a-2);
}
int main(){
int n; cin >> n;
cout << feb(n);
return 0;
}
