题解 | #矩阵乘法#

import java.util.*;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        if (sc.hasNext()) {
            int x = sc.nextInt();
            int y = sc.nextInt();
            int z = sc.nextInt();
            int[][] aArr = new int[x][y];
            int[][] bArr = new int[y][z];
            for (int i = 0; i < x; i++) {
                for (int j = 0; j < y; j++) {
                    aArr[i][j] = sc.nextInt();
                }
            }
            for (int i = 0; i < y; i++) {
                for (int j = 0; j < z; j++) {
                    bArr[i][j] = sc.nextInt();
                }
            }
            for (int i = 0; i < x; i++) {
                for (int j = 0; j < z; j++) {
                    int result = 0;
                    for (int k = 0; k < y; k++) {
                        result += aArr[i][k] * bArr[k][j];
                    }
                    System.out.print(result + " ");
                }
                System.out.println();
            }
        }
    }
}