问题描述
给定一个N阶矩阵A,输出A的M次幂(M是非负整数)
例如:
A =
1 2
3 4
A的2次幂
7 10
15 22
输入格式
第一行是一个正整数N、M(1<=N<=30, 0<=M<=5),表示矩阵A的阶数和要求的幂数
接下来N行,每行N个绝对值不超过10的非负整数,描述矩阵A的值
输出格式
输出共N行,每行N个整数,表示A的M次幂所对应的矩阵。相邻的数之间用一个空格隔开
样例输入
2 2
1 2
3 4
样例输出
7 10
15 22
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int m = sc.nextInt();
long[][] a = new long[n][n];
long[][] b = new long[n][n];
int i, j;
for (i = 0; i < n; i++)
for (j = 0; j < n; j++)
b[i][j] = a[i][j] = sc.nextLong();
if (m == 0)
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
if (i == j)
System.out.print(1 + " ");
else
System.out.print(0 + " ");
}
System.out.println();
}
else if (m == 1)
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
System.out.print(a[i][j] + " ");
System.out.println();
}
else {
for (int z = 1; z < m; z++) {
long[][] tmp = new long[n][n];
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++) {
long add = 0;
for (int y = 0; y < n; y++) {
add += a[i][y] * b[y][j];
}
tmp[i][j] = add;
}
}
b = tmp;
}
for (i = 0; i < n; i++) {
for (j = 0; j < n; j++)
System.out.print(b[i][j] + " ");
System.out.println();
}
}
}
}