题解 | #统计每个月兔子的总数#

#include <stdio.h>

//本质上是斐波那契数列
//f(n) = f(n-1) + f(n-2)
static int count(int n)
{
    if(n == 1 || n == 2)
    {
        return 1;
    }
    else
    {
        return count(n-1) + count(n-2);    //递归实现
    }
}
int main()
{
    int num = 0;
    int ret = 0;
    scanf("%d", &num);
    if(num >= 1 && num <= 31)
    {
        ret = count(num);
        printf("%d\n", ret);
    }
    return 0;
}