题解 | #矩阵乘法#

import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        while (in.hasNextInt()) {
            int x = in.nextInt();
            int y = in.nextInt();
            int z = in.nextInt();

            int[][] matrixA = new int[x][y];
            int[][] matrixB = new int[y][z];

            // 矩阵A
            for (int i = 0; i < x; i++) {
                for (int j = 0; j < y; j++) {
                    matrixA[i][j] = in.nextInt();
                }
            }

            // 矩阵B
            for (int i = 0; i < y; i++) {
                for (int j = 0; j < z; j++) {
                    matrixB[i][j] = in.nextInt();
                }
            }


            // 矩阵C
            int[][] matrixC = 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++) {
                        matrixC[i][j] += matrixA[i][k]*matrixB[k][j];
                    }
                }
            }

            for(int i=0;i<matrixC.length;i++){
                StringBuffer sb = new StringBuffer();
                for(int j=0;j<matrixC[0].length;j++){
                    sb.append(matrixC[i][j]+" ");
                }
                System.out.println(sb.toString().trim());
            }



        }
    }
}