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
思路:大神的两种写法;
一开始按照求数的前n相和去求,很明显不对,网上给两种写法,我觉得按照等比矩阵的思想,构造矩阵应该是比较容易和普及的写法。
仔细理解一下感觉很好懂,把矩阵扩大4倍相乘(四个部分分别是一个矩阵代表),先把A看成数字,就是一个矩阵进行相乘,右上的部分就是答案。其实A是矩阵,那就代入原矩阵,矩阵套着矩阵,好强大。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int mod, len;
struct mat {
int m[105][105];
}ans, base;
mat mat_mul(mat A, mat B) {
mat C;
for(int i = 1; i <= len; i++) {
for(int j = 1; j <= len; j++) {
C.m[i][j] = 0;
for(int k = 1; k <= len; k++) {
C.m[i][j] = (C.m[i][j] + A.m[i][k] * B.m[k][j]) % mod;
}
}
}
return C;
}
mat mat_pow(mat A, mat B, int n) {
while(n) {
if(n & 1) B = mat_mul(B, A);
A = mat_mul(A, A);
n >>= 1;
}
return B;
}
int main() {
int n, k;
while(scanf("%d %d %d", &n, &k, &mod) != EOF) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
scanf("%d", &ans.m[i][j]);
}
}
for(int i = 1; i <= n; i++) {
for(int j = n + 1; j <= n * 2; j++) {
if(i + n == j)
ans.m[i][j] = 1;
else ans.m[i][j] = 0;
}
}
for(int i = n + 1; i <= n * 2; i++) {
for(int j = 1; j <= n; j++) {
ans.m[i][j] = 0;
}
}
for(int i = n + 1; i <= n * 2; i++) {
for(int j = n + 1; j <= n * 2; j++) {
if(i == j)
ans.m[i][j] = 1;
else ans.m[i][j] = 0;
}
}
for(int i = 1; i <= n * 2; i++) {
for(int j = 1; j <= n * 2; j++) {
if(i == j)
base.m[i][j] = 1;
else base.m[i][j] = 0;
}
}
len = n * 2;
ans = mat_pow(ans, base, k + 1);
for(int i = 1; i <= n; i++) {
for(int j = n + 1; j <= len; j++) {
if(i + n == j)
ans.m[i][j]--;
while(ans.m[i][j] < 0) {
ans.m[i][j] += mod;
}
}
}
for(int i = 1; i <= n; i++) {
for(int j = n + 1; j < len; j++) {
printf("%d ", ans.m[i][j]);
}
printf("%d\n", ans.m[i][len]);
}
}
return 0;
}
这是构造矩阵的另一种表达,右上部分把单位矩阵换成A矩阵,最后就不用减了。
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
int mod, len;
struct mat {
int m[105][105];
}ans, base;
mat mat_mul(mat A, mat B) {
mat C;
for(int i = 1; i <= len; i++) {
for(int j = 1; j <= len; j++) {
C.m[i][j] = 0;
for(int k = 1; k <= len; k++) {
C.m[i][j] = (C.m[i][j] + A.m[i][k] * B.m[k][j]) % mod;
}
}
}
return C;
}
mat mat_pow(mat A, mat B, int n) {
while(n) {
if(n & 1) B = mat_mul(B, A);
A = mat_mul(A, A);
n >>= 1;
}
return B;
}
int main() {
int n, k;
while(scanf("%d %d %d", &n, &k, &mod) != EOF) {
for(int i = 1; i <= n; i++) {
for(int j = 1; j <= n; j++) {
scanf("%d", &ans.m[i][j]);
}
}
for(int i = 1; i <= n; i++) {
for(int j = n + 1; j <= n * 2; j++) {
ans.m[i][j] = ans.m[i][j - n];
}
}
for(int i = n + 1; i <= n * 2; i++) {
for(int j = 1; j <= n; j++) {
ans.m[i][j] = 0;
}
}
for(int i = n + 1; i <= n * 2; i++) {
for(int j = n + 1; j <= n * 2; j++) {
if(i == j)
ans.m[i][j] = 1;
else ans.m[i][j] = 0;
}
}
for(int i = 1; i <= n * 2; i++) {
for(int j = 1; j <= n * 2; j++) {
if(i == j)
base.m[i][j] = 1;
else base.m[i][j] = 0;
}
}
len = n * 2;
ans = mat_pow(ans, base, k);
for(int i = 1; i <= n; i++) {
for(int j = n + 1; j < len; j++) {
printf("%d ", ans.m[i][j]);
}
printf("%d\n", ans.m[i][len]);
}
}
return 0;
}