HJ69 矩阵乘法

法一

import java.util.*;public class Main {public static void main(String[] args) {Scanner sc = new Scanner(System.in);while (sc.hasNext()) {int x = sc.nextInt();int y = sc.nextInt();int z = sc.nextInt();int[][] arr1 = new int[x][y];int[][] arr2 = new int[y][z];for (int i = 0 ; i < x ; i++) {for (int j = 0 ; j < y ; j++) {arr1[i][j] = sc.nextInt();}}for (int i = 0 ; i < y ; i++) {for (int j = 0 ; j < z ; j++) {arr2[i][j] = sc.nextInt();}}int[][] newArr = new int[x][z];for (int i = 0 ; i < x ; i++) {for (int j = 0 ; j < z ; j++) {for (int k = 0 ; k < y ; k++) {newArr[i][j] += arr1[i][k] * arr2[k][j];}}}for (int i = 0 ; i < x ; i++) {for (int j = 0 ; j < z ; j++) {System.out.print(newArr[i][j] + " ");}System.out.println();}}}
}