POJ 3233 Matrix Power Series

Matrix Power Series

Time Limit: 3000MS Memory Limit: 131072K

Description

Given a n × n matrix A and a positive integer k, find the sum S = A + A2 + A3 + … + Ak.

Input

The input contains exactly one test case. The first line of input contains three positive integers n (n ≤ 30), k (k ≤ 109) and m (m < 104). Then follow n lines each containing n nonnegative integers below 32,768, giving A’s elements in row-major order.

Output

Output the elements of S modulo m in the same way as A is given.

Sample Input

2 2 4
0 1
1 1

Sample Output

1 2
2 3

思路：

矩阵快速幂难的地方应该是如何确立这个矩阵（其实我也不大会推），这题的矩阵就是
s = | A E|
| 0 E|
怎么这样的话，算一算就知道再a[0][1]这个位置就是所求的解多加一个E(csdn用这种编辑器写不来数学公式，所以这里就不证明了),然后就是用快速矩阵幂来求了，代码中有些细节需要注意，就是最后要减一个E，再用快速矩阵幂的时候要把指数加1（代码不同，注意点也不同，我讲的我这个代码）。

#include <iostream>
#include <vector> 
using namespace std;
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;
int n, k, mod;
mat mul(mat a, mat b) {
	mat c(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 < a.size(); k++) {
				c[i][j] = (c[i][j] + a[i][k] * b[k][j]) % mod;
			}
		}
	}
	return c;
}
mat pow(mat a, int k) {
	mat b(a.size(), vec(a[0].size()));
	for (int i = 0; i < a.size(); i++) {
		b[i][i] = 1;
	}
	while (k) {
		if (k & 1) b = mul(a, b);
		a = mul(a, a);
		k >>= 1;
	}
	return b;
}
int main() {
	scanf("%d %d %d", &n, &k, &mod);
	mat a(n * 2, vec(n * 2));
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < n; j++) {
			scanf("%lld", &a[i][j]);
		}
		a[i + n][i + n] = a[i][i + n] = 1;
	}
	a = pow(a, k + 1);
	for (int i = 0; i < n; i++) a[i][i + n] = (a[i][i + n] + mod - 1) % mod; 
	for (int i = 0; i < n; i++) {
		for (int j = n; j < 2 * n; j++) {
			if (j != n) printf(" ");
			printf("%d", a[i][j]);
		}
		printf("\n");
	}
	return 0;
}