AZEN-SGG/2nd_Sem_Bogachev
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Task 7 is done

Browse source
This commit is contained in:
AZEN-SGG 2025-05-21 12:31:06 +03:00
parent 6f21fa116f
commit 6ef0a8bfb3
17 changed files with 138 additions and 44 deletions
Download patch file Download diff file Expand all files Collapse all files

7
2025.05.23/04Ex/input/a.txt Normal file
View file

@ -0,0 +1,7 @@
1
5
4
3
2
3
1

0
2025.05.23/04Ex/input/e.txt Normal file
View file

5
2025.05.23/04Ex/input/f.txt Normal file
View file

@ -0,0 +1,5 @@
5
5
5
5
5

9
2025.05.23/04Ex/input/n.txt Normal file
View file

@ -0,0 +1,9 @@
1
5
4
4
4
4
4
6
1

5
2025.05.23/04Ex/input/o.txt Normal file
View file

@ -0,0 +1,5 @@
1
2
3
4
5

6
2025.05.23/04Ex/input/s.txt Normal file
View file

@ -0,0 +1,6 @@
1
5
5
5
5
6

5
2025.05.23/04Ex/solve.c
View file

@ -43,6 +43,11 @@ int t4_solve (node *head)
head = next; head = next;
} }
if (strcmp(head->string, last->string) <= 0)
if (strict)
if (maximum < count)
maximum = count;
return maximum; return maximum;
} }

12
2025.05.23/06Ex/solve.c
View file

@ -6,15 +6,21 @@
int t6_solve (node *head) int t6_solve (node *head)
{ {
char *last = head->string; char *last = head->string;
int count = 1; int count = 0, local = 0;
for (head = head->next; head; head = head->next) for (head = head->next; head; head = head->next)
{ {
if (strcmp(head->string, last)) if (strcmp(head->string, last) == 0)
count++; local = 1;
else {
count += local;
local = 0;
}
last = head->string; last = head->string;
} }
count += local;
return count; return count;
} }

26
2025.05.23/07Ex/input/a.txt
View file

@ -1,16 +1,10 @@
a 1
b 1
d 2
e 3
c 4
c 5
c 6
6
d 6
d 6
d
d
a
a
a

5
2025.05.23/07Ex/input/c.txt Normal file
View file

@ -0,0 +1,5 @@
1
1
1
1
1

31
2025.05.23/07Ex/input/m.txt Normal file
View file

@ -0,0 +1,31 @@
1
2
3
4
5
6
6
1
7
7
1
2
6
6
6
6
3
2
4
5
5
5
5
5
1
2
3
4
5
6
7

5
2025.05.23/07Ex/input/n.txt Normal file
View file

@ -0,0 +1,5 @@
1
2
3
4
5

11
2025.05.23/07Ex/input/s.txt Normal file
View file

@ -0,0 +1,11 @@
1
2
3
4
4
4
4
4
5
6
7

17
2025.05.23/07Ex/solve.c
View file

@ -6,23 +6,20 @@
int t7_solve (node *head) int t7_solve (node *head)
{ {
char *last = head->string; char *last = head->string;
int maximum = 0, count = 1; int maximum = 0, count = 0, consist = 0;
for (head = head->next; head; head = head->next) for (head = head->next; head; head = head->next)
{ {
if (strcmp(head->string, last)) if (strcmp(head->string, last) == 0) {
count++; if (maximum < count)
else { maximum = count - 1;
if (maximum < (count-1)) consist = 1;
maximum = count-1;
count = 0; count = 0;
} } else
count += consist;
last = head->string; last = head->string;
} }
if (maximum < count)
maximum = count;
return maximum; return maximum;
} }

5
2025.05.23/dist/Krivoruchenko_SK/solve_04.c vendored
View file

@ -43,6 +43,11 @@ int t4_solve (node *head)
head = next; head = next;
} }
if (strcmp(head->string, last->string) <= 0)
if (strict)
if (maximum < count)
maximum = count;
return maximum; return maximum;
} }

12
2025.05.23/dist/Krivoruchenko_SK/solve_06.c vendored
View file

@ -6,15 +6,21 @@
int t6_solve (node *head) int t6_solve (node *head)
{ {
char *last = head->string; char *last = head->string;
int count = 1; int count = 0, local = 0;
for (head = head->next; head; head = head->next) for (head = head->next; head; head = head->next)
{ {
if (strcmp(head->string, last)) if (strcmp(head->string, last) == 0)
count++; local = 1;
else {
count += local;
local = 0;
}
last = head->string; last = head->string;
} }
count += local;
return count; return count;
} }

17
2025.05.23/dist/Krivoruchenko_SK/solve_07.c vendored
View file

@ -6,23 +6,20 @@
int t7_solve (node *head) int t7_solve (node *head)
{ {
char *last = head->string; char *last = head->string;
int maximum = 0, count = 1; int maximum = 0, count = 0, consist = 0;
for (head = head->next; head; head = head->next) for (head = head->next; head; head = head->next)
{ {
if (strcmp(head->string, last)) if (strcmp(head->string, last) == 0) {
count++; if (maximum < count)
else { maximum = count - 1;
if (maximum < (count-1)) consist = 1;
maximum = count-1;
count = 0; count = 0;
} } else
count += consist;
last = head->string; last = head->string;
} }
if (maximum < count)
maximum = count;
return maximum; return maximum;
} }