矩阵乘法

import java.util.Scanner;


public class MatrixMulti {

	public static void main(String[] args) {
		Scanner sca = new Scanner(System.in);
        int m = sca.nextInt();
        int n = sca.nextInt();
        int k = sca.nextInt();

        int a[][] = new int[m][n];
        int b[][] = new int[n][k];
        int c[][] = new int[m][k];
        //输入a[][]
        for (int i = 0; i < m * n; i++) {
            int x = i / n;
            int y = i % n;
            a[x][y] = sca.nextInt();
        }
        //输入b[][]
        for (int i = 0; i < n * k; i++) { //
            int x = i / k;
            int y = i % k;
            b[x][y] = sca.nextInt();
        }
        //计算c[][]
        for (int i = 0; i < m; i++)  
            for (int j = 0; j < k; j++) {
                int sum = 0;
                for (int flag = 0; flag < n; flag++)
                    sum += a[i][flag] * b[flag][j];
                c[i][j] = sum;
            }
        //输出c[][]
        for (int i = 0; i < m; i++) {
            for (int j = 0; j < k; j++) {
                if (j != k - 1)
                    System.out.print(c[i][j] + " ");
                else
                    System.out.print(c[i][j]);
            }
            System.out.println();
        }
	}

}