AZEN-SGG/2nd_Sem_Bogachev
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Tasks from First to Fourth are done!

Browse source
This commit is contained in:
AZEN-SGG 2025-03-09 19:11:16 +03:00
parent 50cc0f9b65
commit 48d6198ca3
64 changed files with 2217 additions and 13 deletions
Download patch file Download diff file Expand all files Collapse all files

10
2025.03.07/10Ex/solve.c
View file

@ -3,13 +3,11 @@
void matrix_multiply(const double *A, const double *B, double *c, int n, int m, int l)
{
int i, j, k, index;
int i, j, k;
for (i = 0; i < n; i++)
for (j = 0; j < l; j++)
for (k = 0; k < m; k++)
{
index = i * l + j;
c[index] = 0;
for (k = 0; k < m; k++)
c[index] += A[i * m + k] * B[k * l + j];
for (j = 0; j < l; j++)
c[i * l + j] += A[i * m + k] * B[k * l + j];
}
}

10
2025.03.07/Linux/solve.c
View file

@ -101,13 +101,11 @@ void t9_solve(const double *A, const double *b, double *c, int n, int m)
void matrix_multiply(const double *A, const double *B, double *c, int n, int m, int l)
{
int i, j, k, index;
int i, j, k;
for (i = 0; i < n; i++)
for (j = 0; j < l; j++)
for (k = 0; k < m; k++)
{
index = i * l + j;
c[index] = 0;
for (k = 0; k < m; k++)
c[index] += A[i * m + k] * B[k * l + j];
for (j = 0; j < l; j++)
c[i * l + j] += A[i * m + k] * B[k * l + j];
}
}