演算法訓練 矩陣乘法
阿新 • • 發佈:2019-01-01
Problem:
AcCode:
import java.util.Scanner; public class Main{ public static void main(String[] args) { Scanner in = new Scanner(System.in); int m = in.nextInt(); int s = in.nextInt(); int n = in.nextInt(); int[][] jzA = new int[m][s]; int[][] jzB = new int[s][n]; for (int i = 0; i < jzA.length; i++) { for (int j = 0; j < jzA[i].length; j++) { jzA[i][j] = in.nextInt(); } } for (int i = 0; i < jzB.length; i++) { for (int j = 0; j < jzB[i].length; j++) { jzB[i][j] = in.nextInt(); } } long[][] jzResult = new long[m][n]; for (int i = 0; i < jzA.length; i++) { for (int j = 0; j < jzB[0].length; j++) { long result = 0; for (int j2 = 0; j2 < jzA[i].length; j2++) { result+=jzA[i][j2]*jzB[j2][j]; } jzResult[i][j] = result; } } for (int i = 0; i < jzResult.length; i++) { for (int j = 0; j < jzResult[i].length-1; j++) { System.out.print(jzResult[i][j]+" "); } System.out.println(jzResult[i][jzResult[0].length-1]); } } }