HDU2018母牛的故事 递推

Posted 2021-05-20 幽殇默

http://acm.hdu.edu.cn/showproblem.php?pid=2018

#include<cstdio>
#include<iostream>
using namespace std;
const int N=60;
long long int s[N];
int main(void)
{
    int n;
    s[1]=1,s[2]=2,s[3]=3;
    while(cin>>n,n!=0)
    {
        for(int i=4;i<=n;i++)
        {
            s[i]=s[i-1]+s[i-3];
        }
        cout<<s[n]<<endl;
    }
    return 0;
}