C++-蓝桥杯-矩阵乘法[快速幂]

忘了改矩阵的大小居然还有33分，我醉了

 #include <cstdio>
 const int N=;
 struct Matrix{int a[N][N];};
 int n,m;
 Matrix A,O,I;
 Matrix Mul(Matrix A,Matrix B){
     Matrix C=O;
     for(int i=;i<=n;i++)
         for(int j=;j<=n;j++)
             for(int k=;k<=n;k++)
                 C.a[i][j]+=A.a[i][k]*B.a[k][j];
     return C;
 }
 Matrix Pow(Matrix A,int n){
     Matrix B=I;
     for(;n;n>>=,A=Mul(A,A))if(n&)B=Mul(B,A);
     return B;
 }
 int main(){
     for(int i=;i<N;i++)for(int j=;j<N;j++)O.a[i][j]=,I.a[i][j]=(i==j);
     scanf("%d%d",&n,&m);
     for(int i=;i<=n;i++)for(int j=;j<=n;j++)scanf("%d",&A.a[i][j]);A=Pow(A,m);
     for(int i=;i<=n;i++){for(int j=;j<=n;j++)printf("%d ",A.a[i][j]);puts("");}
     return ;
 }