First task is done

2025.03.21/01Ex/Makefile

@@ -0,0 +1,27 @@
+FLAGS = -mfpmath=sse -fstack-protector-all -W -Wall -Wextra -Wunused \
+-Wempty-body -Wlogical-op -Wold-style-declaration -Wmissing-parameter-type \
+-Wignored-qualifiers -Winit-self -Wswitch-default -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 -O3
+
+a01.exe: main.o array_io.o solve.o init_f.o
+	gcc main.o solve.o array_io.o init_f.o -o a01.exe -lssp
+
+main.o: main.c
+	gcc $(CFLAGS) -c main.c
+
+solve.o: solve.c
+	gcc $(FLAGS) -c solve.c
+
+array_io.o: array_io.c
+	gcc $(CFLAGS) -c array_io.c
+
+init_f.o: init_f.c
+	gcc $(CFLAGS) -c init_f.c
+
+clean:
+	del *.o *.exe

2025.03.21/01Ex/array_io.c

@@ -0,0 +1,40 @@
+#include <stdio.h>
+#include "array_io.h"
+
+io_status read_matrix(double *a, int m, int n, const char *name)
+{
+	int i, j;
+	FILE *fp;
+	if (!(fp = fopen(name, "r"))) return ERROR_OPEN;
+	for (i = 0; i < m; 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 m, int n, int p)
+{
+	int mp = (m > p ? p : m);
+	int np = (n > p ? p : n);
+	int i, j;
+
+	for (i = 0; i < mp; i++)
+	{
+		for (j = 0; j < np; j++)
+			printf(" %10.3e", a[i * n + j]);
+		printf("\n");
+	}
+}
+
+void init_matrix(double *a, int m, 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 < m; i++)
+		for (j = 0; j < n; j++)
+			a[i * n + j] = q(m, n, i+1, j+1);
+}

2025.03.21/01Ex/array_io.h

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

2025.03.21/01Ex/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 m, int n, int i, int j)
+{
+	return MAX(n, m) - MAX(i, j) + 1;
+}
+
+double f2(int m, int n, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return MAX(i, j);
+}
+
+double f3(int m, int n, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return abs(i - j);
+}
+
+double f4(int m, int n, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return 1./(i+j-1);
+}

2025.03.21/01Ex/init_f.h

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

2025.03.21/01Ex/io_status.h

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

2025.03.21/01Ex/main.c

@@ -0,0 +1,67 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+#include "array_io.h"
+#include "io_status.h"
+#include "solve.h"
+
+/* ./a.out m n p k [filename] */
+int main(int argc, char *argv[])
+{
+	double t, *a;
+	int m, n, p, k, res, task = 1;
+	char *name = 0;
+	
+	if (!((argc == 5 || argc == 6) && 
+				sscanf(argv[1], "%d", &m) == 1 && 
+				sscanf(argv[2], "%d", &n) == 1 && 
+				sscanf(argv[3], "%d", &p) == 1 &&
+				sscanf(argv[4], "%d", &k) == 1 &&
+				k >= 0 && k <= 4 && (!(k == 0 && argc != 6))))
+	{
+		printf("Usage: %s m n p k [filename]\n", argv[0]);
+		return 1;
+	}
+	if (argc == 6) name = argv[5];
+	
+	a = (double *)malloc(m * n * sizeof(double));
+	if (!a)
+	{
+		printf("Not enough memory\n");
+		return 2;
+	}
+
+	if (name)
+	{ /* из файла */
+		io_status ret;
+		ret = read_matrix(a, m, 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);
+			}
+			free(a);
+			return 3;
+		} while (0);
+	} else init_matrix(a, m, n, k);
+
+	printf("Matrix:\n");
+	print_matrix(a, m, n, p);
+
+	t = clock();
+	res = t1_solve(a, m, n);
+	t = (clock() - t) / CLOCKS_PER_SEC;
+	
+	printf("New matrix:\n");
+	print_matrix(a, m, n - 1, p);
+	printf ("%s : Task = %d Result = %d Elapsed = %.2f\n", argv[0], task, res, t);
+	
+	free(a);
+	return 0;
+}

