题解 | #吃糖果#

#include <iostream>
using namespace std;

short Fib_T(int n) { //有点像Fib,Fib(0)=0,Fib(1)=1 => Fib_T(0)=1,Fib_T(1)=1
    if (n == 1 || n == 0)  return 1;
    else   return Fib_T(n - 1) + Fib_T(n - 2);
}
int main() {
    short num;
    cin >> num;
    cout << Fib_T(num);
}

画个图就明白了