-
Notifications
You must be signed in to change notification settings - Fork 3
/
MatrixMultiplication.java
53 lines (47 loc) · 1.59 KB
/
MatrixMultiplication.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
import java.util.Scanner;
public class MatrixMultiplication {
public static void main(String[] args) {
Scanner scanner = new Scanner(System.in);
System.out.print("Enter row and column of Matrix A : ");
int m = scanner.nextInt();
int n = scanner.nextInt();
System.out.print("Enter row and column of Matrix B : ");
int n1 = scanner.nextInt();
int k = scanner.nextInt();
if(n1 != n){
System.out.println("Cannot perform multiplication on A and B");
}
else{
System.out.println("Enter Matrix A");
int[][] A = new int[m][n];
for(int i=0; i<m;i++){
for(int j=0; j<n;j++){
A[i][j] = scanner.nextInt();
}
}
System.out.println("Enter Matrix B");
int[][] B = new int[n][k];
for(int i=0; i<n;i++){
for(int j=0; j<k;j++){
B[i][j] = scanner.nextInt();
}
}
int[][] R = new int[m][k];
for(int i=0 ; i<m ;i++){
for(int j=0 ; j<k ; j++){
R[i][j] = 0;
for(int l=0 ; l<n ; l++){
R[i][j] = R[i][j] + (A[i][l] * B[l][j]);
}
}
}
System.out.println("Resultant Matrix");
for(int i=0 ; i<m ;i++){
for(int j=0 ; j<k ; j++){
System.out.print(R[i][j]+" ");
}
System.out.println();
}
}
}
}