From 8877c0eb86277e1bf0dd839e2f992dc2e72d633a Mon Sep 17 00:00:00 2001 From: AZEN-SGG Date: Wed, 2 Apr 2025 14:11:06 +0300 Subject: [PATCH] =?UTF-8?q?=D0=A3=D0=B1=D1=80=D0=B0=D0=BB=20DEBUG?= MIME-Version: 1.0 Content-Type: text/plain; charset=UTF-8 Content-Transfer-Encoding: 8bit --- 2025.04.04/14Ex/solve.c | 15 --------------- 2025.04.04/dist/Krivoruchenko_SK/solve.c | 15 --------------- 2 files changed, 30 deletions(-) diff --git a/2025.04.04/14Ex/solve.c b/2025.04.04/14Ex/solve.c index ec62a74..bc1c5c5 100644 --- a/2025.04.04/14Ex/solve.c +++ b/2025.04.04/14Ex/solve.c @@ -13,8 +13,6 @@ int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c) double maximum = -1.; int max_i = 0, max_j = 0; -// printf("\n--------- K = %d ---------\n", k); - // Ищем максимальный элемент минора #pragma omp parallel { @@ -48,8 +46,6 @@ int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c) if (fabs(maximum) < DBL_EPSILON) return SINGULAR; -// printf("Maximum = %lf for i = %d, j = %d\n", maximum, max_i, max_j); - // Меняем строки местами, если максимум находится не в k строке if (max_i != k) { @@ -79,9 +75,6 @@ int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c) } } -// print_matrix(A, n, n); -// printf("\n"); - // Меняем столбцы местами if (max_j != k) { @@ -98,15 +91,7 @@ int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c) } } -// print_matrix(A, n, n); -// printf("\n"); - gauss_inverse(n, k, A, X); - -// print_matrix(A, n, n); -// printf("Inverse matrix:\n"); -// print_matrix(X, n, n); - } gauss_back_substitution(n, A, X); diff --git a/2025.04.04/dist/Krivoruchenko_SK/solve.c b/2025.04.04/dist/Krivoruchenko_SK/solve.c index ec62a74..bc1c5c5 100644 --- a/2025.04.04/dist/Krivoruchenko_SK/solve.c +++ b/2025.04.04/dist/Krivoruchenko_SK/solve.c @@ -13,8 +13,6 @@ int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c) double maximum = -1.; int max_i = 0, max_j = 0; -// printf("\n--------- K = %d ---------\n", k); - // Ищем максимальный элемент минора #pragma omp parallel { @@ -48,8 +46,6 @@ int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c) if (fabs(maximum) < DBL_EPSILON) return SINGULAR; -// printf("Maximum = %lf for i = %d, j = %d\n", maximum, max_i, max_j); - // Меняем строки местами, если максимум находится не в k строке if (max_i != k) { @@ -79,9 +75,6 @@ int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c) } } -// print_matrix(A, n, n); -// printf("\n"); - // Меняем столбцы местами if (max_j != k) { @@ -98,15 +91,7 @@ int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c) } } -// print_matrix(A, n, n); -// printf("\n"); - gauss_inverse(n, k, A, X); - -// print_matrix(A, n, n); -// printf("Inverse matrix:\n"); -// print_matrix(X, n, n); - } gauss_back_substitution(n, A, X);