问题描述
给定一个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
package com.quz._01_基础练习;
import java.util.Arrays;
import java.util.Scanner;
public class _17_矩阵乘法 {
public static int N;
public static int M;
public static void main(String[] args) {
Scanner inp = new Scanner(System.in);
String[] strings = inp.nextLine().split(" ");
N = Integer.parseInt(strings[0]);
M = Integer.parseInt(strings[1]);
int[][] alls = new int[N][M];
for (int i = 0; i < M; i++) {
Scanner inpItem = new Scanner(System.in);
String[] arrItem = inpItem.nextLine().split(" ");
int[] intItem = new int[N];
for (int j = 0; j < arrItem.length; j++) {
intItem[j] = Integer.parseInt(arrItem[j]);
}
alls[i] = intItem;
}
for (int i = 0; i < M-1; i++) {
alls = getReq(alls);
}
for (int[] is : alls) {
System.out.println(Arrays.toString(is));
}
}
public static int tmpChange(int[] arr1, int[] arr2) {
int total = 0;
for (int i = 0; i < N; i++) {
total += arr1[i] * arr2[i];
}
return total;
}
public static int[][] getReq(int[][] alls) {
int[][] req = new int[N][N];
int[][] h = new int[N][N];
for (int j = 0; j < N; j++) {
for (int j2 = 0; j2 < N; j2++) {
h[j][j2] = alls[j2][j];
}
}
for (int i = 0; i < N; i++) {
int[] l = alls[i];
for (int j = 0; j < N; j++) {
int[] tmpArr = h[j];
req[i][j] = tmpChange(l, tmpArr);
}
}
return req;
}
}