From 25b66d237273f153f752682241afcb925d71c530 Mon Sep 17 00:00:00 2001 From: AZEN-SGG Date: Thu, 6 Mar 2025 23:07:59 +0300 Subject: [PATCH] Create Linux version for check --- 2025.03.07/1Ex/main.c | 2 +- 2025.03.07/1Ex/solve.c | 2 +- 2025.03.07/2Ex/main.c | 2 +- 2025.03.07/Linux/Makefile | 15 ++++ 2025.03.07/Linux/a01.c | 64 +++++++++++++++++ 2025.03.07/Linux/a02.c | 64 +++++++++++++++++ 2025.03.07/Linux/a03.c | 65 ++++++++++++++++++ 2025.03.07/Linux/a04.c | 65 ++++++++++++++++++ 2025.03.07/Linux/a05.c | 65 ++++++++++++++++++ 2025.03.07/Linux/a06.c | 69 +++++++++++++++++++ 2025.03.07/Linux/a07.c | 69 +++++++++++++++++++ 2025.03.07/Linux/a08.c | 70 +++++++++++++++++++ 2025.03.07/Linux/a09.c | 124 +++++++++++++++++++++++++++++++++ 2025.03.07/Linux/a10.c | 130 +++++++++++++++++++++++++++++++++++ 2025.03.07/Linux/array_io.c | 77 +++++++++++++++++++++ 2025.03.07/Linux/array_io.h | 16 +++++ 2025.03.07/Linux/init_f.c | 30 ++++++++ 2025.03.07/Linux/init_f.h | 9 +++ 2025.03.07/Linux/io_status.h | 13 ++++ 2025.03.07/Linux/solve.c | 113 ++++++++++++++++++++++++++++++ 2025.03.07/Linux/solve.h | 15 ++++ 21 files changed, 1076 insertions(+), 3 deletions(-) create mode 100644 2025.03.07/Linux/Makefile create mode 100644 2025.03.07/Linux/a01.c create mode 100644 2025.03.07/Linux/a02.c create mode 100644 2025.03.07/Linux/a03.c create mode 100644 2025.03.07/Linux/a04.c create mode 100644 2025.03.07/Linux/a05.c create mode 100644 2025.03.07/Linux/a06.c create mode 100644 2025.03.07/Linux/a07.c create mode 100644 2025.03.07/Linux/a08.c create mode 100644 2025.03.07/Linux/a09.c create mode 100644 2025.03.07/Linux/a10.c create mode 100644 2025.03.07/Linux/array_io.c create mode 100644 2025.03.07/Linux/array_io.h create mode 100644 2025.03.07/Linux/init_f.c create mode 100644 2025.03.07/Linux/init_f.h create mode 100644 2025.03.07/Linux/io_status.h create mode 100644 2025.03.07/Linux/solve.c create mode 100644 2025.03.07/Linux/solve.h diff --git a/2025.03.07/1Ex/main.c b/2025.03.07/1Ex/main.c index 8727dd5..e75409c 100644 --- a/2025.03.07/1Ex/main.c +++ b/2025.03.07/1Ex/main.c @@ -50,7 +50,7 @@ int main(int argc, char *argv[]) } while (0); } else init_sq_matrix(a, n, k); - printf("initial matrix:\n"); + printf("Initial matrix:\n"); print_sq_matrix(a, n, p); t = clock(); diff --git a/2025.03.07/1Ex/solve.c b/2025.03.07/1Ex/solve.c index 0d32ca3..bf5b598 100644 --- a/2025.03.07/1Ex/solve.c +++ b/2025.03.07/1Ex/solve.c @@ -10,5 +10,5 @@ int t1_solve(double *a, int n) for (j = i; j < n; j++) if (i != j) if (fabs(a[i * n + j] - a[j * n + i]) > eps) return 0; - return n; + return 1; } diff --git a/2025.03.07/2Ex/main.c b/2025.03.07/2Ex/main.c index a501808..35b6a4b 100644 --- a/2025.03.07/2Ex/main.c +++ b/2025.03.07/2Ex/main.c @@ -50,7 +50,7 @@ int main(int argc, char *argv[]) } while (0); } else init_sq_matrix(a, n, k); - printf("initial matrix:\n"); + printf("Initial matrix:\n"); print_sq_matrix(a, n, p); t = clock(); diff --git a/2025.03.07/Linux/Makefile b/2025.03.07/Linux/Makefile new file mode 100644 index 0000000..c682c84 --- /dev/null +++ b/2025.03.07/Linux/Makefile @@ -0,0 +1,15 @@ +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 + +%.out: %.o solve.o array_io.o init_f.o + gcc $(FLAGS) $^ -o $@ +%.o: %.c + gcc -c $(FLAGS) $< + +all: a01.out a02.out a03.out a04.out a05.out a06.out a07.out a08.out a09.out a10.out + +solve.o: solve.c solve.h +array_io.o: array_io.c array_io.h +init_f.o: init_f.c init_f.h + +clean: + rm -f *.o *.out diff --git a/2025.03.07/Linux/a01.c b/2025.03.07/Linux/a01.c new file mode 100644 index 0000000..e75409c --- /dev/null +++ b/2025.03.07/Linux/a01.c @@ -0,0 +1,64 @@ +#include +#include +#include +#include "array_io.h" +#include "io_status.h" +#include "solve.h" + +/* ./a.out n p k [filename] */ +int main(int argc, char *argv[]) +{ + double t, *a; + int n, p, k, res, task = 1; + 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) name = argv[4]; + + a = (double *)malloc(n * n * sizeof(double)); + if (!a) + { + printf("Not enough memory\n"); + return 2; + } + + if (name) + { /* из файла */ + io_status ret; + ret = read_sq_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); + } + free(a); + return 3; + } while (0); + } else init_sq_matrix(a, n, k); + + printf("Initial matrix:\n"); + print_sq_matrix(a, n, p); + + t = clock(); + res = t1_solve(a, n); + t = (clock() - t) / CLOCKS_PER_SEC; + + printf("Result = %d\n", res); + printf("%s : Task = %d Elapsed = %.2f\n", argv[0], task, t); + free(a); + return 0; +} diff --git a/2025.03.07/Linux/a02.c b/2025.03.07/Linux/a02.c new file mode 100644 index 0000000..35b6a4b --- /dev/null +++ b/2025.03.07/Linux/a02.c @@ -0,0 +1,64 @@ +#include +#include +#include +#include "array_io.h" +#include "io_status.h" +#include "solve.h" + +/* ./a.out n p k [filename] */ +int main(int argc, char *argv[]) +{ + double t, res, *a; + int n, p, k, task = 2; + 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) name = argv[4]; + + a = (double *)malloc(n * n * sizeof(double)); + if (!a) + { + printf("Not enough memory\n"); + return 2; + } + + if (name) + { /* из файла */ + io_status ret; + ret = read_sq_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); + } + free(a); + return 3; + } while (0); + } else init_sq_matrix(a, n, k); + + printf("Initial matrix:\n"); + print_sq_matrix(a, n, p); + + t = clock(); + res = t2_solve(a, n); + t = (clock() - t) / CLOCKS_PER_SEC; + + printf("Result = %10.3e\n", res); + printf("%s : Task = %d Elapsed = %.2f\n", argv[0], task, t); + free(a); + return 0; +} diff --git a/2025.03.07/Linux/a03.c b/2025.03.07/Linux/a03.c new file mode 100644 index 0000000..d935f36 --- /dev/null +++ b/2025.03.07/Linux/a03.c @@ -0,0 +1,65 @@ +#include +#include +#include +#include "array_io.h" +#include "io_status.h" +#include "solve.h" + +/* ./a.out n p k [filename] */ +int main(int argc, char *argv[]) +{ + double t, *a; + int n, p, k, task = 3; + 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) name = argv[4]; + + a = (double *)malloc(n * n * sizeof(double)); + if (!a) + { + printf("Not enough memory\n"); + return 2; + } + + if (name) + { /* из файла */ + io_status ret; + ret = read_sq_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); + } + free(a); + return 3; + } while (0); + } else init_sq_matrix(a, n, k); + + printf("Initial matrix:\n"); + print_sq_matrix(a, n, p); + + t = clock(); + t3_solve(a, n); + t = (clock() - t) / CLOCKS_PER_SEC; + + printf("Result matrix:\n"); + print_sq_matrix(a, n, p); + printf("%s : Task = %d Elapsed = %.2f\n", argv[0], task, t); + free(a); + return 0; +} diff --git a/2025.03.07/Linux/a04.c b/2025.03.07/Linux/a04.c new file mode 100644 index 0000000..326362a --- /dev/null +++ b/2025.03.07/Linux/a04.c @@ -0,0 +1,65 @@ +#include +#include +#include +#include "array_io.h" +#include "io_status.h" +#include "solve.h" + +/* ./a.out n p k [filename] */ +int main(int argc, char *argv[]) +{ + double t, *a; + int n, p, k, task = 4; + 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) name = argv[4]; + + a = (double *)malloc(n * n * sizeof(double)); + if (!a) + { + printf("Not enough memory\n"); + return 2; + } + + if (name) + { /* из файла */ + io_status ret; + ret = read_sq_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); + } + free(a); + return 3; + } while (0); + } else init_sq_matrix(a, n, k); + + printf("Initial matrix:\n"); + print_sq_matrix(a, n, p); + + t = clock(); + t4_solve(a, n); + t = (clock() - t) / CLOCKS_PER_SEC; + + printf("Result matrix:\n"); + print_sq_matrix(a, n, p); + printf("%s : Task = %d Elapsed = %.2f\n", argv[0], task, t); + free(a); + return 0; +} diff --git a/2025.03.07/Linux/a05.c b/2025.03.07/Linux/a05.c new file mode 100644 index 0000000..a44170c --- /dev/null +++ b/2025.03.07/Linux/a05.c @@ -0,0 +1,65 @@ +#include +#include +#include +#include "array_io.h" +#include "io_status.h" +#include "solve.h" + +/* ./a.out n p k [filename] */ +int main(int argc, char *argv[]) +{ + double t, *a; + int n, p, k, task = 5; + 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) name = argv[4]; + + a = (double *)malloc(n * n * sizeof(double)); + if (!a) + { + printf("Not enough memory\n"); + return 2; + } + + if (name) + { /* из файла */ + io_status ret; + ret = read_sq_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); + } + free(a); + return 3; + } while (0); + } else init_sq_matrix(a, n, k); + + printf("Initial matrix:\n"); + print_sq_matrix(a, n, p); + + t = clock(); + t5_solve(a, n); + t = (clock() - t) / CLOCKS_PER_SEC; + + printf("Result matrix:\n"); + print_sq_matrix(a, n, p); + printf("%s : Task = %d Elapsed = %.2f\n", argv[0], task, t); + free(a); + return 0; +} diff --git a/2025.03.07/Linux/a06.c b/2025.03.07/Linux/a06.c new file mode 100644 index 0000000..b01560e --- /dev/null +++ b/2025.03.07/Linux/a06.c @@ -0,0 +1,69 @@ +#include +#include +#include +#include "array_io.h" +#include "io_status.h" +#include "solve.h" + +/* ./a.out i j n m p k [filename] */ +int main(int argc, char *argv[]) +{ + double t, *a; + int i, j, n, m, p, k, task = 6; + char *name = 0; + + if (!((argc == 7 || argc == 8) && + sscanf(argv[1], "%d", &i) == 1 && + sscanf(argv[2], "%d", &j) == 1 && + sscanf(argv[3], "%d", &n) == 1 && + sscanf(argv[4], "%d", &m) == 1 && + sscanf(argv[5], "%d", &p) == 1 && + sscanf(argv[6], "%d", &k) == 1 && + k >= 0 && k <= 4 && (!(k == 0 && argc != 8)) && + (i <= n && j <= n) && (i > 0 && j > 0))) + { + printf("Usage: %s i j n m p k [filename]\n", argv[0]); + return 1; + } + if (argc == 8) name = argv[7]; + + a = (double *)malloc(n * m * sizeof(double)); + if (!a) + { + printf("Not enough memory\n"); + return 2; + } + + if (name) + { /* из файла */ + io_status ret; + ret = read_matrix(a, n, m, 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, n, m, k); + + printf("Initial matrix:\n"); + print_matrix(a, n, m, p); + + t = clock(); + t6_solve(a, n, m, i-1, j-1); + t = (clock() - t) / CLOCKS_PER_SEC; + + printf("Result matrix:\n"); + print_matrix(a, n, m, p); + printf("%s : Task = %d Elapsed = %.2f\n", argv[0], task, t); + free(a); + return 0; +} diff --git a/2025.03.07/Linux/a07.c b/2025.03.07/Linux/a07.c new file mode 100644 index 0000000..15be609 --- /dev/null +++ b/2025.03.07/Linux/a07.c @@ -0,0 +1,69 @@ +#include +#include +#include +#include "array_io.h" +#include "io_status.h" +#include "solve.h" + +/* ./a.out i j n m p k [filename] */ +int main(int argc, char *argv[]) +{ + double t, *a; + int i, j, n, m, p, k, task = 7; + char *name = 0; + + if (!((argc == 7 || argc == 8) && + sscanf(argv[1], "%d", &i) == 1 && + sscanf(argv[2], "%d", &j) == 1 && + sscanf(argv[3], "%d", &n) == 1 && + sscanf(argv[4], "%d", &m) == 1 && + sscanf(argv[5], "%d", &p) == 1 && + sscanf(argv[6], "%d", &k) == 1 && + k >= 0 && k <= 4 && (!(k == 0 && argc != 8)) && + (i <= m && j <= m) && (i > 0 && j > 0))) + { + printf("Usage: %s i j n m p k [filename]\n", argv[0]); + return 1; + } + if (argc == 8) name = argv[7]; + + a = (double *)malloc(n * m * sizeof(double)); + if (!a) + { + printf("Not enough memory\n"); + return 2; + } + + if (name) + { /* из файла */ + io_status ret; + ret = read_matrix(a, n, m, 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, n, m, k); + + printf("Initial matrix:\n"); + print_matrix(a, n, m, p); + + t = clock(); + t7_solve(a, n, m, i-1, j-1); + t = (clock() - t) / CLOCKS_PER_SEC; + + printf("Result matrix:\n"); + print_matrix(a, n, m, p); + printf("%s : Task = %d Elapsed = %.2f\n", argv[0], task, t); + free(a); + return 0; +} diff --git a/2025.03.07/Linux/a08.c b/2025.03.07/Linux/a08.c new file mode 100644 index 0000000..c69583a --- /dev/null +++ b/2025.03.07/Linux/a08.c @@ -0,0 +1,70 @@ +#include +#include +#include +#include "array_io.h" +#include "io_status.h" +#include "solve.h" + +/* ./a.out i j g n m p k [filename] */ +int main(int argc, char *argv[]) +{ + double g, t, *a; + int i, j, n, m, p, k, task = 8; + char *name = 0; + + if (!((argc == 8 || argc == 9) && + sscanf(argv[1], "%d", &i) == 1 && + sscanf(argv[2], "%d", &j) == 1 && + sscanf(argv[3], "%lf", &g) == 1 && + sscanf(argv[4], "%d", &n) == 1 && + sscanf(argv[5], "%d", &m) == 1 && + sscanf(argv[6], "%d", &p) == 1 && + sscanf(argv[7], "%d", &k) == 1 && + k >= 0 && k <= 4 && (!(k == 0 && argc != 9)) && + (i <= n && j <= m) && (i > 0 && j > 0))) + { + printf("Usage: %s i j g n m p k [filename]\n", argv[0]); + return 1; + } + if (argc == 9) name = argv[8]; + + a = (double *)malloc(n * m * sizeof(double)); + if (!a) + { + printf("Not enough memory\n"); + return 2; + } + + if (name) + { /* из файла */ + io_status ret; + ret = read_matrix(a, n, m, 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, n, m, k); + + printf("Initial matrix:\n"); + print_matrix(a, n, m, p); + + t = clock(); + t8_solve(a, n, m, i-1, j-1, g); + t = (clock() - t) / CLOCKS_PER_SEC; + + printf("Result matrix:\n"); + print_matrix(a, n, m, p); + printf("%s : Task = %d Elapsed = %.2f\n", argv[0], task, t); + free(a); + return 0; +} diff --git a/2025.03.07/Linux/a09.c b/2025.03.07/Linux/a09.c new file mode 100644 index 0000000..fb0936b --- /dev/null +++ b/2025.03.07/Linux/a09.c @@ -0,0 +1,124 @@ +#include +#include +#include +#include "array_io.h" +#include "io_status.h" +#include "solve.h" + +/* ./a.out n m p k_a [filename_a] k_b [filename_b] */ +int main(int argc, char *argv[]) +{ + double t, *a, *b, *c; + int n, m, p, k_a, k_b, task = 9; + char *name_a = 0, *name_b = 0; + // TODO: CHECK usage parametrs + if (!((argc == 6 || argc == 7 || argc == 8) && + sscanf(argv[1], "%d", &n) == 1 && + sscanf(argv[2], "%d", &m) == 1 && + sscanf(argv[3], "%d", &p) == 1 && + sscanf(argv[4], "%d", &k_a) == 1 && + (k_a >= 0 && k_a <= 4) && + (!(k_a == 0 && argc == 6)) && + ((k_a == 0 && sscanf(argv[6], "%d", &k_b) == 1) || + (k_a != 0 && sscanf(argv[5], "%d", &k_b) == 1)) && + (k_b >= 0 && k_b <= 4) && + (!(k_b == 0 && argc == 6)) && + (!((k_a == 0 && k_b == 0) && argc != 8)))) + { + printf("Usage: %s n m p k_a [filename_a] k_b [filename_b]\n", argv[0]); + return 1; + } + if (argc != 6) + { + int i_b = 6; + if (k_a == 0) {name_a = argv[5];i_b++;} + if (k_b == 0) name_b = argv[i_b]; + } + + a = (double *)malloc(n * m * sizeof(double)); + if (!a) + { + printf("Not enough memory\n"); + return 2; + } + b = (double *)malloc(m * sizeof(double)); + if (!b) + { + free(a); + printf("Not enough memory\n"); + return 2; + } + c = (double *)malloc(n * sizeof(double)); + if (!c) + { + free(a); + free(b); + printf("Not enough memory\n"); + return 2; + } + + if (name_a) + { /* из файла */ + io_status ret; + ret = read_matrix(a, n, m, name_a); + do { + switch (ret) + { + case SUCCESS: + continue; + case ERROR_OPEN: + printf("Cannot open %s\n", name_a); + break; + case ERROR_READ: + printf("Cannot read %s\n", name_a); + break; + } + free(a); + free(b); + free(c); + return 3; + } while (0); + } else init_matrix(a, n, m, k_a); + + if (name_b) + { + io_status ret; + ret = read_matrix(b, m, 1, name_b); + do { + switch (ret) + { + case SUCCESS: + continue; + case ERROR_OPEN: + printf("Cannot open %s\n", name_b); + break; + case ERROR_READ: + printf("Cannot read %s\n", name_b); + break; + } + free(a); + free(b); + free(c); + return 3; + } while (0); + } else init_matrix(b, m, 1, k_b); + + printf("Initial matrix A:\n"); + print_matrix(a, n, m, p); + printf("Initial vector b:\n"); + print_matrix(b, m, 1, p); + + t = clock(); + t9_solve(a, b, c, n, m); + t = (clock() - t) / CLOCKS_PER_SEC; + + printf("Result vector c:\n"); + print_matrix(c, n, 1, p); + printf("%s : Task = %d Elapsed = %.2f\n", argv[0], task, t); + + free(a); + free(b); + free(c); + + return 0; +} diff --git a/2025.03.07/Linux/a10.c b/2025.03.07/Linux/a10.c new file mode 100644 index 0000000..4ceb35e --- /dev/null +++ b/2025.03.07/Linux/a10.c @@ -0,0 +1,130 @@ +#include +#include +#include +#include "array_io.h" +#include "io_status.h" +#include "solve.h" + +/* ./a.out n m k p k_a [filename_a] k_b [filename_b] */ +int main(int argc, char *argv[]) +{ + double t, *a, *b, *c; + int n, m, k, p, k_a, k_b, task = 10; + char *name_a = 0, *name_b = 0; + + if (!((argc == 7 || argc == 8 || argc == 9) && + sscanf(argv[1], "%d", &n) == 1 && + sscanf(argv[2], "%d", &m) == 1 && + sscanf(argv[3], "%d", &k) == 1 && + sscanf(argv[4], "%d", &p) == 1 && + sscanf(argv[5], "%d", &k_a) == 1 && + (k_a >= 0 && k_a <= 4) && + (!(k_a == 0 && argc == 7)) && + ((k_a == 0 && sscanf(argv[7], "%d", &k_b) == 1) || + (k_a != 0 && sscanf(argv[6], "%d", &k_b) == 1)) && + (k_b >= 0 && k_b <= 4) && + (!(k_b == 0 && argc == 7)) && + (!((k_a == 0 && k_b == 0) && argc != 9)))) + { + printf("Usage: %s n m k p k_a [filename_a] k_b [filename_b]\n", argv[0]); + return 1; + } + + if (argc != 7) + { + int i_b = 7; + if (k_a == 0) { name_a = argv[6]; i_b++; } + if (k_b == 0) name_b = argv[i_b]; + } + + a = (double *)malloc(n * m * sizeof(double)); + if (!a) + { + printf("Not enough memory\n"); + return 2; + } + + b = (double *)malloc(m * k * sizeof(double)); + if (!b) + { + free(a); + printf("Not enough memory\n"); + return 2; + } + + c = (double *)malloc(n * k * sizeof(double)); + if (!c) + { + free(a); + free(b); + printf("Not enough memory\n"); + return 2; + } + + if (name_a) + { /* Читаем матрицу A из файла */ + io_status ret; + ret = read_matrix(a, n, m, name_a); + do { + switch (ret) + { + case SUCCESS: + continue; + case ERROR_OPEN: + printf("Cannot open %s\n", name_a); + break; + case ERROR_READ: + printf("Cannot read %s\n", name_a); + break; + } + free(a); + free(b); + free(c); + return 3; + } while (0); + } + else init_matrix(a, n, m, k_a); + + if (name_b) + { /* Читаем матрицу B из файла */ + io_status ret; + ret = read_matrix(b, m, k, name_b); + do { + switch (ret) + { + case SUCCESS: + continue; + case ERROR_OPEN: + printf("Cannot open %s\n", name_b); + break; + case ERROR_READ: + printf("Cannot read %s\n", name_b); + break; + } + free(a); + free(b); + free(c); + return 3; + } while (0); + } + else init_matrix(b, m, k, k_b); + + printf("Initial matrix A:\n"); + print_matrix(a, n, m, p); + printf("Initial vector b:\n"); + print_matrix(b, m, k, p); + + t = clock(); + matrix_multiply(a, b, c, n, m, k); + t = (clock() - t) / CLOCKS_PER_SEC; + + printf("Result vector c:\n"); + print_matrix(c, n, k, p); + printf("%s : Task = %d Elapsed = %.2f\n", argv[0], task, t); + + free(a); + free(b); + free(c); + + return 0; +} diff --git a/2025.03.07/Linux/array_io.c b/2025.03.07/Linux/array_io.c new file mode 100644 index 0000000..95205d7 --- /dev/null +++ b/2025.03.07/Linux/array_io.c @@ -0,0 +1,77 @@ +#include +#include "array_io.h" + +io_status read_sq_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_sq_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_sq_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); +} + +io_status read_matrix(double *a, int n, int m, 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 < m; j++) + if (fscanf(fp, "%lf", a + i * m + j) != 1) + {fclose(fp); return ERROR_READ;} + fclose(fp); + return SUCCESS; +} + +void print_matrix(const double *a, int n, int m, int p) +{ + int np = (n > p ? p : n); + int mp = (m > p ? p : m); + int i, j; + + for (i = 0; i < np; i++) + { + for (j = 0; j < mp; j++) + printf(" %10.3e", a[i * m + j]); + printf("\n"); + } +} + +void init_matrix(double *a, int n, int m, 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 < m; j++) + a[i * m + j] = q(n, m, i+1, j+1); +} diff --git a/2025.03.07/Linux/array_io.h b/2025.03.07/Linux/array_io.h new file mode 100644 index 0000000..07cc341 --- /dev/null +++ b/2025.03.07/Linux/array_io.h @@ -0,0 +1,16 @@ +#ifndef ARRAY_IO_H +#define ARRAY_IO_H + +#include "io_status.h" +#include "init_f.h" + +io_status read_sq_matrix(double *a, int n, const char *name); +void print_sq_matrix(const double *a, int n, int p); +void init_sq_matrix(double *a, int n, int k); + +io_status read_matrix(double *a, int n, int m, const char *name); +void print_matrix(const double *a, int n, int m, int p); +void init_matrix(double *a, int n, int m, int k); + + +#endif diff --git a/2025.03.07/Linux/init_f.c b/2025.03.07/Linux/init_f.c new file mode 100644 index 0000000..925afb5 --- /dev/null +++ b/2025.03.07/Linux/init_f.c @@ -0,0 +1,30 @@ +#include "init_f.h" +#include + +#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); +} diff --git a/2025.03.07/Linux/init_f.h b/2025.03.07/Linux/init_f.h new file mode 100644 index 0000000..691aace --- /dev/null +++ b/2025.03.07/Linux/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 diff --git a/2025.03.07/Linux/io_status.h b/2025.03.07/Linux/io_status.h new file mode 100644 index 0000000..420a981 --- /dev/null +++ b/2025.03.07/Linux/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 diff --git a/2025.03.07/Linux/solve.c b/2025.03.07/Linux/solve.c new file mode 100644 index 0000000..9ae6a1f --- /dev/null +++ b/2025.03.07/Linux/solve.c @@ -0,0 +1,113 @@ +#include "solve.h" +#include + +#define eps 1e-6 + +int t1_solve(double *a, int n) +{ + int i, j; + for (i = 0; i < n; i++) + for (j = i; j < n; j++) + if (i != j) + if (fabs(a[i * n + j] - a[j * n + i]) > eps) return 0; + return 1; +} + +double t2_solve(double *a, int n) +{ + double trace = 0; + int i; + for (i = 0; i < n; i++) + trace += a[i * n + i]; + return trace; +} + +void t3_solve(double *a, int n) +{ + double temp; + int i, j; + for (i = 0; i < n; i++) + for (j = i; j < n; j++) + if (i != j) { + temp = a[i * n + j]; + a[i * n + j] = a[j * n + i]; + a[j * n + i] = temp; + } +} + +void t4_solve(double *a, int n) +{ + double temp; + int i, j; + for (i = 0; i < n; i++) + for (j = i; j < n; j++) + if (i != j) { + temp = a[i * n + j]; + a[i * n + j] = (a[j * n + i] + temp) / 2; + a[j * n + i] = (a[j * n + i] + temp) / 2; + } +} + +void t5_solve(double *a, int n) +{ + double temp; + int i, j; + for (i = 0; i < n; i++) + for (j = i; j < n; j++) + if (i != j) { + temp = a[i * n + j]; + a[i * n + j] = (temp - a[j * n + i]) / 2; + a[j * n + i] = (a[j * n + i] - temp) / 2; + } else a[i * n + j] = 0; +} + +void t6_solve(double *a, int n, int m, int i, int j) +{ + double temp; + int k; + (void)n; + for (k = 0; k < m; k++) + { + temp = a[i * m + k]; + a[i * m + k] = a[j * m + k]; + a[j * m + k] = temp; + } +} + +void t7_solve(double *a, int n, int m, int i, int j) +{ + double temp; + int k; + for (k = 0; k < n; k++) + { + temp = a[k * m + i]; + a[k * m + i] = a[k * m + j]; + a[k * m + j] = temp; + } +} + +void t8_solve(double *a, int n, int m, int i, int j, double g) +{ + int k; + (void)n; + for (k = 0; k < m; k++) + a[j * m + k] += a[i * m + k] * g; +} + +void t9_solve(const double *A, const double *b, double *c, int n, int m) +{ + matrix_multiply(A, b, c, n, m, 1); +} + +void matrix_multiply(const double *A, const double *B, double *c, int n, int m, int l) +{ + int i, j, k, index; + for (i = 0; i < n; i++) + for (j = 0; j < l; j++) + { + index = i * l + j; + c[index] = 0; + for (k = 0; k < m; k++) + c[index] += A[i * m + k] * B[k * l + j]; + } +} diff --git a/2025.03.07/Linux/solve.h b/2025.03.07/Linux/solve.h new file mode 100644 index 0000000..0358f72 --- /dev/null +++ b/2025.03.07/Linux/solve.h @@ -0,0 +1,15 @@ +#ifndef SOLVE_H +#define SOLVE_H + +int t1_solve(double *a, int n); +double t2_solve(double *a, int n); +void t3_solve(double *a, int n); +void t4_solve(double *a, int n); +void t5_solve(double *a, int n); +void t6_solve(double *a, int n, int m, int i, int j); +void t7_solve(double *a, int n, int m, int i, int j); +void t8_solve(double *a, int n, int m, int i, int j, double g); +void t9_solve(const double *A, const double *b, double *c, int n, int m); +void matrix_multiply(const double *A, const double *B, double *c, int n, int m, int l); + +#endif \ No newline at end of file