2025.03.21/01Ex/solve.c

@@ -0,0 +1,26 @@
+#include "solve.h"
+#include <math.h>
+
+#define eps 1e-17
+
+int t1_solve(double *a, int m, int n)
+{
+	int l, min_i = 0, min_j = 0, del_j;
+	double minimum = (m * n > 0) ? fabs(a[0]) : 0;
+
+	for (int i = 0; i < m; i++)
+		for (int j = 0; j < n; j++)
+			if ((minimum - fabs(a[i*n + j])) > eps) { minimum = fabs(a[i*n + j]); min_i = i; min_j = j; }
+
+	(void)(min_i);
+
+	for (l = min_j+1, del_j = 1; l < m*n; l++)
+	{
+		if (l == ((n * del_j) + min_j))
+			del_j++;
+		else 
+			a[l - del_j] = a[l];
+	}
+
+	return min_j + 1;
+}

2025.03.21/01Ex/solve.h

@@ -0,0 +1,6 @@
+#ifndef SOLVE_H
+#define SOLVE_H
+
+int t1_solve(double *a, int m, int n);
+
+#endif

2025.03.21/02Ex/Makefile

@@ -0,0 +1,27 @@
+FLAGS = -mfpmath=sse -fstack-protector-all -W -Wall -Wextra -Wunused \
+-Wempty-body -Wlogical-op -Wold-style-declaration -Wmissing-parameter-type \
+-Wignored-qualifiers -Winit-self -Wswitch-default -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 -O3
+
+a02.exe: main.o array_io.o solve.o init_f.o
+	gcc main.o solve.o array_io.o init_f.o -o a02.exe -lssp
+
+main.o: main.c
+	gcc $(CFLAGS) -c main.c
+
+solve.o: solve.c
+	gcc $(FLAGS) -c solve.c
+
+array_io.o: array_io.c
+	gcc $(CFLAGS) -c array_io.c
+
+init_f.o: init_f.c
+	gcc $(CFLAGS) -c init_f.c
+
+clean:
+	del *.o *.exe

2025.03.21/02Ex/array_io.c

@@ -0,0 +1,40 @@
+#include <stdio.h>
+#include "array_io.h"
+
+io_status read_matrix(double *a, int m, int n, const char *name)
+{
+	int i, j;
+	FILE *fp;
+	if (!(fp = fopen(name, "r"))) return ERROR_OPEN;
+	for (i = 0; i < m; 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 m, int n, int p)
+{
+	int mp = (m > p ? p : m);
+	int np = (n > p ? p : n);
+	int i, j;
+
+	for (i = 0; i < mp; i++)
+	{
+		for (j = 0; j < np; j++)
+			printf(" %10.3e", a[i * n + j]);
+		printf("\n");
+	}
+}
+
+void init_matrix(double *a, int m, 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 < m; i++)
+		for (j = 0; j < n; j++)
+			a[i * n + j] = q(m, n, i+1, j+1);
+}

2025.03.21/02Ex/array_io.h

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

2025.03.21/02Ex/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 m, int n, int i, int j)
+{
+	return MAX(n, m) - MAX(i, j) + 1;
+}
+
+double f2(int m, int n, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return MAX(i, j);
+}
+
+double f3(int m, int n, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return abs(i - j);
+}
+
+double f4(int m, int n, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return 1./(i+j-1);
+}

2025.03.21/02Ex/init_f.h

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

2025.03.21/02Ex/io_status.h

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

2025.03.21/02Ex/main.c

