题解 | #矩阵乘法#

import java.util.*;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        int x = sc.nextInt();
        int y = sc.nextInt();
        int z = sc.nextInt();
        int a[][] = new int[x][y];
        int b[][] = new int[y][z];
      //输入a
        for(int i = 0; i < x; i++){
            for(int j = 0; j < y; j++){
                a[i][j] = sc.nextInt();
            }
        }
      //输入b
        for(int i = 0; i < y; i++){
            for(int j = 0; j < z; j++){
                b[i][j] = sc.nextInt();
            }
        }
      //计算
        int re[][] = new int[x][z];
        for(int i = 0; i < x; i++){
            for(int j = 0; j < z; j++){
                for(int u = 0; u < y; u++)
                re[i][j] += a[i][u] * b[u][j];
            }
        }
      //遍历输出
        for(int i = 0; i < x; i++){
            for(int j = 0; j < z; j++){
                System.out.print(re[i][j] + " ");
            }
            System.out.print('\n');
        }
    }
}