From 1a2b39206a8d33ee3a900f350e8a46ff6dc74411 Mon Sep 17 00:00:00 2001 From: AZEN-SGG Date: Thu, 13 Mar 2025 17:21:43 +0300 Subject: [PATCH] Change 1st Task --- 2025.03.14/01Ex/solve.c | 7 +++---- 2025.03.14/Linux/solve.c | 7 +++---- 2 files changed, 6 insertions(+), 8 deletions(-) diff --git a/2025.03.14/01Ex/solve.c b/2025.03.14/01Ex/solve.c index ab8ece0..d9511b3 100644 --- a/2025.03.14/01Ex/solve.c +++ b/2025.03.14/01Ex/solve.c @@ -14,13 +14,12 @@ double t1_solve(double *a, int n, int m) { int i, j; double cur = 0, maximum = 0; - if (n > 0) - for (j = 0; j < m; j++) maximum += fabs(a[j]); - for (i = 1; i < n; i++) + + for (i = 0; i < n; i++) { cur = 0; 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; } diff --git a/2025.03.14/Linux/solve.c b/2025.03.14/Linux/solve.c index c6acad8..890fa05 100644 --- a/2025.03.14/Linux/solve.c +++ b/2025.03.14/Linux/solve.c @@ -14,13 +14,12 @@ double t1_solve(double *a, int n, int m) { int i, j; double cur = 0, maximum = 0; - if (n > 0) - for (j = 0; j < m; j++) maximum += fabs(a[j]); - for (i = 1; i < n; i++) + + for (i = 0; i < n; i++) { cur = 0; 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; }