给定一个N阶矩阵A,输出A的M次幂(M是非负整数)
例如:
A =
1 2
3 4
A的2次幂
7 10
15 22
Input Description
第一行是一个正整数N、M(1< =N< =30, 0< =M< =5),表示矩阵A的阶数和要求的幂数
接下来N行,每行N个绝对值不超过10的非负整数,描述矩阵A的值
Output Description
输出共N行,每行N个整数,表示A的M次幂所对应的矩阵。相邻的数之间用一个空格隔开
Sample Input
2 2
1 2
3 4
Sample Output
7 10
15 22
```#include
int main()
{
int m, n, i, j, k, l;
int a[50][50] = {0};
int b[50][50] = {0};
int c[50][50] = {0};
scanf("%d %d", &n, &m);
for( i = 0; i < n; i++ )
{
for( j = 0; j < n; j++ )
{
scanf("%d", &a[i][j]);
c[i][j] = a[i][j];
b[i][j] = 0;
}
}
while(--m)
{
for( i = 0; i < n; i++ )
{
for( j = 0; j < n; j++ )
{
for( k = 0; k < n; k++ )
{
b[i][j] = b[i][j] + a[i][k] * c[k][j];
}
}
}
for( i = 0; i < n; i++ )
{
for( j = 0; j < n; j++ )
{
c[i][j] = b[i][j];
b[i][j] = 0;
}
}
}
for( i = 0; i < n; i++ )
{
for( j = 0; j < n; j++ )
{
if( j == 0 )
printf("%d", c[i][j]);
else
printf(" %d", c[i][j]);
}
printf("\n");
}
return 0;
}
这个提交显示超时咋办,求大佬指点