题解 | 吃糖果

#define _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
#include<string>
#include<algorithm>
using namespace std;

//动态规划，大到小： f(n)=f(n-1)+f(n-2)
//从小到大 f(1）=1 f(2)=2
//
void candy(int f1[], int n) {
    f1[1] = 1;
    f1[2] = 2;
    for (int i = 3; i <= n; i++) {
        f1[i] = f1[i - 1] + f1[i - 2];
    }
}
int main() {
    int n;
    scanf("%d", &n);
    int f1[21];
    candy(f1, n);
    printf("%d\n", f1[n]);
    return 0;
}