refactor(structure): normalize folder names with leading zeros for consistency
- Renamed all folders from format NEx (e.g., 1Ex, 2Ex...) to 0NEx (01Ex, 02Ex, etc.) - Updated subdirectories and files accordingly - Removed old main Makefile and tasks (a01.c–a09.c, solve.c, io_status.h), likely obsolete - Cleaned up deprecated task binaries and configs
This commit is contained in:
parent
2cf18a1ff3
commit
8a7aac7c23
385 changed files with 2 additions and 1468 deletions
8
2025.02.14/01Ex/Linux/Makefile
Normal file
8
2025.02.14/01Ex/Linux/Makefile
Normal file
|
@ -0,0 +1,8 @@
|
|||
all: main.o array.o
|
||||
gcc main.o array.o -o a01.out && rm *.o
|
||||
|
||||
main.o: main.c
|
||||
gcc -c main.c
|
||||
|
||||
array.o: array.c
|
||||
gcc -c array.c
|
71
2025.02.14/01Ex/Linux/array.c
Normal file
71
2025.02.14/01Ex/Linux/array.c
Normal file
|
@ -0,0 +1,71 @@
|
|||
#include "array.h"
|
||||
|
||||
|
||||
io_status process_s(const char * s, char * s1, char * s2, const size_t len_s) {
|
||||
size_t i;
|
||||
int j;
|
||||
for (i = 0, j = 0; i < len_s; ++i) {
|
||||
if (s[i] == '\\') {
|
||||
if (i + 1 == len_s) return ERROR_PATTERN;
|
||||
else {
|
||||
s1[j] = 0;
|
||||
s2[j++] = s[++i];
|
||||
}
|
||||
} else if ((s[i] == '^') && (i == 0)) {
|
||||
s1[j] = '1';
|
||||
s2[j++] = s[++i];
|
||||
} else {
|
||||
s1[j] = '0';
|
||||
s2[j++] = s[i];
|
||||
}
|
||||
}
|
||||
|
||||
s2[j] = '\0';
|
||||
|
||||
return SUCCESS;
|
||||
}
|
||||
|
||||
io_status process_file(const char * f_in, const char * f_out, const char * s1, const char * s2, int * r) {
|
||||
FILE * fp = fopen(f_in, "r");
|
||||
if (!fp) return ERROR_OPEN;
|
||||
else {
|
||||
char buf[LEN] = {0};
|
||||
size_t len_s = strlen(s2);
|
||||
FILE * fw = fopen(f_out, "w");
|
||||
int i;
|
||||
|
||||
if (!fw) {fclose(fp); return ERROR_OPEN;}
|
||||
for (i = 0; fgets(buf, sizeof(buf), fp);) {
|
||||
size_t len_buf = strlen(buf);
|
||||
bool is_approach = process_string(buf, s1, s2, len_s, len_buf);
|
||||
|
||||
if (is_approach)
|
||||
{
|
||||
i++;
|
||||
if (buf[len_buf - 1] == '\n') buf[len_buf - 1] = '\0';
|
||||
fprintf(fw, "%s\n", buf);
|
||||
}
|
||||
}
|
||||
|
||||
*r = i;
|
||||
}
|
||||
|
||||
return SUCCESS;
|
||||
}
|
||||
|
||||
bool process_string(const char * buf, const char * s1, const char * s2, const size_t len_s, const size_t len_buf) {
|
||||
if (len_buf < len_s) return false;
|
||||
|
||||
if (s1[0] == '1') {
|
||||
size_t i;
|
||||
for (i = 0; i < len_s; ++i) {
|
||||
if (buf[i] != s2[i]) return false;
|
||||
}
|
||||
} else {
|
||||
char * s_pointer = strstr(buf, s2);
|
||||
if (!s_pointer) return false;
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
13
2025.02.14/01Ex/Linux/array.h
Normal file
13
2025.02.14/01Ex/Linux/array.h
Normal file
|
@ -0,0 +1,13 @@
|
|||
#ifndef ARRAY_H
|
||||
#define ARRAY_H
|
||||
|
||||
#include "io_status.h"
|
||||
#include <stdio.h>
|
||||
#include <stdbool.h>
|
||||
#include <string.h>
|
||||
|
||||
io_status process_s(const char * s, char * s1, char * s2, const size_t len_s);
|
||||
io_status process_file(const char * f_in, const char * f_out, const char * s1, const char * s2, int * r);
|
||||
bool process_string(const char * buf, const char * s1, const char * s2, const size_t len_s, const size_t len_buf);
|
||||
|
||||
#endif
|
13
2025.02.14/01Ex/Linux/io_status.h
Normal file
13
2025.02.14/01Ex/Linux/io_status.h
Normal file
|
@ -0,0 +1,13 @@
|
|||
#ifndef IO_STATUS_H
|
||||
#define IO_STATUS_H
|
||||
|
||||
#define LEN 1234
|
||||
|
||||
typedef enum io_status_ {
|
||||
SUCCESS,
|
||||
ERROR_OPEN,
|
||||
ERROR_READ,
|
||||
ERROR_PATTERN,
|
||||
} io_status;
|
||||
|
||||
#endif
|
67
2025.02.14/01Ex/Linux/main.c
Normal file
67
2025.02.14/01Ex/Linux/main.c
Normal file
|
@ -0,0 +1,67 @@
|
|||
#include <stdio.h>
|
||||
#include <time.h>
|
||||
#include "io_status.h"
|
||||
#include "array.h"
|
||||
|
||||
io_status task1(const char* f_in, const char* f_out, const char* s, int* res);
|
||||
|
||||
io_status task1(const char* f_in, const char* f_out, const char* s, int* res)
|
||||
{
|
||||
if (s == NULL) return ERROR_PATTERN;
|
||||
else
|
||||
{
|
||||
size_t len_s = strlen(s);
|
||||
io_status status;
|
||||
char s1[len_s + 1]; // т.к. требуется место для \0
|
||||
char s2[len_s + 1];
|
||||
|
||||
memset(s1, 0, len_s + 1);
|
||||
memset(s2, 0, len_s + 1);
|
||||
|
||||
status = process_s(s, s1, s2, len_s);
|
||||
if (status != SUCCESS) return status;
|
||||
else
|
||||
{
|
||||
return process_file(f_in, f_out, s1, s2, res);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int main(int argc, char* argv[])
|
||||
{
|
||||
int task = 1;
|
||||
io_status ret;
|
||||
const char* f_in = 0;
|
||||
const char* f_out = 0;
|
||||
const char* s = 0;
|
||||
int res = 0;
|
||||
double t;
|
||||
if (argc != 4)
|
||||
{
|
||||
printf("Usage: %s <f_in> <f_out> <s>\n", argv[0]);
|
||||
return 1;
|
||||
}
|
||||
f_in = argv[1];
|
||||
f_out = argv[2];
|
||||
s = argv[3];
|
||||
t = clock();
|
||||
ret = task1(f_in, f_out, s, &res);
|
||||
t = (clock() - t) / CLOCKS_PER_SEC;
|
||||
switch (ret)
|
||||
{
|
||||
case SUCCESS:
|
||||
printf("%s : Task = %d Result = %d Elapsed = %.2f\n",
|
||||
argv[0], task, res, t);
|
||||
break;
|
||||
case ERROR_OPEN:
|
||||
printf("Can not open %s\n", f_out);
|
||||
return 1;
|
||||
case ERROR_READ:
|
||||
printf("Can not read %s\n", f_out);
|
||||
return 2;
|
||||
case ERROR_PATTERN:
|
||||
printf("Error in pattern %s\n", s);
|
||||
return 3;
|
||||
}
|
||||
return 0;
|
||||
}
|
Loading…
Add table
Add a link
Reference in a new issue