1252: A012 递归练习3(粒子堆αβ)

#include <iostream>
using namespace std;

int beta(int t)
{
    if(t == 0)return 0;
    if(t == 1)return 3;
    else return(2 * beta(t - 1) + 3 * beta(t - 2));
}

int main()
{
    int n;
    while(cin >> n)
    {
        cout << beta(n - 1) << " " << beta(n) << endl;
    }
    return 0;
}

重点是数学建模:

a(t)=b(t-1)

b(t)=3a(t-1)+2b(t-1)

然后把a全部替换成b