Add old solution

2025.04.04/dist/Krivoruchenko_SK_old/Makefile

@@ -0,0 +1,26 @@
+WFLAGS = -fstack-protector-all -W -Wall -Wextra -Wunused \
+-Wempty-body -Wlogical-op -Wold-style-declaration -Wmissing-parameter-type \
+-Wignored-qualifiers -Winit-self -Wshadow -Wtype-limits \
+-Wpointer-arith -Wformat-security -Wmissing-format-attribute -Wformat=1 \
+-Wdeclaration-after-statement -Wbad-function-cast -Wnested-externs \
+-Wmissing-prototypes -Wmissing-declarations -Wold-style-definition \
+-Wcast-align -Werror -pedantic -pedantic-errors -Wfloat-equal \
+-Wwrite-strings -Wno-long-long -std=gnu99 -Wstrict-prototypes \
+-Wmissing-field-initializers -Wpointer-sign
+
+CFLAGS = -mfpmath=sse -std=gnu99 -O3
+
+TARGET = a.out
+OBJ = main.o solve.o array_io.o init_f.o matrix.o
+
+%.o: %.c
+	gcc $(CFLAGS) $(WFLAGS) -c $< -o $@
+
+$(TARGET): $(OBJ)
+	gcc $^ -o $@ -lm
+
+gdb: CFLAGS = -mfpmath=sse -std=gnu99 -g
+gdb: clean $(TARGET)
+
+clean:
+	rm -f *.o *.out

2025.04.04/dist/Krivoruchenko_SK_old/array_io.c

@@ -0,0 +1,72 @@
+#include <stdio.h>
+#include <string.h>
+#include "array_io.h"
+
+io_status read_matrix(double *a, int n, const char *name)
+{
+	int i, j;
+	FILE *fp;
+	if (!(fp = fopen(name, "r"))) return ERROR_OPEN;
+	for (i = 0; i < n; i++)
+		for (j = 0; j < n; j++)
+			if (fscanf(fp, "%lf", a + i * n + j) != 1) 
+				{fclose(fp); return ERROR_READ;}
+	fclose(fp);
+	return SUCCESS;
+}
+
+void print_matrix(const double *a, int n, int p)
+{
+	int np = (n > p ? p : n);
+	int i, j;
+
+	for (i = 0; i < np; i++)
+	{
+		for (j = 0; j < np; j++)
+			printf(" %10.3e", a[i * n + j]);
+		printf("\n");
+	}
+}
+
+void init_matrix(double *a, int n, int k)
+{
+	double (*q)(int, int, int, int);
+	double (*f[])(int, int, int, int) = {f1, f2, f3, f4};
+	int i, j;
+	q = f[k-1];
+	for (i = 0; i < n; i++)
+		for (j = 0; j < n; j++)
+			a[i * n + j] = q(n, n, i+1, j+1);
+}
+
+void init_identity_matrix(double *a, int n)
+{
+	a = memset(a, 0, n * n * sizeof(double));
+	
+	for (int i = 0; i < n; ++i)
+		a[i*n + i] = 1.0;
+}
+
+int read_or_init_matrix(double *a, char *name, int k, int n)
+{
+	if (name)
+	{ /* из файла */
+		io_status ret;
+		ret = read_matrix(a, n, name);
+		do {
+			switch (ret)
+			{
+				case SUCCESS:
+					continue;
+				case ERROR_OPEN:
+					printf("Cannot open %s\n", name);
+					break;
+				case ERROR_READ:
+					printf("Cannot read %s\n", name);
+			}
+			return 3;
+		} while (0);
+	} else init_matrix(a, n, k);
+
+	return 0;
+}

2025.04.04/dist/Krivoruchenko_SK_old/array_io.h

@@ -0,0 +1,13 @@
+#ifndef ARRAY_IO_H
+#define ARRAY_IO_H
+
+#include "io_status.h"
+#include "init_f.h"
+
+io_status read_matrix(double *a, int n, const char *name);
+void print_matrix(const double *a, int n, int p);
+void init_matrix(double *a, int n, int k);
+void init_identity_matrix(double *a, int n);
+int read_or_init_matrix(double *a, char *name, int k, int n);
+
+#endif

2025.04.04/dist/Krivoruchenko_SK_old/init_f.c

