题解 | 吃糖果

#include<iostream>
#include<cstdio>
using namespace std;
const int MAXN=21;
long long dp[MAXN];
int main(){
    dp[0]=1;
    dp[1]=1;
    for(int i=2;i<MAXN;i++){
        dp[i]=dp[i-1]+dp[i-2];
    }
    int n;
    scanf("%d",&n);
    cout<<dp[n]<<endl;
    return 0;
}