题解 | #Fibonacci#
Fibonacci
https://www.nowcoder.com/practice/17ad6908e36a49f4b06ea96936e8bb25
#include<iostream>
using namespace std;
long long Fib(int n){
if(n==0){
return 0;
}else if(n==1){
return 1;
}else{
return Fib(n-1)+Fib(n-2);
}
}
int main(){
int n;
while(scanf("%d",&n)!=EOF){
printf("%lld\n", Fib(n));
}
}
