This repository was archived by the owner on May 18, 2024. It is now read-only.
-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathmain.cpp
118 lines (103 loc) · 1.87 KB
/
main.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
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
#include <iostream>
#include <ctime>
class vecn
{
int el_num;
double *vec;
public:
vecn(int n)
{
this->el_num = n;
this->vec = new double[n];
}
~vecn()
{
delete[] this->vec;
}
double &at(int i)
{
return vec[i];
}
int size()
{
return this->el_num;
}
};
class matrix
{
int wymiar;
double *mat;
public:
matrix(int n)
{
this->wymiar = n;
mat = new double[n * n];
}
~matrix()
{
delete[] this->mat;
}
double &at(int i, int j)
{
return this->mat[i + wymiar * j];
}
int size()
{
return this->wymiar;
}
};
void mul(matrix &m, vecn &v, vecn &new_v)
{
for (int i = 0; i < v.size(); i++)
{
double sum = 0;
for (int j = 0; j < v.size(); j++)
{
sum += m.at(i, j) * v.at(j);
}
new_v.at(i) = sum;
}
}
int main()
{
srand(time(NULL));
vecn *v = new vecn(3);
matrix *m = new matrix(3);
vecn new_v = vecn(3);
for (int i = 0; i < 3; i++)
{
v->at(i) = rand() % 11;
}
std::cout << "vec: " << std::endl;
for (int i = 0; i < 3; i++)
{
std::cout << v->at(i) << " ";
}
std::cout << std::endl;
for (int i = 0; i < m->size(); i++)
{
for (int j = 0; j < m->size(); j++)
{
m->at(i, j) = rand() % 11;
}
}
std::cout << "matrix: " << std::endl;
for (int i = 0; i < m->size(); i++)
{
for (int j = 0; j < m->size(); j++)
{
std::cout << m->at(i, j) << " ";
}
std::cout << std::endl;
}
mul(*m, *v, new_v);
std::cout << "new_vec: " << std::endl;
for (int i = 0; i < 3; i++)
{
std::cout << new_v.at(i) << " ";
}
std::cout << std::endl;
delete v;
delete m;
return 0;
}