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

Change 1st Task

Browse source
This commit is contained in:
AZEN-SGG 2025-03-13 17:21:43 +03:00
parent 48b359f34c
commit 1a2b39206a
2 changed files with 6 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

7
2025.03.14/01Ex/solve.c
View file

@ -14,13 +14,12 @@ double t1_solve(double *a, int n, int m)
{ {
int i, j; int i, j;
double cur = 0, maximum = 0; double cur = 0, maximum = 0;
if (n > 0)
for (j = 0; j < m; j++) maximum += fabs(a[j]); for (i = 0; i < n; i++)
for (i = 1; i < n; i++)
{ {
cur = 0; cur = 0;
for (j = 0; j < m; j++) for (j = 0; j < m; j++)
cur = fabs(a[i * m + j]); cur += fabs(a[i * m + j]);
if (compare(cur, maximum) == 1) maximum = cur; if (compare(cur, maximum) == 1) maximum = cur;
} }

7
2025.03.14/Linux/solve.c
View file

@ -14,13 +14,12 @@ double t1_solve(double *a, int n, int m)
{ {
int i, j; int i, j;
double cur = 0, maximum = 0; double cur = 0, maximum = 0;
if (n > 0)
for (j = 0; j < m; j++) maximum += fabs(a[j]); for (i = 0; i < n; i++)
for (i = 1; i < n; i++)
{ {
cur = 0; cur = 0;
for (j = 0; j < m; j++) for (j = 0; j < m; j++)
cur = fabs(a[i * m + j]); cur += fabs(a[i * m + j]);
if (compare(cur, maximum) == 1) maximum = cur; if (compare(cur, maximum) == 1) maximum = cur;
} }