@@ -0,0 +1,30 @@
+#include "init_f.h"
+#include <stdlib.h>
+
+#define MAX(n, m) (n < m ? m : n)
+
+double f1(int n, int m, int i, int j)
+{
+	return MAX(n, m) - MAX(i, j) + 1;
+}
+
+double f2(int n, int m, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return MAX(i, j);
+}
+
+double f3(int n, int m, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return abs(i - j);
+}
+
+double f4(int n, int m, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return 1./(i+j-1);
+}

2025.04.04/dist/Krivoruchenko_SK_old/init_f.h

@@ -0,0 +1,9 @@
+#ifndef INIT_F_H
+#define INIT_F_H
+
+double f1(int n, int m, int i, int j);
+double f2(int n, int m, int i, int j);
+double f3(int n, int m, int i, int j);
+double f4(int n, int m, int i, int j);
+
+#endif

2025.04.04/dist/Krivoruchenko_SK_old/io_status.h

@@ -0,0 +1,13 @@
+#ifndef IO_STATUS_H
+#define IO_STATUS_H
+
+#define SINGULAR 2
+
+typedef enum _io_status
+{
+	SUCCESS,
+	ERROR_OPEN,
+	ERROR_READ
+} io_status;
+
+#endif

2025.04.04/dist/Krivoruchenko_SK_old/main.c

@@ -0,0 +1,104 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+#include "array_io.h"
+#include "io_status.h"
+#include "matrix.h"
+#include "solve.h"
+
+/* ./a.out n p k [filename] */
+int main(int argc, char *argv[])
+{
+	double t, *a, *x, r1 = 0, r2 = 0;
+	int n, p, k, res = 0, *c, task = 14;
+	char *name = 0;
+	
+	if (!((argc == 4 || argc == 5) && 
+				sscanf(argv[1], "%d", &n) == 1 && 
+				sscanf(argv[2], "%d", &p) == 1 &&
+				sscanf(argv[3], "%d", &k) == 1 &&
+				k >= 0 && k <= 4 && (!(k == 0 && argc != 5))))
+	{
+		printf("Usage: %s n p k [filename]\n", argv[0]);
+		return 1;
+	}
+	if (argc == 5 && k == 0) name = argv[4];
+
+	a = (double *)malloc(n * n * sizeof(double));
+	if (!a)
+	{
+		printf("Not enough memory\n");
+		return 2;
+	}
+	
+	x = (double *)malloc(n * n * sizeof(double));
+	if (!x)
+	{
+		free(a);
+		printf("Not enough memory\n");
+		return 2;
+	}
+	c = (int *)malloc(n * sizeof(int));
+	if (!c)
+	{
+		free(a);
+		free(x);
+		printf("Not enough memory\n");
+		return 2;
+	}
+
+	res = read_or_init_matrix(a, name, k, n);
+	if (res)
+	{
+		free(a);
+		free(x);
+		free(c);
+
+		return res;
+	}
+
+	init_identity_matrix(x, n);
+
+	for (int i = 0; i < n; ++i)
+		c[i] = i;
+
+	printf("Initial matrix:\n");
+	print_matrix(a, n, p);
+
+	t = clock();
+	res = t14_solve(n, a, x, c);
+	t = (clock() - t) / CLOCKS_PER_SEC;
+	
+	if (res == SINGULAR) 
+	{
+		free(a);
+		free(x);
+		free(c);
+
+		printf("The matrix is degenerate\n");
+		return 4;	
+	}	
+
+	res = read_or_init_matrix(a, name, k, n);
+	if (res)
+	{
+		free(a);
+		free(x);
+		free(c);
+
+		return res;
+	}
+	
+	r1 = get_r1(n, a, x);	
+	r2 = get_r2(n, a, x);	
+	
+	printf("Inverse matrix:\n");
+	print_matrix(x, n, p);
+	printf("%s : Task = %d Res1 = %e Res2 = %e Elapsed = %.2f K = %d N = %d\n", argv[0], task, r1, r2, t, k, n);
+
+	free(a);
+	free(x);
+	free(c);
+
+	return 0;
+}

2025.04.04/dist/Krivoruchenko_SK_old/matrix.c

