[luoguP3390]【模板】矩阵快速幂

传送门

模板不解释。

——代码

 #include <cstdio>
 #include <cstring>
 #define LL long long

 int n;
 LL k;
 const int p = 1e9 + ;

 struct Matrix
 {
     LL a[][];
     Matrix()
     {
         memset(a, , sizeof(a));
     }
 };

 inline Matrix operator * (const Matrix x, const Matrix y)
 {
     Matrix ans;
     int i, j, k;
     for(i = ; i < n; i++)
         for(j = ; j < n; j++)
             for(k = ; k < n; k++)
                 ans.a[i][j] = (ans.a[i][j] + x.a[i][k] * y.a[k][j]) % p;
     return ans;
 }

 int main()
 {
     int i, j;
     Matrix ans, trs;
     scanf("%d %lld", &n, &k);
     for(i = ; i < n; i++) ans.a[i][i] = ;
     for(i = ; i < n; i++)
         for(j = ; j < n; j++)
             scanf("%lld", &trs.a[i][j]);
     while(k)
     {
         if(k & ) ans = ans * trs;
         trs = trs * trs;
         k >>= ;
     }
     for(i = ; i < n; i++)
     {
         for(j = ; j < n; j++) printf("%d ", ans.a[i][j]);
         puts("");
     }
     return ;
 }