-
Notifications
You must be signed in to change notification settings - Fork 16
/
MatrixPower.cpp
82 lines (69 loc) · 1.35 KB
/
MatrixPower.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
#include <bits/stdc++.h>
#define lli long long int
#define mod 1000000007
using namespace std;
//VJ's code
vector < vector < int > > mul(vector < vector < int > >& A, vector < vector < int > >& B)
{
vector< vector < int > > C(A.size(), vector<int>(A.size()));
for ( int i = 0 ; i < A.size() ; ++ i)
{
for ( int j = 0 ; j < A.size() ; ++ j)
{
C[i][j] = 0;
for ( int k = 0 ; k < A.size() ; ++ k)
{
C[i][j] += ((A[i][k] % mod) * (B[k][j] % mod) % mod);
}
}
}
return C;
}
void power(vector< vector< int > > &matrix, int n, int d)
{
vector < vector < int > > res(d, vector<int> (d));
for ( int i = 0 ; i < d ; ++ i)
res[i][i] = 1;
while ( n )
{
if(!(n & 1))
{
matrix = mul(matrix,matrix);
n /= 2;
}
else
{
res = mul(res,matrix);
n --;
}
}
matrix = res;
}
void printMatrix(vector < vector < int > >& matrix, int d)
{
for ( int i = 0 ; i < d ; ++ i){
for ( int j = 0 ; j < d ; ++ j){
cout<<matrix[i][j]<<" ";
}
cout<<"\n";
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int t,d,n;
cin>>t;
while(t --)
{
cin>>d>>n;
vector < vector < int > > matrix(d, vector<int>(d));
for ( int i = 0 ; i < d ; ++ i)
for( int j = 0 ; j < d ; ++ j)
cin>>matrix[i][j];
power(matrix,n,d);
printMatrix(matrix,d);
}
return 0;
}