hdoj2018--母牛故事

hdu-2018

这个题不是每个牛都是第四年生牛的，最初始的那头牛，是每五年生一次小牛。。

纯递归代码：

#include <stdio.h>#include <string.h>#include <math.h>#include <algorithm>#include <iostream>using namespace std;int grow_cow2(int year){    if (year < 4)    return year;    else    {        int i, sum = year;        for (i = 3; i < year; i++)        {            sum += grow_cow2(year - i);        }        return sum;    }}int grow_cow(int year){     if (year < 5)    return year;    else    {        int i, sum = year;        for (i = 4; i < year; i++)        {            sum += grow_cow2(year - i);        }        return sum;    }}int main(){    int n;    while (scanf("%d", &n) && n)    {        printf("%d\n", grow_cow(n));    }    return 0;}