@@ -0,0 +1,98 @@
+#include "matrix.h"
+#include <math.h>
+
+void init_vec_b(const double * restrict a, double * restrict b, int n)
+{
+	for (int i = 0; i < n; ++i)
+	{
+		double sum = 0;
+
+		for (int k = 0; k < n; k+=2)
+			sum += a[i * n + k];
+
+		b[i] = sum;
+	}
+}
+
+void matvec_mul(int n, const double * restrict A, const double * restrict x, double * restrict x_k)
+{
+	for (int i = 0; i < n; i++)
+	{
+		double sum = 0;
+		for (int j = 0; j < n; j++)
+			sum += A[i * n + j] * x[j];
+		x_k[i] = sum;
+	}	
+}
+
+double get_r1(const int n, const double * restrict A, const double * restrict X)
+{
+	double maximum = 0;
+
+	if (n > 4000) return 0;
+	
+	for (int j = 0; j < n; ++j)
+	{
+		double sum = 0;
+		
+		for (int i = 0; i < n; ++i)
+		{
+			int in = i*n;
+			double sum_ij = - (i == j);
+
+			for (int k = 0; k < n; ++k)
+				sum_ij += A[in + k] * X[k*n + j];
+			
+			sum += fabs(sum_ij);
+		}
+
+		if (maximum < sum)
+			maximum = sum;
+	}
+
+	return maximum;
+}
+
+double get_r2(const int n, const double * restrict A, const double * restrict X)
+{
+	double maximum = 0;
+
+	if (n > 4000) return 0;
+	
+	for (int j = 0; j < n; ++j)
+	{
+		double sum = 0;
+
+		for (int i = 0; i < n; ++i)
+		{
+			int in = i*n;
+			double sum_ij = - (i == j);
+
+			for (int k = 0; k < n; ++k)
+				sum_ij += X[in + k] * A[k*n + j];
+			
+			sum += fabs(sum_ij);
+		}
+
+		if (maximum < sum)
+			maximum = sum;
+	}
+
+	return maximum;
+}
+
+double get_matrix_norm(const int n, const double * restrict A)
+{
+	double norm = 0;
+	for (int i = 0; i < n; ++i)
+	{
+		double sum = 0;
+		for (int j = 0; j < n; ++j)
+			sum += fabs(A[i*n + j]);
+		
+		if (sum > norm)
+			norm = sum;
+	}
+	
+	return norm;
+}

2025.04.04/dist/Krivoruchenko_SK_old/matrix.h

@@ -0,0 +1,10 @@
+#ifndef MATRIX_H
+#define MATRIX_H
+
+void init_vec_b(const double * restrict a, double * restrict b, int n);
+void matvec_mul(int n, const double * restrict A, const double * restrict x, double * restrict x_k);
+double get_r1(const int n, const double * restrict A, const double * restrict X);
+double get_r2(const int n, const double * restrict A, const double * restrict X);
+double get_matrix_norm(const int n, const double * restrict A);
+
+#endif

2025.04.04/dist/Krivoruchenko_SK_old/solve.c

