import java.util.Scanner;
public class 矩阵的幂 {
static int n;
static int m;
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
n = sc.nextInt();//n阶行列式
m = sc.nextInt();//幂数
int[][] nn = new int[n][n];
int[][] nm = new int[n][n];//M次幂
//创建
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
nn[i][j] = sc.nextInt();
}
}
if(m==0) {
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
if(i == j) {
nm[i][j] = 1;
}
}
}
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
System.out.print(nm[i][j] + " ");
}
System.out.println();
}
}
for(int i = 0; i < n; i++ ) {
for(int j = 0; j < n; j++) {
nm[i][j] = nn[i][j];
}
}
if(m==1) {
for(int i = 0; i < n; i++) {
for(int j = 0; j < n; j++) {
System.out.print(nn[i][j]);
}
System.out.println();
}
}
if(m > 1) {
for(int w = 1; w < m; w++) {
int arr[][] = new int[n][n];
for(int i = 0; i < n; i++) {
for(int z = 0; z < n; z++) {
int add = 0;
for(int j = 0; j < n; j++) {
add += nn[i][j]*nm[j][z];
}
arr[i][z] = add;
}
}
nm = arr;
}
for(int i = 0; i < n;i++) {
for(int j = 0; j < n; j++) {
System.out.print(nm[i][j] + " ");
}
System.out.println();
}
}
}
}
矩阵的幂运算(Java)
最新推荐文章于 2022-04-13 14:31:30 发布