问题描述
给定一个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 cin=new Scanner(System.in);
int N=cin.nextInt(); //N行
int M=cin.nextInt(); //M次方
long[][] ju=new long[N][N];//定义二维数组
//输入一个N阶矩阵
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
ju[i][j]=cin.nextInt();
}
}
//新矩阵
long[][] xin=new long[N][N];
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
xin[i][j]=ju[i][j];
}
}
int sum=0;
long[][] shu=new long[N][N];
// M次方
for (int m = 1; m < M; m++) {
//矩阵相乘
for (int hang = 0; hang < N; hang++) {
for (int lie = 0; lie < N; lie++) {
for (int k = 0; k < N; k++) {
sum=sum+(int) (xin[hang][k])*(int)(ju[k][lie]);
}
shu[hang][lie]=sum;
sum=0;
}
}
for (int i = 0; i < N; i++) {
for (int j = 0; j < N; j++) {
xin[i][j]=shu[i][j];
}
}
}
if(M==0)
{
for (int hang = 0; hang < N; hang++) {
for (int lie = 0; lie < N; lie++) {
if(lie==hang)
System.out.print("1 ");
else
System.out.print("0 ");
}
System.out.println();
}
}
else if (M==1) {
for (int hang = 0; hang < N; hang++) {
for (int lie = 0; lie < N; lie++) {
System.out.print(ju[hang][lie]+" ");
}
System.out.println();
}
}
else {
for (int hang = 0; hang < N; hang++) {
for (int lie = 0; lie < N; lie++) {
System.out.print(shu[hang][lie]+" ");
}
System.out.println();
}
}
}
}