POJ 2663 Tri Tiling 线性递推 矩阵快速幂

题意：用1*2的格子填满3*N的棋盘，问有多少种方案数。

思路：同前面一篇文章，就不分析啦。

代码如下：

#include <cstdio>
#include <vector>

using namespace std;

typedef vector<int> vec;
typedef vector<vec> mat;
typedef long long ll;

int N;
mat A(8,vec(8));

mat mul(mat & A, mat &B)
{
	mat C(A.size(), vec(B[0].size()));
	for (int i = 0; i < A.size(); ++i)
		for (int k = 0; k < B.size(); k++)
			for (int j = 0; j < B[0].size(); ++j)
				C[i][j] = (C[i][j] + A[i][k] * B[k][j]);
	return C;
}
mat pow(mat A, ll n)
{
	mat B(A.size(), vec(A.size()));
	for (int i = 0; i < A.size(); ++i)
		B[i][i] = 1;
	while (n){
		if (n & 1) B = mul(B, A);
		A = mul(A, A);
		n >>= 1;
	}
	return B;
}

void dfs(int l , int now, int pre)
{
    if(l > 3) return;
    if(l == 3){
        A[now][pre] = 1;
        return;
    }
    dfs(l+1,(now<<1)|1,pre<<1);
    dfs(l+1,(now<<1),(pre<<1)|1);
    dfs(l+2,(now<<2)|3,(pre<<2)|3);
    return;
}


int main(void)
{
    //freopen("input.txt","r",stdin);
    dfs(0,0,0);
    while(scanf("%d",&N),N != -1){
        mat B(8,vec(8));
        B = pow(A,N);
        printf("%d\n",B[7][7]);
    }


    return 0;
}