PAT 养兔子 详细题解 (递推)

https://www.nowcoder.com/pat/2/problem/251

很经典的递推问题了

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
using namespace std;
#define ms(x, n) memset(x,n,sizeof(x));
typedef  long long LL;
const LL maxn = 100;

LL rabitNum[maxn], n;
void init()
{
    rabitNum[1] = 1, rabitNum[2] = 2;
    for(int i = 3; i <= maxn; i++)
        rabitNum[i] = rabitNum[i-1]+rabitNum[i-2];
}

int main()
{
    init();
    while(cin >> n)
        cout << rabitNum[n] <<endl;

    return 0;
}