rambless
矩阵乘法
https://www.nowcoder.com/practice/ebe941260f8c4210aa8c17e99cbc663b
import java.util.Scanner;
// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
public static void main(String[] args) {
Scanner in = new Scanner(System.in);
// 注意 hasNext 和 hasNextLine 的区别
while (in.hasNextInt()) { // 注意 while 处理多个 case
int x = in.nextInt();
int y = in.nextInt();
int z = in.nextInt();
int[][] A = new int[x][y];
int[][] B = new int[y][z];
for(int i=0; i<x; i++) {
A[i] = new int[y];
for(int j=0; j<y; j++) {
A[i][j] = in.nextInt();
}
}
for(int i=0; i<y; i++) {
B[i] = new int[z];
for(int j=0; j<z; j++) {
B[i][j] = in.nextInt();
}
}
//矩阵相乘
int[][] C = new int[x][z];
for(int i=0; i<x; i++) {
C[i] = new int[z];
for(int j=0; j<z; j++) {
C[i][j] = cal(i, j, A, B, y);
}
}
for(int i=0; i<C.length; i++) {
for(int j=0; j<C[i].length; j++) {
System.out.print(C[i][j] + " ");
}
System.out.println();
}
}
}
private static int cal(int i, int j, int[][] A, int[][] B, int y) {
int sum = 0;
for(int k=0; k<y; k++) {
sum += A[i][k] * B[k][j];
}
return sum;
}
}
