hdu2047

#include <stdio.h>

long long a[45] = {0, 2}, b[45] = {0, 1}, t[45] = {0, 3};
void fun()
{
    for(int i = 2; i <= 40; i++)
    {
        a[i] = (a[i - 1] + b[i - 1])*2;
        b[i] = a[i - 1];
        t[i] = a[i] + b[i];
    }
}
int main()
{
    fun();
    int N;
    while(scanf("%d", &N) != EOF)
        printf("%lld\n", t[N]);
    return 0;
}

解题思路

a[i]代表最后一位不是O，b[i]代表最后一位是O
t[i] = a[i] + b[i]
n = 1

E	O	F

a[1] = 2, b[1] = 1

n = 2

EE	EF	EO
FE	FF	FO
OE	OF

a[2] = 6, b[2] = 2

$$\{\begin{array}{l}a[i]=(a[i-1]+b[i-1])\ast 2\\ b[i]=a[i-1]\\ t[i]=a[i]+b[i]\end{array}$$
解方程
$$\{\begin{array}{l}t[i]=a[i-1]\ast 3+b[i-1]\ast 2\\ t[i]=(a[i-1]+b[i-1])\ast 3-b[i-1]\\ t[i]=t[i-1]\ast 3-b[i-1]\end{array}$$
或者
$$\{\begin{array}{l}t[i]=a[i-1]\ast 3+b[i-1]\ast 2\\ t[i]=(a[i-1]+b[i-1])\ast 2+a[i-1]\\ t[i]=t[i-1]\ast 2+a[i-1]\end{array}$$

总结

递推可以转化为数学方程组问题