51nod1113(矩阵快速幂模板)

题目链接：http://www.51nod.com/onlineJudge/questionCode.html#!problemId=1113

题意：中文题诶～

思路：矩阵快速幂模板

代码：

 #include <iostream>
 #define ll long long
 using namespace std;

 const int mod = 1e9+;
 const int MAXN = 1e2+;
 int n, m;

 typedef struct node{
     ll x[MAXN][MAXN];
 }matrix;

 matrix matrix_multi(matrix a, matrix b){
     matrix c;
     for(int i=; i<n; i++){
         for(int j=; j<n; j++){
             ll cnt=;
             for(int k=; k<n; k++){
                 cnt += a.x[i][k]*b.x[k][j];
                 if(cnt >= mod) cnt %= mod;
             }
             c.x[i][j] = cnt;
         }
     }
     return c;
 }

 matrix get_pow(matrix tmp, int m){
     matrix ans;
     for(int i=; i<n; i++){
         for(int j=; j<n; j++){
             if(i==j) ans.x[i][j] = ;
         }
     }
     while(m){
         if(m&) ans = matrix_multi(ans, tmp);
         tmp = matrix_multi(tmp, tmp);
         m >>= ;
     }
     return ans;
 }

 int main(void){
     matrix cnt;
     cin >> n >> m;
     for(int i=; i<n; i++){
         for(int j=; j<n; j++){
             cin >> cnt.x[i][j];
         }
     }
     matrix tmp = get_pow(cnt, m);
     for(int i=; i<n; i++){
         for(int j=; j<n; j++){
             cout << tmp.x[i][j] << " ";
         }
         cout << endl;
     }
     return ;
 }