Added last three homeworks
This commit is contained in:
AZEN-SGG
parent
f7b2367bc4
commit
0e3d948c9f
363 changed files with 18214 additions and 0 deletions
15
2025.02.28/Linux/Makefile
Normal file
15
2025.02.28/Linux/Makefile
Normal file
|
|
@ -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.o sort.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
|
||||
|
||||
solve.o: solve.c solve.h
|
||||
array.o: array.c array.h
|
||||
sort.o: sort.c sort.h
|
||||
|
||||
clean:
|
||||
rm -f *.o *.out
|
||||
66
2025.02.28/Linux/a01.c
Normal file
66
2025.02.28/Linux/a01.c
Normal file
|
|
@ -0,0 +1,66 @@
|
|||
#include "solve.h"
|
||||
#include "sort.h"
|
||||
#include "array.h"
|
||||
#include "io_status.h"
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <time.h>
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
/* ./aout x c n p filename */
|
||||
int c, p, n, res, task = 1;
|
||||
io_status ret;
|
||||
char *name, *x, **a;
|
||||
int (*cmp)(const char *, const char *);
|
||||
int (*f[])(const char *, const char *) = {up_strcmp, down_strcmp, up_len, down_len};
|
||||
int len_f = sizeof(f) / sizeof(f[0]);
|
||||
double t;
|
||||
|
||||
if (!(argc == 6 && sscanf(argv[2], "%d", &c) && sscanf(argv[3], "%d", &n) == 1 && sscanf(argv[4], "%d", &p) == 1 && c >= 1 && c <= len_f))
|
||||
{
|
||||
printf("Usage %s x c n p name\n", argv[0]);
|
||||
return 1;
|
||||
}
|
||||
x = argv[1];
|
||||
name = argv[5];
|
||||
cmp = f[c-1];
|
||||
|
||||
if (!(a = (char **)malloc(n * sizeof(char *))))
|
||||
{
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
}
|
||||
ret = read_array(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);
|
||||
break;
|
||||
case ERROR_MEM:
|
||||
printf("Not enough memory");
|
||||
break;
|
||||
}
|
||||
free(a);
|
||||
return 3;
|
||||
} while (0);
|
||||
|
||||
print_array(a, n, p);
|
||||
t = clock();
|
||||
res = t1_solve(a, n, x, cmp);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
|
||||
printf("%s : Task = %d Res = %d Elapsed = %.2f\n", argv[0], task, res, t);
|
||||
|
||||
free_array(a, n);
|
||||
free(a);
|
||||
|
||||
return 0;
|
||||
}
|
||||
120
2025.02.28/Linux/a02.c
Normal file
120
2025.02.28/Linux/a02.c
Normal file
|
|
@ -0,0 +1,120 @@
|
|||
#include "solve.h"
|
||||
#include "sort.h"
|
||||
#include "array.h"
|
||||
#include "io_status.h"
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <time.h>
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
/* ./a02.out c n p_a filename_a m p_b filename_b */
|
||||
int c, p_a, n, p_b, m, diff, task = 2;
|
||||
io_status ret;
|
||||
char *name_a, *name_b, **arr_a, **arr_b, **arr_c;
|
||||
int (*cmp)(const char *, const char *);
|
||||
int (*f[])(const char *, const char *) = {up_strcmp, down_strcmp, up_len, down_len};
|
||||
int len_f = sizeof(f) / sizeof(f[0]);
|
||||
double t;
|
||||
|
||||
if (!(argc == 8 && sscanf(argv[1], "%d", &c) && sscanf(argv[2], "%d", &n) == 1 && sscanf(argv[3], "%d", &p_a) == 1 && sscanf(argv[5], "%d", &m) && sscanf(argv[6], "%d",&p_b) && c >= 1 && c <= len_f))
|
||||
{
|
||||
printf("Usage %s c n p_a filename_a m p_b filename_b\n", argv[0]);
|
||||
return 1;
|
||||
}
|
||||
name_a = argv[4];
|
||||
name_b = argv[7];
|
||||
cmp = f[c-1];
|
||||
|
||||
if (!(arr_a = (char **)malloc(n * sizeof(char *))))
|
||||
{
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
}
|
||||
if (!(arr_b = (char **)malloc(m * sizeof(char *))))
|
||||
{
|
||||
free(arr_a);
|
||||
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
}
|
||||
if (!(arr_c = (char **)malloc((n+m) * sizeof(char *))))
|
||||
{
|
||||
free(arr_a);
|
||||
free(arr_b);
|
||||
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
}
|
||||
|
||||
|
||||
ret = read_array(arr_a, n, 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;
|
||||
case ERROR_MEM:
|
||||
printf("Not enough memory");
|
||||
break;
|
||||
}
|
||||
free(arr_a);
|
||||
free(arr_b);
|
||||
free(arr_c);
|
||||
return 3;
|
||||
} while (0);
|
||||
|
||||
ret = read_array(arr_b, m, 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;
|
||||
case ERROR_MEM:
|
||||
printf("Not enough memory");
|
||||
break;
|
||||
}
|
||||
free_array(arr_a, n);
|
||||
|
||||
free(arr_a);
|
||||
free(arr_b);
|
||||
free(arr_c);
|
||||
return 3;
|
||||
} while (0);
|
||||
|
||||
print_array(arr_a, n, p_a);
|
||||
printf("\n");
|
||||
print_array(arr_b, m, p_b);
|
||||
|
||||
t = clock();
|
||||
t2_solve(arr_a, arr_b, arr_c, n, m, cmp);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
diff = check(arr_c, n+m, cmp);
|
||||
|
||||
printf("New array:\n");
|
||||
print_array(arr_c, n+m, p_a+p_b);
|
||||
printf("%s : Task = %d Diff = %d Elapsed = %.2f\n", argv[0], task, diff, t);
|
||||
|
||||
free_array(arr_a, n);
|
||||
free_array(arr_b, m);
|
||||
|
||||
free(arr_a);
|
||||
free(arr_b);
|
||||
free(arr_c);
|
||||
|
||||
return 0;
|
||||
}
|
||||
68
2025.02.28/Linux/a03.c
Normal file
68
2025.02.28/Linux/a03.c
Normal file
|
|
@ -0,0 +1,68 @@
|
|||
#include "solve.h"
|
||||
#include "sort.h"
|
||||
#include "array.h"
|
||||
#include "io_status.h"
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <time.h>
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
/* ./aout x c n p filename */
|
||||
int c, p, n, res, task = 3;
|
||||
io_status ret;
|
||||
char *name, *x, **a;
|
||||
int (*cmp)(const char *, const char *);
|
||||
int (*f[])(const char *, const char *) = {up_strcmp, down_strcmp, up_len, down_len};
|
||||
int len_f = sizeof(f) / sizeof(f[0]);
|
||||
double t;
|
||||
|
||||
if (!(argc == 6 && sscanf(argv[2], "%d", &c) && sscanf(argv[3], "%d", &n) == 1 && sscanf(argv[4], "%d", &p) == 1 && c >= 1 && c <= len_f))
|
||||
{
|
||||
printf("Usage %s x c n p name\n", argv[0]);
|
||||
return 1;
|
||||
}
|
||||
x = argv[1];
|
||||
name = argv[5];
|
||||
cmp = f[c-1];
|
||||
|
||||
if (!(a = (char **)malloc(n * sizeof(char *))))
|
||||
{
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
}
|
||||
ret = read_array(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);
|
||||
break;
|
||||
case ERROR_MEM:
|
||||
printf("Not enough memory");
|
||||
break;
|
||||
}
|
||||
free(a);
|
||||
return 3;
|
||||
} while (0);
|
||||
|
||||
print_array(a, n, p);
|
||||
t = clock();
|
||||
res = t3_solve(a, n, x, cmp);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
|
||||
printf("New array:\n");
|
||||
print_array(a, n, p);
|
||||
printf("%s : Task = %d Res = %d Elapsed = %.2f\n", argv[0], task, res, t);
|
||||
|
||||
free_array(a, n);
|
||||
free(a);
|
||||
|
||||
return 0;
|
||||
}
|
||||
68
2025.02.28/Linux/a04.c
Normal file
68
2025.02.28/Linux/a04.c
Normal file
|
|
@ -0,0 +1,68 @@
|
|||
#include "solve.h"
|
||||
#include "sort.h"
|
||||
#include "array.h"
|
||||
#include "io_status.h"
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <time.h>
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
/* ./a04.out c n p filename */
|
||||
int c, n, p, diff, task = 4;
|
||||
io_status ret;
|
||||
char *name, **a;
|
||||
int (*cmp)(const char *, const char *);
|
||||
int (*f[])(const char *, const char *) = {up_strcmp, down_strcmp, up_len, down_len};
|
||||
int len_f = sizeof(f) / sizeof(f[0]);
|
||||
double t;
|
||||
|
||||
if (!(argc == 5 && sscanf(argv[1], "%d", &c) && sscanf(argv[2], "%d", &n) == 1 && sscanf(argv[3], "%d", &p) == 1 && c >= 1 && c <= len_f))
|
||||
{
|
||||
printf("Usage %s c n p name\n", argv[0]);
|
||||
return 1;
|
||||
}
|
||||
name = argv[4];
|
||||
cmp = f[c-1];
|
||||
|
||||
if (!(a = (char **)malloc(n * sizeof(char *))))
|
||||
{
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
}
|
||||
ret = read_array(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);
|
||||
break;
|
||||
case ERROR_MEM:
|
||||
printf("Not enough memory");
|
||||
break;
|
||||
}
|
||||
free(a);
|
||||
return 3;
|
||||
} while (0);
|
||||
|
||||
print_array(a, n, p);
|
||||
t = clock();
|
||||
t4_solve(a, n, cmp);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
diff = check(a, n, cmp);
|
||||
|
||||
printf("New array:\n");
|
||||
print_array(a, n, p);
|
||||
printf("%s : Task = %d Diff = %d Elapsed = %.2f\n", argv[0], task, diff, t);
|
||||
|
||||
free_array(a, n);
|
||||
free(a);
|
||||
|
||||
return 0;
|
||||
}
|
||||
68
2025.02.28/Linux/a05.c
Normal file
68
2025.02.28/Linux/a05.c
Normal file
|
|
@ -0,0 +1,68 @@
|
|||
#include "solve.h"
|
||||
#include "sort.h"
|
||||
#include "array.h"
|
||||
#include "io_status.h"
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <time.h>
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
/* ./a05.out c n p filename */
|
||||
int c, n, p, diff, task = 5;
|
||||
io_status ret;
|
||||
char *name, **a;
|
||||
int (*cmp)(const char *, const char *);
|
||||
int (*f[])(const char *, const char *) = {up_strcmp, down_strcmp, up_len, down_len};
|
||||
int len_f = sizeof(f) / sizeof(f[0]);
|
||||
double t;
|
||||
|
||||
if (!(argc == 5 && sscanf(argv[1], "%d", &c) && sscanf(argv[2], "%d", &n) == 1 && sscanf(argv[3], "%d", &p) == 1 && c >= 1 && c <= len_f))
|
||||
{
|
||||
printf("Usage %s c n p name\n", argv[0]);
|
||||
return 1;
|
||||
}
|
||||
name = argv[4];
|
||||
cmp = f[c-1];
|
||||
|
||||
if (!(a = (char **)malloc(n * sizeof(char *))))
|
||||
{
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
}
|
||||
ret = read_array(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);
|
||||
break;
|
||||
case ERROR_MEM:
|
||||
printf("Not enough memory");
|
||||
break;
|
||||
}
|
||||
free(a);
|
||||
return 3;
|
||||
} while (0);
|
||||
|
||||
print_array(a, n, p);
|
||||
t = clock();
|
||||
t5_solve(a, n, cmp);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
diff = check(a, n, cmp);
|
||||
|
||||
printf("New array:\n");
|
||||
print_array(a, n, p);
|
||||
printf("%s : Task = %d Diff = %d Elapsed = %.2f\n", argv[0], task, diff, t);
|
||||
|
||||
free_array(a, n);
|
||||
free(a);
|
||||
|
||||
return 0;
|
||||
}
|
||||
68
2025.02.28/Linux/a06.c
Normal file
68
2025.02.28/Linux/a06.c
Normal file
|
|
@ -0,0 +1,68 @@
|
|||
#include "solve.h"
|
||||
#include "sort.h"
|
||||
#include "array.h"
|
||||
#include "io_status.h"
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <time.h>
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
/* ./a06.out c n p filename */
|
||||
int c, n, p, diff, task = 6;
|
||||
io_status ret;
|
||||
char *name, **a;
|
||||
int (*cmp)(const char *, const char *);
|
||||
int (*f[])(const char *, const char *) = {up_strcmp, down_strcmp, up_len, down_len};
|
||||
int len_f = sizeof(f) / sizeof(f[0]);
|
||||
double t;
|
||||
|
||||
if (!(argc == 5 && sscanf(argv[1], "%d", &c) && sscanf(argv[2], "%d", &n) == 1 && sscanf(argv[3], "%d", &p) == 1 && c >= 1 && c <= len_f))
|
||||
{
|
||||
printf("Usage %s c n p name\n", argv[0]);
|
||||
return 1;
|
||||
}
|
||||
name = argv[4];
|
||||
cmp = f[c-1];
|
||||
|
||||
if (!(a = (char **)malloc(n * sizeof(char *))))
|
||||
{
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
}
|
||||
ret = read_array(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);
|
||||
break;
|
||||
case ERROR_MEM:
|
||||
printf("Not enough memory");
|
||||
break;
|
||||
}
|
||||
free(a);
|
||||
return 3;
|
||||
} while (0);
|
||||
|
||||
print_array(a, n, p);
|
||||
t = clock();
|
||||
t6_solve(a, n, cmp);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
diff = check(a, n, cmp);
|
||||
|
||||
printf("New array:\n");
|
||||
print_array(a, n, p);
|
||||
printf("%s : Task = %d Diff = %d Elapsed = %.2f\n", argv[0], task, diff, t);
|
||||
|
||||
free_array(a, n);
|
||||
free(a);
|
||||
|
||||
return 0;
|
||||
}
|
||||
68
2025.02.28/Linux/a07.c
Normal file
68
2025.02.28/Linux/a07.c
Normal file
|
|
@ -0,0 +1,68 @@
|
|||
#include "solve.h"
|
||||
#include "sort.h"
|
||||
#include "array.h"
|
||||
#include "io_status.h"
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <time.h>
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
/* ./a07.out c n p filename */
|
||||
int c, n, p, diff, task = 7;
|
||||
io_status ret;
|
||||
char *name, **a;
|
||||
int (*cmp)(const char *, const char *);
|
||||
int (*f[])(const char *, const char *) = {up_strcmp, down_strcmp, up_len, down_len};
|
||||
int len_f = sizeof(f) / sizeof(f[0]);
|
||||
double t;
|
||||
|
||||
if (!(argc == 5 && sscanf(argv[1], "%d", &c) && sscanf(argv[2], "%d", &n) == 1 && sscanf(argv[3], "%d", &p) == 1 && c >= 1 && c <= len_f))
|
||||
{
|
||||
printf("Usage %s c n p name\n", argv[0]);
|
||||
return 1;
|
||||
}
|
||||
name = argv[4];
|
||||
cmp = f[c-1];
|
||||
|
||||
if (!(a = (char **)malloc(n * sizeof(char *))))
|
||||
{
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
}
|
||||
ret = read_array(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);
|
||||
break;
|
||||
case ERROR_MEM:
|
||||
printf("Not enough memory");
|
||||
break;
|
||||
}
|
||||
free(a);
|
||||
return 3;
|
||||
} while (0);
|
||||
|
||||
print_array(a, n, p);
|
||||
t = clock();
|
||||
t7_solve(a, n, cmp);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
diff = check(a, n, cmp);
|
||||
|
||||
printf("New array:\n");
|
||||
print_array(a, n, p);
|
||||
printf("%s : Task = %d Diff = %d Elapsed = %.2f\n", argv[0], task, diff, t);
|
||||
|
||||
free_array(a, n);
|
||||
free(a);
|
||||
|
||||
return 0;
|
||||
}
|
||||
76
2025.02.28/Linux/a08.c
Normal file
76
2025.02.28/Linux/a08.c
Normal file
|
|
@ -0,0 +1,76 @@
|
|||
#include "solve.h"
|
||||
#include "sort.h"
|
||||
#include "array.h"
|
||||
#include "io_status.h"
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <time.h>
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
/* ./a08.out c n p filename */
|
||||
int c, n, p, diff, task = 8;
|
||||
io_status ret;
|
||||
char *name, **a, **b;
|
||||
int (*cmp)(const char *, const char *);
|
||||
int (*f[])(const char *, const char *) = {up_strcmp, down_strcmp, up_len, down_len};
|
||||
int len_f = sizeof(f) / sizeof(f[0]);
|
||||
double t;
|
||||
|
||||
if (!(argc == 5 && sscanf(argv[1], "%d", &c) && sscanf(argv[2], "%d", &n) == 1 && sscanf(argv[3], "%d", &p) == 1 && c >= 1 && c <= len_f))
|
||||
{
|
||||
printf("Usage %s c n p name\n", argv[0]);
|
||||
return 1;
|
||||
}
|
||||
name = argv[4];
|
||||
cmp = f[c-1];
|
||||
|
||||
if (!(a = (char **)malloc(n * sizeof(char *))))
|
||||
{
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
} if (!(b = (char **)malloc(n * sizeof(char *))))
|
||||
{
|
||||
|
||||
free(a);
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
}
|
||||
memset(b, 0, (n * sizeof(char *)));
|
||||
ret = read_array(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);
|
||||
break;
|
||||
case ERROR_MEM:
|
||||
printf("Not enough memory");
|
||||
break;
|
||||
}
|
||||
free(a);
|
||||
return 3;
|
||||
} while (0);
|
||||
|
||||
print_array(a, n, p);
|
||||
t = clock();
|
||||
t8_solve(a, b, n, cmp);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
diff = check(a, n, cmp);
|
||||
|
||||
printf("New array:\n");
|
||||
print_array(a, n, p);
|
||||
printf("%s : Task = %d Diff = %d Elapsed = %.2f\n", argv[0], task, diff, t);
|
||||
|
||||
free_array(a, n);
|
||||
free(a);
|
||||
free(b);
|
||||
|
||||
return 0;
|
||||
}
|
||||
68
2025.02.28/Linux/a09.c
Normal file
68
2025.02.28/Linux/a09.c
Normal file
|
|
@ -0,0 +1,68 @@
|
|||
#include "solve.h"
|
||||
#include "sort.h"
|
||||
#include "array.h"
|
||||
#include "io_status.h"
|
||||
#include <stdlib.h>
|
||||
#include <stdio.h>
|
||||
#include <time.h>
|
||||
|
||||
int main(int argc, char *argv[])
|
||||
{
|
||||
/* ./a09.out c n p filename */
|
||||
int c, n, p, diff, task = 9;
|
||||
io_status ret;
|
||||
char *name, **a;
|
||||
int (*cmp)(const char *, const char *);
|
||||
int (*f[])(const char *, const char *) = {up_strcmp, down_strcmp, up_len, down_len};
|
||||
int len_f = sizeof(f) / sizeof(f[0]);
|
||||
double t;
|
||||
|
||||
if (!(argc == 5 && sscanf(argv[1], "%d", &c) && sscanf(argv[2], "%d", &n) == 1 && sscanf(argv[3], "%d", &p) == 1 && c >= 1 && c <= len_f))
|
||||
{
|
||||
printf("Usage %s c n p name\n", argv[0]);
|
||||
return 1;
|
||||
}
|
||||
name = argv[4];
|
||||
cmp = f[c-1];
|
||||
|
||||
if (!(a = (char **)malloc(n * sizeof(char *))))
|
||||
{
|
||||
printf("Not enough memory: \n");
|
||||
return 2;
|
||||
}
|
||||
ret = read_array(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);
|
||||
break;
|
||||
case ERROR_MEM:
|
||||
printf("Not enough memory");
|
||||
break;
|
||||
}
|
||||
free(a);
|
||||
return 3;
|
||||
} while (0);
|
||||
|
||||
print_array(a, n, p);
|
||||
t = clock();
|
||||
t9_solve(a, n, cmp);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
diff = check(a, n, cmp);
|
||||
|
||||
printf("New array:\n");
|
||||
print_array(a, n, p);
|
||||
printf("%s : Task = %d Diff = %d Elapsed = %.2f\n", argv[0], task, diff, t);
|
||||
|
||||
free_array(a, n);
|
||||
free(a);
|
||||
|
||||
return 0;
|
||||
}
|
||||
73
2025.02.28/Linux/array.c
Normal file
73
2025.02.28/Linux/array.c
Normal file
|
|
@ -0,0 +1,73 @@
|
|||
#include "array.h"
|
||||
|
||||
io_status read_array(char* a[], int n, const char * name)
|
||||
{
|
||||
char buf[LEN] = {0};
|
||||
FILE *fp = 0;
|
||||
int i, j;
|
||||
|
||||
if (!(fp = fopen(name, "r"))) return ERROR_OPEN;
|
||||
for (i = 0; i < n; i++) {
|
||||
if (!fgets(buf, sizeof(buf), fp))
|
||||
{
|
||||
fclose(fp);
|
||||
free_array(a, i);
|
||||
return ERROR_READ;
|
||||
}
|
||||
|
||||
for (j = 0; buf[j]; j++)
|
||||
{
|
||||
if (buf[j] == '\n')
|
||||
{
|
||||
buf[j] = 0;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
a[i] = (char *)malloc((j+1) * sizeof(char));
|
||||
if (!a[i])
|
||||
{
|
||||
fclose(fp);
|
||||
free_array(a, i);
|
||||
return ERROR_MEM;
|
||||
}
|
||||
|
||||
strcpy(a[i], buf);
|
||||
}
|
||||
|
||||
fclose(fp);
|
||||
return SUCCESS;
|
||||
}
|
||||
|
||||
|
||||
void free_array(char ** a, int n)
|
||||
{
|
||||
int i;
|
||||
for(i = 0; i < n; ++i)
|
||||
{
|
||||
if (a[i])
|
||||
{
|
||||
free(a[i]);
|
||||
a[i] = 0;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void print_array(char ** a, int n, int m)
|
||||
{
|
||||
int l = (n > m ? m : n);
|
||||
int i;
|
||||
for (i = 0; i < l; ++i) printf("%s\n", a[i]);
|
||||
}
|
||||
|
||||
int check(char **a, int n, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
/* Каждый элемент больше следующего */
|
||||
int i; int count = 0;
|
||||
for (i = 1; i < n; i++)
|
||||
{
|
||||
if ((*cmp)(a[i-1], a[i]) > 0)
|
||||
count++;
|
||||
}
|
||||
return count;
|
||||
}
|
||||
15
2025.02.28/Linux/array.h
Normal file
15
2025.02.28/Linux/array.h
Normal file
|
|
@ -0,0 +1,15 @@
|
|||
#ifndef ARRAY_H
|
||||
#define ARRAY_H
|
||||
|
||||
#include "io_status.h"
|
||||
|
||||
#include <stdio.h>
|
||||
#include <string.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
io_status read_array(char *a[], int n, const char *name);
|
||||
void free_array(char **a, int n);
|
||||
void print_array(char **a, int n, int m);
|
||||
int check(char **a, int n, int (*cmp)(const char *, const char *));
|
||||
|
||||
#endif
|
||||
14
2025.02.28/Linux/io_status.h
Normal file
14
2025.02.28/Linux/io_status.h
Normal file
|
|
@ -0,0 +1,14 @@
|
|||
#ifndef IO_STATUS_H
|
||||
#define IO_STATUS_H
|
||||
|
||||
#define LEN 1234
|
||||
|
||||
typedef enum _io_status
|
||||
{
|
||||
SUCCESS,
|
||||
ERROR_OPEN,
|
||||
ERROR_READ,
|
||||
ERROR_MEM
|
||||
} io_status;
|
||||
|
||||
#endif
|
||||
237
2025.02.28/Linux/solve.c
Normal file
237
2025.02.28/Linux/solve.c
Normal file
|
|
@ -0,0 +1,237 @@
|
|||
// Program from 1Ex
|
||||
#include "solve.h"
|
||||
|
||||
int t1_solve(char **a, int n, char *x, int (*cmp)(const char *, const char *)) {
|
||||
int avg = (n + (-1)*(n%2)) / 2;
|
||||
int comp;
|
||||
|
||||
if (n == 0) return 0;
|
||||
|
||||
comp = cmp(x, a[avg]);
|
||||
if (comp < 0) return t1_solve(a, avg, x, cmp);
|
||||
if (comp > 0) return avg+1 + t1_solve(a+avg+1, n-(avg+1), x, cmp);
|
||||
else return avg;
|
||||
}
|
||||
|
||||
// Program from 2Ex
|
||||
|
||||
void t2_solve(char **arr_a, char **arr_b, char **arr_c, int n, int m, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
int i, j, k, cntr, len = n + m; // cntr - contrast
|
||||
for (i = 0, j = 0, k = 0; k < len; ++k)
|
||||
{
|
||||
if (i >= n)
|
||||
{
|
||||
arr_c[k] = arr_b[j++];
|
||||
} else if (j >= m)
|
||||
{
|
||||
arr_c[k] = arr_a[i++];
|
||||
} else
|
||||
{
|
||||
cntr = cmp(arr_a[i], arr_b[j]);
|
||||
if (cntr <= 0) arr_c[k] = arr_a[i++];
|
||||
else arr_c[k] = arr_b[j++];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Program from 3Ex
|
||||
|
||||
int t3_solve(char **a, int n, char *x, int (*cmp)(const char *, const char *)) {
|
||||
int i = 0, j = n-1;
|
||||
char *temp;
|
||||
|
||||
while (1)
|
||||
{
|
||||
for (; i < n; i++) if (cmp(a[i], x) >= 0) break;
|
||||
for (; j >= 0; j--) if (cmp(a[j], x) < 0) break;
|
||||
|
||||
if (i >= j) break;
|
||||
temp = a[i];
|
||||
a[i] = a[j];
|
||||
a[j] = temp;
|
||||
|
||||
i++, j--;
|
||||
}
|
||||
|
||||
return i;
|
||||
}
|
||||
|
||||
// Program from 4Ex
|
||||
|
||||
void t4_solve(char **a, int n, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
char *temp;
|
||||
int i, j;
|
||||
for (i=n; i > 0; --i)
|
||||
{
|
||||
for (j=0; j < i-1; ++j)
|
||||
{
|
||||
if (cmp(a[j], a[j+1]) >= 0)
|
||||
{
|
||||
temp = a[j];
|
||||
a[j] = a[j+1];
|
||||
a[j+1] = temp;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Program from 5Ex
|
||||
|
||||
void t5_solve(char **a, int n, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
char *temp;
|
||||
size_t size_c = sizeof(char);
|
||||
int i, min;
|
||||
for (i=0; i < n-1; ++i)
|
||||
{
|
||||
min = minimum(a+i*size_c, n-i, cmp)+i;
|
||||
temp = a[min];
|
||||
a[min] = a[i];
|
||||
a[i] = temp;
|
||||
}
|
||||
}
|
||||
|
||||
int minimum(char **a, int n, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
int i, min=0;
|
||||
if (n <= 0) return 0;
|
||||
for (i = 1; i < n; ++i)
|
||||
{
|
||||
if (cmp(a[min], a[i]) > 0) min = i;
|
||||
}
|
||||
|
||||
return min;
|
||||
}
|
||||
|
||||
// Program from 6Ex
|
||||
|
||||
void t6_solve(char **a, int n, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
int i;
|
||||
for (i = 1; i < n; ++i) t6_append(a, i+1, a[i], t6_find(a, i, a[i], cmp));
|
||||
}
|
||||
|
||||
int t6_find(char **arr, int n, char *a, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
int i;
|
||||
for (i=0; i<n; ++i) if (cmp(a, arr[i]) < 0) break;
|
||||
return i;
|
||||
}
|
||||
|
||||
void t6_append(char **arr, int n, char *a, int index)
|
||||
{
|
||||
for (int i = n-1; i > index; --i) arr[i] = arr[i-1];
|
||||
arr[index] = a;
|
||||
}
|
||||
|
||||
// Program from 7Ex
|
||||
|
||||
void t7_solve(char **a, int n, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
int i;
|
||||
for (i = 1; i < n; ++i) t7_append(a, i+1, a[i], t7_find(a, i, a[i], cmp));
|
||||
}
|
||||
|
||||
int t7_find(char **a, int n, char *x, int (*cmp)(const char *, const char *)) {
|
||||
int avg = (n + (-1)*(n%2)) / 2;
|
||||
int comp;
|
||||
|
||||
if (n == 0) return 0;
|
||||
|
||||
comp = cmp(x, a[avg]);
|
||||
if (comp < 0) return t7_find(a, avg, x, cmp);
|
||||
if (comp > 0) return avg+1 + t7_find(a+(avg+1), n-(avg+1), x, cmp);
|
||||
else return avg;
|
||||
}
|
||||
|
||||
void t7_append(char **arr, int n, char *a, int index)
|
||||
{
|
||||
for (int i = n-1; i > index; --i) arr[i] = arr[i-1];
|
||||
arr[index] = a;
|
||||
}
|
||||
// Program from 8Ex
|
||||
|
||||
void t8_solve(char **a, char **b, int n, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
int i = 2, j, margin;
|
||||
do {
|
||||
int hf_i = i/2;
|
||||
for (j = 0; j < n; j += i)
|
||||
{
|
||||
if (n < j+i)
|
||||
{
|
||||
margin = n-(j+hf_i);
|
||||
if (margin <= 0) break;
|
||||
} else margin = hf_i;
|
||||
|
||||
unite(a+j, a+(j+hf_i), b, hf_i, margin, cmp);
|
||||
for (int k = 0; k < hf_i+margin; k++) a[j+k] = b[k];
|
||||
}
|
||||
|
||||
i *= 2;
|
||||
} while (i < n*2);
|
||||
}
|
||||
|
||||
void unite(char **arr_a, char **arr_b, char **arr_c, int n, int m, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
int i, j, k, cntr, len = n + m; // cntr - contrast
|
||||
for (i = 0, j = 0, k = 0; k < len; ++k)
|
||||
{
|
||||
if (i >= n)
|
||||
{
|
||||
arr_c[k] = arr_b[j++];
|
||||
} else if (j >= m)
|
||||
{
|
||||
arr_c[k] = arr_a[i++];
|
||||
} else
|
||||
{
|
||||
cntr = cmp(arr_a[i], arr_b[j]);
|
||||
if (cntr <= 0) arr_c[k] = arr_a[i++];
|
||||
else arr_c[k] = arr_b[j++];
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Program from 9Ex
|
||||
|
||||
void t9_solve(char **a, int n, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
while (n > 1)
|
||||
{
|
||||
int is_edge = 0, ind_x = findIndex(a, n, a[n/2], cmp);
|
||||
if (ind_x < n-ind_x)
|
||||
{
|
||||
if (ind_x == 0) is_edge = 1;
|
||||
t9_solve(a, ind_x, cmp);
|
||||
a += ind_x + is_edge;
|
||||
n -= ind_x + is_edge;
|
||||
} else
|
||||
{
|
||||
t9_solve(a+ind_x, n-ind_x, cmp);
|
||||
n = ind_x;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int findIndex(char **a, int n, char *x, int (*cmp)(const char *, const char *))
|
||||
{
|
||||
int i = 0, j = n-1;
|
||||
char *temp;
|
||||
|
||||
while (1)
|
||||
{
|
||||
for (; i < n; i++) if (cmp(a[i], x) >= 0) break;
|
||||
for (; j >= 0; j--) if (cmp(a[j], x) <= 0) break;
|
||||
|
||||
if (i >= j) break;
|
||||
temp = a[i];
|
||||
a[i] = a[j];
|
||||
a[j] = temp;
|
||||
|
||||
i++, j--;
|
||||
}
|
||||
|
||||
return i;
|
||||
}
|
||||
42
2025.02.28/Linux/solve.h
Normal file
42
2025.02.28/Linux/solve.h
Normal file
|
|
@ -0,0 +1,42 @@
|
|||
#ifndef SOLVE_H
|
||||
#define SOLVE_H
|
||||
|
||||
#include <stddef.h>
|
||||
#include "array.h"
|
||||
#include "sort.h"
|
||||
|
||||
// Headers from 1Ex
|
||||
int t1_solve(char **a, int n, char *x, int (*cmp)(const char *, const char *));
|
||||
|
||||
// Headers from 2Ex
|
||||
void t2_solve(char **arr_a, char **arr_b, char **arr_c, int n, int m, int (*cmp)(const char *, const char *));
|
||||
|
||||
// Headers from 3Ex
|
||||
int t3_solve(char **a, int n, char *x, int (*cmp)(const char *, const char *));
|
||||
|
||||
// Headers from 4Ex
|
||||
void t4_solve(char **a, int n, int (*cmp)(const char *, const char *));
|
||||
|
||||
// Headers from 5Ex
|
||||
void t5_solve(char **a, int n, int (*cmp)(const char *, const char *));
|
||||
int minimum(char **a, int n, int (*cmp)(const char *, const char *));
|
||||
|
||||
// Headers from 6Ex
|
||||
void t6_solve(char **a, int n, int (*cmp)(const char *, const char *));
|
||||
int t6_find(char **arr, int n, char *a, int (*cmp)(const char *, const char *));
|
||||
void t6_append(char **arr, int n, char *a, int index);
|
||||
|
||||
// Headers from 7Ex
|
||||
void t7_solve(char **a, int n, int (*cmp)(const char *, const char *));
|
||||
int t7_find(char **arr, int n, char *a, int (*cmp)(const char *, const char *));
|
||||
void t7_append(char **arr, int n, char *a, int index);
|
||||
|
||||
// Headers from 8Ex
|
||||
void t8_solve(char **a, char **b, int n, int (*cmp)(const char *, const char *));
|
||||
void unite(char **arr_a, char **arr_b, char **arr_c, int n, int m, int (*cmp)(const char *, const char *));
|
||||
|
||||
// Headers from 9Ex
|
||||
void t9_solve(char **a, int n, int (*cmp)(const char *, const char *));
|
||||
int findIndex(char **a, int n, char *x, int (*cmp)(const char *, const char *));
|
||||
|
||||
#endif
|
||||
23
2025.02.28/Linux/sort.c
Normal file
23
2025.02.28/Linux/sort.c
Normal file
|
|
@ -0,0 +1,23 @@
|
|||
#include "sort.h"
|
||||
|
||||
int up_strcmp(const char *a, const char *b)
|
||||
{ return strcmp(a, b); }
|
||||
|
||||
int down_strcmp(const char *a, const char *b)
|
||||
{ return -strcmp(a, b); }
|
||||
|
||||
int up_len(const char *a, const char *b)
|
||||
{
|
||||
int i = 0;
|
||||
while (1)
|
||||
{
|
||||
if (a[i] == '\0' && b[i] == '\0') return strcmp(a, b);
|
||||
else if (a[i] == '\0') return -1;
|
||||
else if (b[i] == '\0') return 1;
|
||||
|
||||
i++;
|
||||
}
|
||||
}
|
||||
int down_len(const char *a, const char *b)
|
||||
{ return -up_len(a, b); }
|
||||
|
||||
11
2025.02.28/Linux/sort.h
Normal file
11
2025.02.28/Linux/sort.h
Normal file
|
|
@ -0,0 +1,11 @@
|
|||
#ifndef SORT_H
|
||||
#define SORT_H
|
||||
|
||||
#include <string.h>
|
||||
|
||||
int up_strcmp(const char *a, const char *b);
|
||||
int down_strcmp(const char *a, const char *b);
|
||||
int up_len(const char *a, const char *b);
|
||||
int down_len(const char *a, const char *b);
|
||||
|
||||
#endif
|
||||
Loading…
Add table
Add a link
Reference in a new issue