@@ -0,0 +1,67 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+#include "array_io.h"
+#include "io_status.h"
+#include "solve.h"
+
+/* ./a.out m n p k [filename] */
+int main(int argc, char *argv[])
+{
+	double t, *a;
+	int m, n, p, k, res, task = 2;
+	char *name = 0;
+	
+	if (!((argc == 5 || argc == 6) && 
+				sscanf(argv[1], "%d", &m) == 1 && 
+				sscanf(argv[2], "%d", &n) == 1 && 
+				sscanf(argv[3], "%d", &p) == 1 &&
+				sscanf(argv[4], "%d", &k) == 1 &&
+				k >= 0 && k <= 4 && (!(k == 0 && argc != 6))))
+	{
+		printf("Usage: %s m n p k [filename]\n", argv[0]);
+		return 1;
+	}
+	if (argc == 6) name = argv[5];
+	
+	a = (double *)malloc(m * n * sizeof(double));
+	if (!a)
+	{
+		printf("Not enough memory\n");
+		return 2;
+	}
+
+	if (name)
+	{ /* из файла */
+		io_status ret;
+		ret = read_matrix(a, m, 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);
+			}
+			free(a);
+			return 3;
+		} while (0);
+	} else init_matrix(a, m, n, k);
+
+	printf("Matrix:\n");
+	print_matrix(a, m, n, p);
+
+	t = clock();
+	res = t2_solve(a, m, n);
+	t = (clock() - t) / CLOCKS_PER_SEC;
+	
+	printf("New matrix:\n");
+	print_matrix(a, m, n - 1, p);
+	printf ("%s : Task = %d Result = %d Elapsed = %.2f\n", argv[0], task, res, t);
+	
+	free(a);
+	return 0;
+}

2025.03.21/02Ex/solve.c

@@ -0,0 +1,26 @@
+#include "solve.h"
+#include <math.h>
+
+#define eps 1e-17
+
+int t1_solve(double *a, int m, int n)
+{
+	int l, min_i = 0, min_j = 0, del_j;
+	double minimum = (m * n > 0) ? a[0] : 0;
+
+	for (int i = 0; i < m; i++)
+		for (int j = 0; j < n; j++)
+			if ((minimum - a[i*n + j]) > eps) { minimum = a[i*n + j]; min_i = i; min_j = j; }
+
+	(void)(min_i);
+
+	for (l = min_j+1, del_j = 1; l < m*n; l++)
+	{
+		if (l == ((n * del_j) + min_j))
+			del_j++;
+		else 
+			a[l - del_j] = a[l];
+	}
+
+	return min_j + 1;
+}

2025.03.21/02Ex/solve.h

@@ -0,0 +1,6 @@
+#ifndef SOLVE_H
+#define SOLVE_H
+
+int t1_solve(double *a, int m, int n);
+
+#endif

2025.03.21/Example/Makefile

@@ -0,0 +1,19 @@
+FLAGS = -fstack-protector-all -W -Wall -Wextra -Wunused -Wcast-align -Werror -pedantic -pedantic-errors -Wfloat-equal -Wpointer-arith -Wformat-security -Wmissing-format-attribute -Wformat=1 -Wwrite-strings -Wcast-align -Wno-long-long -std=gnu99 -Wstrict-prototypes -Wmissing-prototypes -Wmissing-declarations -Wold-style-definition -Wdeclaration-after-statement -Wbad-function-cast -Wnested-externs -O3
+
+a01.exe: main.o array_io.o solve.o init_f.o
+	gcc main.o solve.o array_io.o init_f.o -o a01.exe -lssp
+
+main.o: main.c
+	gcc $(CFLAGS) -c main.c
+
+solve.o: solve.c
+	gcc $(FLAGS) -c solve.c
+
+array_io.o: array_io.c
+	gcc $(CFLAGS) -c array_io.c
+
+init_f.o: init_f.c
+	gcc $(CFLAGS) -c init_f.c
+
+clean:
+	del *.o *.exe

2025.03.21/Example/array_io.c

@@ -0,0 +1,40 @@
+#include <stdio.h>
+#include "array_io.h"
+
+io_status read_matrix(double *a, int m, int n, const char *name)
+{
+	int i, j;
+	FILE *fp;
+	if (!(fp = fopen(name, "r"))) return ERROR_OPEN;
+	for (i = 0; i < m; 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 m, int n, int p)
+{
+	int mp = (m > p ? p : m);
+	int np = (n > p ? p : n);
+	int i, j;
+
+	for (i = 0; i < mp; i++)
+	{
+		for (j = 0; j < np; j++)
+			printf(" %10.3e", a[i * n + j]);
+		printf("\n");
+	}
+}
+
+void init_matrix(double *a, int m, 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 < m; i++)
+		for (j = 0; j < n; j++)
+			a[i * n + j] = q(m, n, i+1, j+1);
+}

