-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMain.java
More file actions
195 lines (186 loc) · 5.6 KB
/
Main.java
File metadata and controls
195 lines (186 loc) · 5.6 KB
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
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
import java.util.Scanner;
public class Main{
int [][] matrix;
Main(int [][] mat)
{
matrix=mat;
}
public static Main add(Main a,Main b)
{
if (a.matrix.length==0) return null;
int[][] c = new int[a.matrix.length][a.matrix[0].length];
for(int i=0;i<a.matrix.length;i++){
for(int j=0;j<a.matrix[0].length;j++){
c[i][j]=a.matrix[i][j]+b.matrix[i][j]; //use - for subtraction
}
}
return new Main(c);
}
public static int[][] matrixMultiplication(
int[][] matrix1, int rows1, int cols1,
int[][] matrix2, int rows2, int cols2)
throws Exception
{
// Required condition for matrix multiplication
if (cols1 != rows2) {
throw new Exception("Invalid matrix given.");
}
// create a result matrix
int resultMatrix[][] = new int[rows1][cols2];
// Core logic for 2 matrices multiplication
for (int i = 0; i < resultMatrix.length; i++)
{
for (int j = 0;
j < resultMatrix[i].length;
j++)
{
for (int k = 0; k < cols1; k++)
{
resultMatrix[i][j]
+= matrix1[i][k] * matrix2[k][j];
}
}
}
return resultMatrix;
}
public static Main multiply(Main a,Main b)
{
if (a.matrix.length == 0||b.matrix.length==0) return null;
try {
return new Main(matrixMultiplication(a.matrix,a.matrix.length,a.matrix[0].length,b.matrix,b.matrix.length,b.matrix[0].length));
} catch (Exception e) {
return null;
}
}
public static Main transpose(Main m)
{
if (m.matrix.length==0) return null;
int[][] B = new int[m.matrix[0].length][m.matrix.length];
int i, j;
for (i = 0; i < m.matrix[0].length; i++)
for (j = 0; j < m.matrix.length; j++)
B[i][j] = m.matrix[j][i];
return new Main(B);
}
public static Main rotate(Main m)
{
int [][] matrix = m.matrix;
int n = matrix.length;
if (n == 1) {
return null;
}
for (int k=0;k<3;k++){
for (int i = 0; i < n / 2; i++) {
for (int j = i; j < n - 1 - i; j++) {
int temp = matrix[i][j];
matrix[i][j] = matrix[n - 1 - j][i];
matrix[n - 1 - j][i] = matrix[n - 1 - i][n - 1 - j];
matrix[n - 1 - i][n - 1 - j] = matrix[j][n - 1 - i];
matrix[j][n - 1 - i] = temp;
}
}
}
return new Main(matrix);
}
public void print()
{
for(int i=0;i<matrix.length;i++)
{
for(int j=0;j<matrix[0].length;j++)
{
System.out.print(matrix[i][j]+" ");
}
System.out.println();
}
}
public static void main(String[] args) {
Scanner s=new Scanner(System.in);
int option=s.nextInt();
if(option==1)
{
int r1=s.nextInt();
int c1=s.nextInt();
int [][] m1=new int[r1][c1];
for(int i=0;i<r1;i++)
{
for(int j=0;j<c1;j++)
{
m1[i][j]=s.nextInt();
}
}
Main mat1=new Main(m1);
int r2=s.nextInt();
int c2=s.nextInt();
int [][] m2=new int[r2][c2];
for(int i=0;i<r2;i++)
{
for(int j=0;j<c2;j++)
{
m2[i][j]=s.nextInt();
}
}
Main mat2=new Main(m2);
Main ans=Main.add(mat1,mat2);
ans.print();
}
else if (option==2)
{
int r1=s.nextInt();
int c1=s.nextInt();
int [][] m1=new int[r1][c1];
for(int i=0;i<r1;i++)
{
for(int j=0;j<c1;j++)
{
m1[i][j]=s.nextInt();
}
}
Main mat1=new Main(m1);
int r2=s.nextInt();
int c2=s.nextInt();
int [][] m2=new int[r2][c2];
for(int i=0;i<r2;i++)
{
for(int j=0;j<c2;j++)
{
m2[i][j]=s.nextInt();
}
}
Main mat2=new Main(m2);
Main ans=Main.multiply(mat1,mat2);
ans.print();
}
else if(option==3)
{
int r1=s.nextInt();
int c1=s.nextInt();
int [][] m1=new int[r1][c1];
for(int i=0;i<r1;i++)
{
for(int j=0;j<c1;j++)
{
m1[i][j]=s.nextInt();
}
}
Main mat1=new Main(m1);
Main ans=Main.transpose(mat1);
ans.print();
}
else
{
int r1=s.nextInt();
int c1=s.nextInt();
int [][] m1=new int[r1][c1];
for(int i=0;i<r1;i++)
{
for(int j=0;j<c1;j++)
{
m1[i][j]=s.nextInt();
}
}
Main mat1=new Main(m1);
Main ans=Main.rotate (mat1);
ans.print();
}
}
}