poj3233矩阵快速幂运算

//此题不是求K次幂而是求累乘和，如果逐加起来复杂度变成O(N^3*K)

//写出递推公式的时候矩阵是A与Sk之间的关系

#include <iostream>
#include <vector>
using namespace std;
typedef vector<int>vec;
typedef vector<vec>mat;

static int n,k;
static int M;
static mat A;
static 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;
}

static mat pow(mat A,int n){
	mat B(A.size(),vec(A.size()));
	for (int i=0;i<A.size();++i)
		B[i][i] = 1;

	while(n>0){
		if (n&1)
			B = mul(B,A);
		A = mul(A,A);
		n>>=1;
	}

	return B;
}

int main(){
	scanf("%d %d %d",&n,&k,&M);
	A = mat(n+2,vec(n+2));
	for (int i=0;i<n;++i)
	 for (int j=0;j<n;++j)
	  scanf("%d",&A[i][j]);
	
	mat B(n*2,vec(n*2));//构造复合矩阵子元素是矩阵A
	for (int i=0;i<n;++i)
	{
		for (int j=0;j<n;++j)
		 B[i][j] = A[i][j];

		B[n+i][i] = B[n+i][n+i] = 1;
	}

	B = pow(B,k+1);
	for (int i=0;i<n;++i)
	{
		for (int j=0;j<n;++j)
		{
			int a = B[n+i][j]%M;
			//减去I
			if (i==j)
			 a = (a+M-1)%M;//避免负数因为I是构造的所以要减去
			printf("%d%c",a,j+1==n?'\n':' ');
		}
	}

	return 0;
}