2025.03.21/Example/array_io.h

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

2025.03.21/Example/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 m, int n, int i, int j)
+{
+	return MAX(n, m) - MAX(i, j) + 1;
+}
+
+double f2(int m, int n, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return MAX(i, j);
+}
+
+double f3(int m, int n, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return abs(i - j);
+}
+
+double f4(int m, int n, int i, int j)
+{
+	(void)n;
+	(void)m;
+	return 1./(i+j-1);
+}

2025.03.21/Example/init_f.h

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

2025.03.21/Example/io_status.h

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

2025.03.21/Example/main.c

@@ -0,0 +1,65 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <time.h>
+#include "array_io.h"
+#include "io_status.h"
+#include "solve.h"
+
+/* ./a.out m n p k [filename] */
+int main(int argc, char *argv[])
+{
+	double t, res, *a;
+	int m, n, p, k, task = 1;
+	char *name = 0;
+	
+	if (!((argc == 5 || argc == 6) && 
+				sscanf(argv[1], "%d", &m) == 1 && 
+				sscanf(argv[2], "%d", &n) == 1 && 
+				sscanf(argv[3], "%d", &p) == 1 &&
+				sscanf(argv[4], "%d", &k) == 1 &&
+				k >= 0 && k <= 4 && (!(k == 0 && argc != 6))))
+	{
+		printf("Usage: %s m n p k [filename]\n", argv[0]);
+		return 1;
+	}
+	if (argc == 6) name = argv[5];
+	
+	a = (double *)malloc(m * n * sizeof(double));
+	if (!a)
+	{
+		printf("Not enough memory\n");
+		return 2;
+	}
+
+	if (name)
+	{ /* из файла */
+		io_status ret;
+		ret = read_matrix(a, m, 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);
+			}
+			free(a);
+			return 3;
+		} while (0);
+	} else init_matrix(a, m, n, k);
+
+	printf("Matrix:\n");
+	print_matrix(a, m, n, p);
+
+	t = clock();
+	res = t1_solve(a, m, n);
+	t = (clock() - t) / CLOCKS_PER_SEC;
+
+	printf ("%s : Task = %d Result = %e Elapsed = %.2f\n", argv[0], task, res, t);
+	
+	free(a);
+	return 0;
+}

2025.03.21/Example/solve.c

@@ -0,0 +1,27 @@
+#include "solve.h"
+#include <math.h>
+
+#define eps 1e-17
+
+int compare(const double a, const double b)
+{
+	if (a - b > eps) return 1;
+	else if (b - a > eps) return -1;
+	return 0;
+}
+
+double t1_solve(double *a, int m, int n)
+{
+	int i, j;
+	double cur = 0, maximum = 0;
+	
+	for (i = 0; i < n; i++)
+	{
+		cur = 0;
+		for (j = 0; j < m; j++)
+			cur += fabs(a[i * m + j]);
+		if (compare(cur, maximum) == 1) maximum = cur;
+	}
+
+	return maximum;
+}

2025.03.21/Example/solve.h

@@ -0,0 +1,7 @@
+#ifndef SOLVE_H
+#define SOLVE_H
+
+int compare(const double a, const double b);
+double t1_solve(double *a, int m, int n);
+
+#endif

scripts/fix-makefiles.sh

@@ -0,0 +1,14 @@
+#!/bin/bash
+# Скрипт для авто-исправления Makefile'ов: удаляет -lssp, меняет .exe → .out и del → rm
+
+find . -type f -name "Makefile" | while read -r file; do
+    echo "Обрабатываю: $file"
+        sed -i \
+                -e 's/-lssp//g' \
+                        -e 's/\.exe/\.out/g' \
+                                -e 's/\<del\>/rm/g' \
+                                        "$file"
+                                        done
+
+                                        echo "Готово!"
+