题解 | #Fibonacci#分治思想
Fibonacci
https://www.nowcoder.com/practice/17ad6908e36a49f4b06ea96936e8bb25
#include <iostream> using namespace std; int fun(int n){ if(n==0) return 0; else if(n==1) return 1; else return fun(n-1)+fun(n-2); } int main() { int n; while(cin>>n){ cout<<fun(n); } }