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

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

#include <cstdio>
const int N=35;
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=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            for(int k=1;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>>=1,A=Mul(A,A))if(n&1)B=Mul(B,A);
    return B;
}
int main(){
    for(int i=0;i<N;i++)for(int j=0;j<N;j++)O.a[i][j]=0,I.a[i][j]=(i==j);
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)scanf("%d",&A.a[i][j]);A=Pow(A,m);
    for(int i=1;i<=n;i++){for(int j=1;j<=n;j++)printf("%d ",A.a[i][j]);puts("");}
    return 0;
}