1127: 矩阵乘积java

import java.util.Scanner;

public class Main{
    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int m = input.nextInt();
        int p = input.nextInt();
        int n = input.nextInt();
        int[][] arr1 = new int[m][p];
        int[][] arr2 = new int[p][n];

        for (int i = 0; i < m; i++) {
            for (int j = 0; j < p; j++) {
                arr1[i][j] = input.nextInt();
            }
        }

        for (int i = 0; i < p; i++) {
            for (int j = 0; j < n; j++) {
                arr2[i][j] = input.nextInt();
            }
        }


        for (int i = 0; i < m; i++) {
            int sum = 0;
            for (int j = 0; j < n; j++) {
                sum = 0;
                for (int k = 0; k < p; k++) {
                    sum += arr1[i][k]*arr2[k][j];
                }
                System.out.print(sum+" ");
            }
            System.out.println();
            }
    }
}