斐波那契数列之经典兔子问题
—经典兔子问题//递归写法O（2n）int Fib(int day){ if (day <= 1) return day; else return Fib(day - 1) + Fib(day - 2);}int main(){ while (1) { int day; printf...
