题解 | #矩阵乘法#

import java.util.Scanner;
public class Main{
    public static void main(String[] args){
        Scanner sc = new Scanner(System.in);
        while(sc.hasNextInt()){
            int x = sc.nextInt();
            int y = sc.nextInt();
            int z = sc.nextInt();
            int[][] t1 = new int[x][y];
            int[][] t2 = new int[y][z];
            int[][] t3 = new int[x][z];
            for(int i=0; i<x; i++){
                for(int j=0; j<y; j++){
                    t1[i][j] = sc.nextInt();
                }
            }
            for(int i=0; i<y; i++){
                for(int j=0; j<z; j++){
                    t2[i][j] = sc.nextInt();
                }
            }
            for(int i=0; i<x; i++){
                for(int j=0; j<z; j++){
                    t3[i][j] = mul(i, j, t1, t2);
                }
            }
            for (int i = 0; i < x; i++) {
                for (int j = 0; j < z; j++) {
                    System.out.print(t3[i][j] + " ");
                }
                System.out.println();
            }
        }
    }
    public static int mul(int a, int b, int[][] A, int[][] B){
        int sum = 0;
        for(int i=0; i<B.length; i++){
            sum += A[a][i]*B[i][b];
        }
        return sum;
    }
}