题解 | #矩阵乘法#

import java.util.*;

// 注意类名必须为 Main, 不要有任何 package xxx 信息
public class Main {
    public static void main(String[]args) {

        Scanner input = new Scanner(System.in);
        int a = input.nextInt();
        int b = input.nextInt();
        int c = input.nextInt();
        int [][]arr1 = new int[a][b];
        int [][]arr2 = new int[b][c];
        int[][]arr3 = new int[c][b];
        while (input.hasNextInt()) {
            for (int i = 0; i < arr1.length; i++) {
                for (int j = 0; j < arr1[i].length; j++) {
                    arr1[i][j] = input.nextInt();
                }
            }
            for (int i = 0; i < arr2.length; i++) {
                for (int j = 0; j < arr2[i].length; j++) {
                    arr2[i][j] = input.nextInt();
                }
            }
            break;
        }

        for (int i = 0; i < arr2.length; i++) {
            for (int j = 0; j < arr2[i].length; j++) {
                arr3[j][i] = arr2[i][j];
            }
        }
        for (int i = 0; i < arr1.length; i++) {

            for (int j = 0; j < arr3.length; j++) {
                int sum = 0;
                sum = count(arr1[i], arr3[j])     ;
                System.out.print(sum + " ");
            }
            System.out.println();
        }
    }
//一维数组相乘
    public static int count(int[]a1, int[]a2) {
        int sum = 0;
        for (int i = 0; i < a1.length; i++) {
            sum += a1[i] * a2[i];
        }
        return sum;
    }
}