poj3233（矩阵幂）

/*
translation:
	给定矩阵A，求A + A^2 + ... + A^k
solution:
	dp,矩阵幂
note:
	* 关键在于矩阵递推式的构造，可以先写出所有的状态递推关系，然后根据这些递推关系构造出矩阵的递推式。
date:
	2017.1.17
*/
#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

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

int n, m;
ll k;

mat mul(mat &a, mat &b)
{
    mat ans(a.size(), vec(b[0].size()));
    for(int i = 0; i < a.size(); i++) {
        for(int j = 0; j < b[0].size(); j++) {
            for(int k = 0; k < b.size(); k++) {
                ans[i][j] = (ans[i][j] + a[i][k]*b[k][j]) % m;
            }
        }
    }
    return ans;
}

mat pow(mat a, ll k)   //求矩阵a的k次方
{
    mat temp(a.size(), vec(a.size()));
    for(int i = 0; i < a.size(); i++)    temp[i][i] = 1;

    while(k) {
        if(k & 1)   temp = mul(a, temp);
        a = mul(a, a);
        k /= 2;
    }
    return temp;
}

int main()
{
	//freopen("in.txt", "r", stdin);
    while(cin >> n >> k >> m) {
		mat a(2*n, vec(2*n));
		mat b(n, vec(n));
		for(int i = 0; i < n; i++) {
			for(int j = 0; j < n; j++) {
				cin >> a[i][j];
				b[i][j] = a[i][j];
			}
		}

		for(int i = n; i < 2*n; i++) 	a[i][i - n] = 1;
		for(int i = n; i < 2*n; i++)	a[i][i] = 1;

		a = pow(a, k);

		mat ans(n, vec(n));
		for(int i = n; i < 2*n; i++) {
			for(int j = 0; j < n; j++) {
				ans[i - n][j] = a[i][j];
			}
		}

		ans = mul(b, ans);

		for(int i = 0; i < n; i++) {
			for(int j = 0; j < n; j++) {
				cout << ans[i][j] << (j + 1 == n ? '\n' : ' ');
			}
		}
    }
    return 0;
}