题解 | #矩阵幂#C暴力求解

#include<stdio.h>
int main(){
    int n,k;
    while(scanf("%d",&n)!=EOF){
        scanf("%d",&k);
        int a[n][n];
        int b[n*n];
        int d[n][n];
        int x=0,y=0,sum=0;
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                scanf("%d",&a[i][j]);
            }
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                d[i][j]=a[i][j];
            }
        }
        while(--k){
            for(int i=0;i<n;i++){
                for(int e=0;e<n;e++){
                    for(int j=0;j<n;j++){
                        sum=sum+a[i][j]*d[j][e];
                    }
                    b[x]=sum;
                    x++;
                    sum=0;
                }
            }
            for(int i=0;i<n;i++){
                for(int j=0;j<n;j++){
                    a[i][j]=b[y];
                    y++;
                }
            }
            x=0;
            y=0;
        }
        for(int i=0;i<n;i++){
            for(int j=0;j<n;j++){
                printf("%d",a[i][j]);
                if(j==n-1)
                {
                    printf("\n");
                }
                else{
                    printf(" ");
                }
            }
        }
    }
    return 0;
}