forked from rajritu833/Hackerrank-Cplus-solutions
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathoperator-overload.cpp
76 lines (71 loc) · 1.43 KB
/
operator-overload.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
#include <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
using namespace std;
/* Operator Overloading in C++ - Hacker Rank Solution START */
class Matrix
{
public:
vector<vector<int>> a;
Matrix() {}
Matrix operator+(const Matrix &o)
{
Matrix sum(*this);
for (size_t i = 0; i < sum.a.size(); i++)
{
for (size_t j = 0; j < sum.a[i].size(); j++)
{
sum.a[i][j] += o.a[i][j];
}
}
return sum;
}
};
/* Operator Overloading in C++ - Hacker Rank Solution END */
int main ()
{
int cases,k;
cin >> cases;
for(k=0;k<cases;k++)
{
Matrix x;
Matrix y;
Matrix result;
int n,m,i,j;
cin >> n >> m;
for(i=0;i<n;i++)
{
vector<int> b;
int num;
for(j=0;j<m;j++)
{
cin >> num;
b.push_back(num);
}
x.a.push_back(b);
}
for(i=0;i<n;i++)
{
vector<int> b;
int num;
for(j=0;j<m;j++)
{
cin >> num;
b.push_back(num);
}
y.a.push_back(b);
}
result = x+y;
for(i=0;i<n;i++)
{
for(j=0;j<m;j++)
{
cout << result.a[i][j] << " ";
}
cout << endl;
}
}
return 0;
}