描述
给定一个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的值
输入样例:
2 2
1 2
3 4
输出
输出描述:
输出共N行,每行N个整数,表示A的M次幂所对应的矩阵。相邻的数之间用一个空格隔开
输出样例:
7 10
15 22
输入样例 1
参考上文
输出样例 1
参考上文
提示
HINT:时间限制:1.0s 内存限制:512.0MB
来源
蓝桥杯练习系统 ID: 58 原题链接: http://lx.lanqiao.cn/problem.page?gpid=T58
思路:
了解矩阵乘法的规则,注意0次方时的答案
代码:
import java.util.Scanner;
public class old1059 {
public static void main(String[] args) {
int numCount;
int factorial;
Scanner input = new Scanner(System.in);
numCount = input.nextInt();
factorial = input.nextInt();
int[][] num = new int[numCount][numCount];
for (int i = 0; i < numCount; i++) {
for (int j = 0; j < numCount; j++) {
num[i][j] = input.nextInt();
}
}
//0次方
if (factorial == 0) {
for (int i = 0; i < numCount; i++) {
for (int j = 0; j < numCount; j++) {
if(i==j) System.out.printf("1 ");
else System.out.printf("0 ");
}
System.out.println();
}
return;
}
int count = 0;
int[][] newNum = new int[numCount][numCount];
int[][] domeNum = new int[numCount][numCount];
//初始化
for (int i = 0; i < numCount; i++) {
for (int j = 0; j < numCount; j++) {
newNum[i][j] = num[i][j];
}
}
//n次方
while (count < factorial - 1) {
for (int i = 0; i < numCount; i++) {
int c = 0;
for (int j = 0; j < numCount; j++) {
int sum = 0;
for (int k = 0; k < numCount; k++) {
sum += newNum[i][k] * num[k][j];
}
domeNum[i][c++] = sum;
}
}
newNum = domeNum;
domeNum = new int[numCount][numCount];
count++;
}
for (int i = 0; i < numCount; i++) {
for (int j = 0; j < numCount; j++) {
System.out.printf("%d ", newNum[i][j]);
}
System.out.println();
}
}
}