矩阵乘法
题目描述
给定一个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
解题思路:
根据线代知识做循环,最后输出判断是否位0,如果为0输出E。
import java.math.BigInteger;
import java.util.Scanner;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int a = sc.nextInt(), b = sc.nextInt();
BigInteger[][] c = new BigInteger[a][a], d = new BigInteger[a][a], e = new BigInteger[a][a];
BigInteger aa;
int n = 0;
for (int i = 0; i < a; i++)
for (int j = 0; j < a; j++) {
n = sc.nextInt();
c[i][j] = BigInteger.valueOf(n);
d[i][j] = BigInteger.valueOf(n);
}
for (int m = 1; m < b; m++) {
for (int i = 0; i < a; i++) {
for (int j = 0; j < a; j++) {
d[i][j] = BigInteger.valueOf(0);
if (m < 2) {
for (int z = 0; z < a; z++) {
d[i][j] = d[i][j].add(c[i][z].multiply(c[z][j]));
}
} else {
for (int z = 0; z < a; z++) {
d[i][j] = d[i][j].add(e[i][z].multiply(c[z][j]));
}
}
}
}
for (int i = 0; i < a; i++) {
for (int j = 0; j < a; j++) {
e[i][j] = d[i][j];
}
}
}
if (b != 0) {
for (int i = 0; i < a; i++) {
for (int j = 0; j < a; j++) {
System.out.print(d[i][j] + " ");
}
System.out.println();
}
} else {
for (int i = 0; i < a; i++) {
for (int j = 0; j < a; j++) {
if (i == j)
System.out.print("1" + " ");
else
System.out.print("0" + " ");
}
System.out.println();
}
}
}
}