@@ -0,0 +1,177 @@
+#include "solve.h"
+#include "io_status.h"
+#include "array_io.h"
+#include "matrix.h"
+#include <float.h>
+#include <math.h>
+#include <stdio.h>
+
+#define EPS 1.2e-16
+
+// c - changes in rows
+int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c)
+{
+	double norm = get_matrix_norm(n, A);
+	double eps = EPS*norm;
+
+//	printf("NORM = %lf EPS = %lf\n", norm, eps);
+
+	// Проходимся по главным минорам
+	for (int k = 0; k < n; ++k) {
+		double maximum = -1.;
+		int max_i = 0, max_j = 0;
+		
+		// Ищем максимальный элемент минора
+		for (int i = k; i < n; ++i)
+			for (int j = k; j < n; ++j)
+			{
+				double aij = fabs(A[i * n + j]);
+				if (aij > maximum) {
+					maximum = aij;
+					max_i = i;
+					max_j = j;
+				}
+			}
+			
+//		printf("\n------- K = %d -------\n", k);
+//		printf("Maximum = %lf i = %d j = %d\n", maximum, max_i, max_j);
+
+		// Если максимальный по модулю элемент равен нулю, значит матрица вырождена
+		if (fabs(maximum) <= eps)
+			return SINGULAR;
+		
+		// Меняем строки местами, если максимум находится не в k строке
+		if (max_i != k)
+		{
+			int kn = k*n;
+			int in = max_i*n;
+
+			for (int i = 0; i < k; ++i)
+			{
+				int kni = kn+i, ini = in+i;
+				double swap = X[kni];
+				X[kni] = X[ini];
+				X[ini] = swap;
+			}
+	
+			for (int i = k; i < n; ++i)
+			{
+				int kni = kn+i, ini = in+i;
+				double swap = X[kni];
+				X[kni] = X[ini];
+				X[ini] = swap;
+				
+				swap = A[kni];
+				A[kni] = A[ini];
+				A[ini] = swap;
+			}
+		}
+
+		// Меняем столбцы местами
+		if (max_j != k)
+		{
+			int swap_temp = c[max_j];
+			c[max_j] = c[k];
+			c[k] = swap_temp;
+
+			for (int i = 0; i < n; i++)
+			{
+				const int in = i*n;
+				double swap = A[in + k];
+				A[in + k] = A[in + max_j];
+				A[in + max_j] = swap;
+			}
+		}
+
+//		printf("BEFORE GAUSS\n");
+//		printf("Original matrix:\n");
+//		print_matrix(A, n, n);
+//		printf("Inverse matrix:\n");
+//		print_matrix(X, n, n);
+		
+		gauss_inverse(n, k, A, X);
+		
+//		printf("AFTER GAUSS\n");
+//		printf("Original matrix:\n");
+//		print_matrix(A, n, n);
+//		printf("Inverse matrix:\n");
+//		print_matrix(X, n, n);
+	}
+
+	gauss_back_substitution(n, A, X);
+
+	for (int k = 0; k < n; ++k)
+	{
+		const int kn = k*n;	
+		int i = c[k];
+		
+		while (i != k)
+		{
+			const int in = i*n;
+			const int swap_int = c[i];
+			c[i] = i;
+			i = swap_int;
+
+			for (int j = 0; j < n; ++j)
+			{
+				double swap_temp = X[in+j];
+				X[in+j] = X[kn+j];
+				X[kn+j] = swap_temp;
+			}
+		}
+	}
+
+	return 0;
+}
+
+// Прямой ход Го ----- йда
+void gauss_inverse(const int n, const int k, double * restrict A, double * restrict X)
+{
+	const int kn = k*n;
+	const int kk = kn + k;
+	const double inv_akk = 1./A[kk];
+	
+	for (int ij = kk+1; ij < kn+n; ij++)
+		A[ij] *= inv_akk;
+	
+	for (int ij = kn; ij < kn+n; ij++)
+		X[ij] *= inv_akk;
+	
+	for (int i = k+1; i < n; ++i)
+	{
+		const int in = i*n;
+		const double aik = A[in + k];
+		
+		for (int ij = in+k+1, kj = kk+1; ij < in+n; ij++, kj++)
+			A[ij] -= A[kj] * aik;
+		
+		for (int ij = in, kj = kn; kj < kn + n; ij++, kj++)
+			X[ij] -= X[kj] * aik;
+	}
+}
+
+// Обратный ход метода Гаусса
+void gauss_back_substitution(const int n, double * restrict A, double * restrict X)
+{
+	// Идём с последней строки и вычитаем её из последующих
+	for (int k = n-1; k > 0; --k)
+	{
+		const int kn = k * n;
+
+		for (int i = 0; i < k; ++i)
+		{
+			const int in = i*n;
+			const double aik = A[in + k];
+
+			for (int j = 0; j < n; ++j)
+				X[in + j] -= X[kn + j] * aik;	
+		}
+
+//		printf("\n------- K = %d -------\n", k);
+//		printf("Original matrix:\n");
+//		print_matrix(A, n, n);
+//		printf("Inverse matrix:\n");
+//		print_matrix(X, n, n);
+	}
+}
+

2025.04.04/dist/Krivoruchenko_SK_old/solve.h

@@ -0,0 +1,8 @@
+#ifndef SOLVE_H
+#define SOLVE_H
+
+int t14_solve(int n, double * restrict A, double * restrict X, int * restrict c);
+void gauss_inverse(const int n, const int k, double * restrict A, double * restrict X);
+void gauss_back_substitution(const int n, double * restrict A, double * restrict X);
+
+#endif