-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmultiplying_matrixes.cpp
102 lines (81 loc) · 1.68 KB
/
multiplying_matrixes.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
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
// Author: Jakub Pawlina
// Algorithm: Multiplying matrixes
#include <bits/stdc++.h>
struct Matrix
{
int columns;
int rows;
int values[100][100];
};
Matrix multiply(Matrix first_matrix, Matrix second_matrix)
{
Matrix result_matrix;
result_matrix.rows = first_matrix.rows;
result_matrix.columns = second_matrix.columns;
if (first_matrix.columns != second_matrix.rows)
{
std::cout << "Cannot multiply!\n";
return result_matrix;
}
for (size_t i = 0; i < result_matrix.rows; ++i)
{
for (size_t j = 0; j < result_matrix.columns; ++j)
{
int result = 0;
for (size_t k = 0; k < first_matrix.columns; ++k)
{
result += first_matrix.values[i][k] * second_matrix.values[k][j];
}
result_matrix.values[i][j] = result;
}
}
return result_matrix;
}
int32_t main()
{
std::ios_base::sync_with_stdio(false);
std::cin.tie(NULL);
std::cout.tie(NULL);
Matrix first_matrix;
std::cin >> first_matrix.rows >> first_matrix.columns;
for (size_t i = 0; i < first_matrix.rows; ++i)
{
for (size_t j = 0; j < first_matrix.columns; ++j)
{
std::cin >> first_matrix.values[i][j];
}
}
Matrix second_matrix;
std::cin >> second_matrix.rows >> second_matrix.columns;
for (size_t i = 0; i < second_matrix.rows; ++i)
{
for (size_t j = 0; j < second_matrix.columns; ++j)
{
std::cin >> second_matrix.values[i][j];
}
}
Matrix result_matrix = multiply(first_matrix, second_matrix);
for (size_t i = 0; i < result_matrix.rows; ++i)
{
for (size_t j = 0; j < result_matrix.columns; ++j)
{
std::cout << result_matrix.values[i][j] << ' ';
}
std::cout << '\n';
}
return 0;
}
/*
SAMPLE
Input:
2 3
2 1 3
-1 4 0
3 3
1 3 2
-2 0 1
5 -3 2
Output:
15 -3 11
-9 -3 2
*/