蓝桥杯 ALGO-86 矩阵乘法

题意：

给两个矩阵 让你求乘法后的结果

代码：

考虑是否有更高效的算法 这个复杂度有点高

import java.util.Scanner;

public class Main{
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		int m = sc.nextInt();
		int s = sc.nextInt();
		int n = sc.nextInt();
		int[][] a = new int[m][s];
		int[][] b = new int[s][n];
		for (int i = 0; i < a.length; i++) {
			for (int j = 0; j < a[i].length; j++) {
				a[i][j] = sc.nextInt();
			}
		}
		for (int i = 0; i < b.length; i++) {
			for (int j = 0; j < b[i].length; j++) {
				b[i][j] = sc.nextInt();
			}
		}
		
		int[][] c = new int[m][n];
		for (int i = 0; i < c.length; i++) {
			for (int j = 0; j < c[i].length; j++) {
				for (int k = 0; k < s; k++) {
					c[i][j] += a[i][k]*b[k][j];
				}
				System.out.print(c[i][j]+" ");
			}
			System.out.println();
		}
	}
}