题解 | #Fibonacci#
Fibonacci
https://www.nowcoder.com/practice/17ad6908e36a49f4b06ea96936e8bb25
#include <iostream>
using namespace std;
int fabi(int n){
if(n==0 || n==1) return n;
return fabi(n-2)+fabi(n-1);
}
int main() {
int a;
while (cin >> a) { // 注意 while 处理多个 case
printf("%d",fabi(a));
}
}
