当前位置：网站首页>AcWing 3433. Eat candy recursively | find rules

AcWing 3433. Eat candy recursively | find rules

2022-07-18 14:53:00 【Alkali！】

subject

https://www.acwing.com/problem/content/3436/
Insert picture description here

Ideas

The title is frightening at a glance
Suppose there is $N$ A candy , Eat at least every day $1$ individual , Eat at most $2$ individual , Ask how many kinds of eating programs there are

Recursion can be used （DP） Methods ：
Insert picture description here
I didn't expect such a simple answer

Code

#include<iostream>
using namespace std;
const int N=25;
int a[N];
int n;
int main()
{
    
    a[0]=a[1]=1;
    scanf("%d",&n);
    for(int i=2;i<=n;i++) a[i]=a[i-1]+a[i-2];
    printf("%d",a[n]);
    return 0;
}