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

Убрал DEBUG

Browse source
This commit is contained in:
AZEN-SGG 2025-04-02 14:11:06 +03:00
parent 9fa772a58b
commit 8877c0eb86
2 changed files with 0 additions and 30 deletions
Download patch file Download diff file Expand all files Collapse all files

15
2025.04.04/14Ex/solve.c
View file

@ -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);

15
2025.04.04/dist/Krivoruchenko_SK/solve.c vendored
View file

@ -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);