8, 9, 10 tasks are done

2025.03.21/10Ex/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 = 10;
+	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 = t10_solve(a, m, n);
+	t = (clock() - t) / CLOCKS_PER_SEC;
+	
+	printf("New matrix:\n");
+	print_matrix(a, m - 1, n - 1, p);
+	printf ("%s : Task = %d Result = %d Elapsed = %.2f\n", argv[0], task, res, t);
+	
+	free(a);
+	return 0;
+}