Matrix Power Series
Time Limit: 3000MS | Memory Limit: 131072K | |
Total Submissions: 17793 | Accepted: 7515 |
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
Source
POJ Monthly--2007.06.03, Huang, Jinsong
#include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
struct Matrax {
int map[33][33];
} per, A;
int n,m,k;
void init(){
for( int i = 0 ; i < n ; ++i ){
for( int j = 0 ; j < n ; ++j ){
scanf("%d",&A.map[i][j]);
A.map[i][j] %= m;
per.map[i][j] = ( i == j );
}
}
}
Matrax Multi( Matrax a , Matrax b ){ // a*b
Matrax c;
for( int i = 0 ; i < n ; ++i ){
for( int j = 0 ; j < n ; ++j ){
c.map[i][j] = 0;
for( int k = 0 ; k < n ; ++k )
c.map[i][j] += ( a.map[i][k] * b.map[k][j] ) % m;
c.map[i][j] %= m;
}
}
return c;
}
Matrax Power( int k ){ //A^k%m
Matrax ans = per, p = A;
while( k ){
if( k & 1 )
ans = Multi(ans, p);
p = Multi(p, p);
k >>= 1;
}
return ans;
}
Matrax Add( Matrax a , Matrax b ){ // a+b
Matrax c;
for( int i = 0 ; i < n ; ++i )
for( int j = 0 ; j < n ; ++j )
c.map[i][j] = ( a.map[i][j] + b.map[i][j] ) % m;
return c;
}
Matrax MatraxSum( int k ){ //A+A^2+A^3+ …+A^k
if( k == 1 )
return A;
Matrax temp , b;
temp = MatraxSum(k/2);
if( k & 1 ){
b = Power( k / 2 + 1 );
temp = Add( temp , Multi( temp , b ) );
temp = Add( temp , b );
}
else{
b = Power( k / 2 );
temp = Add( temp , Multi( temp , b ) );
}
return temp;
}
int main(){
while( scanf("%d %d %d",&n,&k,&m)!=EOF ){
init();
Matrax ans = MatraxSum(k);
for( int i = 0 ; i < n ; ++i ){
for( int j = 0 ; j < n-1 ; ++j )
printf("%d ",ans.map[i][j]);
printf("%d\n",ans.map[i][n-1]);
}
}
return 0;
}