题解 | 矩阵乘法

import java.util.Scanner;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int x = in.nextInt();
        int y = in.nextInt();
        int z = in.nextInt();
        int[][] a = new int[x + 1][y + 1];
        int[][] b = new int[y + 1][z + 1];
        for (int i = 1; i <= x; i++) {
            for (int j = 1; j <= y; j++) {
                a[i][j] = in.nextInt();
            }
        }
        for (int i = 1; i <= y; i++) {
            for (int j = 1; j <= z; j++) {
                b[i][j] = in.nextInt();
            }
        }
        for(int i = 1; i <= x; i++){            
            for(int j = 1; j <= z; j++){
                int sum = 0;
                for(int c = 1; c <= y; c++){
                    sum += (a[i][c] * b[c][j]);
                }
                System.out.print(sum);
                if(j == z ){
                    System.out.println();
                }else{
                    System.out.print(" ");
                } 
            }
            
                
        }
    }
}