题解 | #矩阵乘法#

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    static int x = 0;
    static int y = 0;
    static int z = 0;
    static int[][] xy = null;
    static int[][] yz = null;
    static int[][] xz = null;

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        x = in.nextInt();
        y = in.nextInt();
        z = in.nextInt();
        xy = new int[x][y];
        yz = new int[y][z];
        xz = new int[x][z];
        for(int i = 0;i<x;i++){
            for(int j=0;j<y;j++){
                xy[i][j] = in.nextInt();
            }
        }
        for(int i = 0;i<y;i++){
            for(int j=0;j<z;j++){
                yz[i][j] = in.nextInt();
            }
        }
        for(int i = 0;i<x;i++){
            for(int j=0;j<z;j++){
                System.out.print(getXZ(i,j) + " ");
            }
            System.out.println();
        }
    }

    public static int getXZ(int i,int j){
        int result = 0;
        for(int k = 0;k<y;k++){
            result = result + xy[i][k] * yz[k][j];
        }
        return result;
    }
}