-
-
Notifications
You must be signed in to change notification settings - Fork 11
/
2d_matrix_multiplication.cpp
77 lines (68 loc) · 1.28 KB
/
2d_matrix_multiplication.cpp
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
/*
2D Matrix Multiplication
*/
#include<iostream>
#include<fstream>
using namespace std;
int main()
{
ifstream file;
file.open("2d_input.txt");
int n1, m1;
file >> n1;
file >> m1;
int arr1[n1][m1];
string line;
getline(file, line);
for (int i = 0; i < n1; i++)
{
for (int j = 0; j < m1; j++)
{
file >> arr1[i][j];
}
getline(file, line);
}
int n2, m2;
file >> n2;
file >> m2;
int arr2[n2][m2];
getline(file, line);
for (int i = 0; i < n2; i++)
{
for (int j = 0; j < m2; j++)
{
file >> arr2[i][j];
}
getline(file, line);
}
file.close();
int ans[n1][m2];
for (int i = 0; i < n1; i++)
{
for (int j = 0; j < m2; j++)
{
ans[i][j] =0;
}
}
for (int i = 0; i < n1; i++)
{
for (int j = 0; j < m2; j++)
{
int sum=0;
for(int k=0; k<n2; k++)
{
sum+=arr1[i][k]*arr2[k][j];
}
ans[i][j] = sum;
}
}
for (int i = 0; i < n1; i++)
{
for (int j = 0; j < m2; j++)
{
cout<<ans[i][j]<<" ";
}
cout<<endl;
}
return 0;
}