s450026/djfz-2020-s450026
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Merge git.wmi.amu.edu.pl:filipg/djfz-2020

Browse Source
This commit is contained in:
s450026 2020-11-25 21:50:58 +01:00
commit 34d8bb9667
92 changed files with 300232 additions and 62 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
TaskA01/description.txt
View File

@ -3,4 +3,4 @@ Do not use regular expressions, just the simplest capabilities
of a programming language.
POINTS: 2
DEADLINE: 2020-11-08 23:59:59
DEADLINE: 2020-11-13 23:59:59

2
TaskA02/description.txt
View File

@ -5,4 +5,4 @@ Do not use regular expressions, just the simplest capabilities
of a programming language.
POINTS: 2
DEADLINE: 2020-11-08 23:59:59
DEADLINE: 2020-11-13 23:59:59

2
TaskA03/description.txt
View File

@ -4,4 +4,4 @@ Do not use regular expressions, just the simplest capabilities
of a programming language.
POINTS: 2
DEADLINE: 2020-11-08 23:59:59
DEADLINE: 2020-11-13 23:59:59

2
TaskA04/description.txt
View File

@ -4,4 +4,4 @@ Do not use regular expressions, just the simplest capabilities
of a programming language.
POINTS: 3
DEADLINE: 2020-11-08 23:59:59
DEADLINE: 2020-11-13 23:59:59

2
TaskB01/description.txt
View File

@ -2,4 +2,4 @@ Write a program to find lines containing the word "Hamlet".
Make use of regular expressions.
POINTS: 1
DEADLINE: 2020-11-22 23:59:59
DEADLINE: 2020-11-27 23:59:59

2
TaskB02/description.txt
View File

@ -4,4 +4,4 @@ Return line no matter of word "pies" casing.
Make use of regular expressions.
POINTS: 1
DEADLINE: 2020-11-22 23:59:59
DEADLINE: 2020-11-27 23:59:59

2
TaskB03/description.txt
View File

@ -3,4 +3,4 @@ Note that part ' r.' is obligatory.
Make use of regular expressions.
POINTS: 2
DEADLINE: 2020-11-22 23:59:59
DEADLINE: 2020-11-27 23:59:59

2
TaskB04/description.txt
View File

@ -3,4 +3,4 @@ Return only these substrings separated by spaces in their order.
Make use of regular expressions.
POINTS: 2
DEADLINE: 2020-11-22 23:59:59
DEADLINE: 2020-11-27 23:59:59

2
TaskC00/description.txt
View File

@ -32,5 +32,5 @@ dzieli się przez 10 z resztą 0.
Attention. The task is for students whose students id remainder of the division by 10 is 0.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 0/10

2
TaskC01/description.txt
View File

@ -31,5 +31,5 @@ dzieli się przez 10 z resztą 1.
Attention. The task is for students whose students id remainder of the division by 10 is 1.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 1/10

2
TaskC02/description.txt
View File

@ -32,5 +32,5 @@ dzieli się przez 10 z resztą 2.
Attention. The task is for students whose students id remainder of the division by 10 is 2.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 2/10

2
TaskC03/description.txt
View File

@ -33,5 +33,5 @@ dzieli się przez 10 z resztą 3.
Attention. The task is for students whose students id remainder of the division by 10 is 3.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 3/10

2
TaskC04/description.txt
View File

@ -33,5 +33,5 @@ dzieli się przez 10 z resztą 4.
Attention. The task is for students whose students id remainder of the division by 10 is 4.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 4/10

2
TaskC05/description.txt
View File

@ -34,5 +34,5 @@ dzieli się przez 10 z resztą 5.
Attention. The task is for students whose students id remainder of the division by 10 is 5.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 5/10

2
TaskC06/description.txt
View File

@ -31,5 +31,5 @@ dzieli się przez 10 z resztą 6.
Attention. The task is for students whose students id remainder of the division by 10 is 6.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 6/10

2
TaskC07/description.txt
View File

@ -31,5 +31,5 @@ dzieli się przez 10 z resztą 7.
Attention. The task is for students whose students id remainder of the division by 10 is 7.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 7/10

2
TaskC08/description.txt
View File

@ -34,5 +34,5 @@ dzieli się przez 10 z resztą 8.
Attention. The task is for students whose students id remainder of the division by 10 is 8.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 8/10

2
TaskC09/description.txt
View File

@ -32,5 +32,5 @@ dzieli się przez 10 z resztą 9.
Attention. The task is for students whose students id remainder of the division by 10 is 9.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 9/10

2
TaskC10/description.txt
View File

@ -33,5 +33,5 @@ dzieli się przez 27 z resztą 10.
Attention. The task is for students whose students id remainder of the division by 27 is 10.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 10/27

2
TaskC11/description.txt
View File

@ -36,5 +36,5 @@ dzieli się przez 27 z resztą 11.
Attention. The task is for students whose students id remainder of the division by 27 is 11.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 11/27

2
TaskC12/description.txt
View File

@ -34,5 +34,5 @@ dzieli się przez 27 z resztą 12.
Attention. The task is for students whose students id remainder of the division by 27 is 12.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 12/27

2
TaskC13/description.txt
View File

@ -38,5 +38,5 @@ dzieli się przez 27 z resztą 13.
Attention. The task is for students whose students id remainder of the division by 27 is 13.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 13/27

2
TaskC14/description.txt
View File

@ -34,5 +34,5 @@ dzieli się przez 27 z resztą 14.
Attention. The task is for students whose students id remainder of the division by 27 is 14.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 14/27

2
TaskC15/description.txt
View File

@ -36,5 +36,5 @@ dzieli się przez 27 z resztą 15.
Attention. The task is for students whose students id remainder of the division by 27 is 15.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 15/27

2
TaskC15/test.exp
View File

@ -1,7 +1,7 @@
no
yes
yes
yes
no
no
yes
no

2
TaskC16/description.txt
View File

@ -37,5 +37,5 @@ dzieli się przez 27 z resztą 16.
Attention. The task is for students whose students id remainder of the division by 27 is 16.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 16/27

2
TaskC17/description.txt
View File

@ -35,5 +35,5 @@ dzieli się przez 27 z resztą 17.
Attention. The task is for students whose students id remainder of the division by 27 is 17.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 17/27

2
TaskC18/description.txt
View File

@ -37,5 +37,5 @@ dzieli się przez 27 z resztą 18.
Attention. The task is for students whose students id remainder of the division by 27 is 18.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 18/27

2
TaskC19/description.txt
View File

@ -31,5 +31,5 @@ dzieli się przez 27 z resztą 19.
Attention. The task is for students whose students id remainder of the division by 27 is 19.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 19/27

2
TaskC20/description.txt
View File

@ -32,5 +32,5 @@ dzieli się przez 27 z resztą 20.
Attention. The task is for students whose students id remainder of the division by 27 is 20.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 20/27

2
TaskC21/description.txt
View File

@ -36,5 +36,5 @@ dzieli się przez 27 z resztą 21.
Attention. The task is for students whose students id remainder of the division by 27 is 21.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 21/27

2
TaskC22/description.txt
View File

@ -32,5 +32,5 @@ dzieli się przez 27 z resztą 22.
Attention. The task is for students whose students id remainder of the division by 27 is 22.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 22/27

2
TaskC23/description.txt
View File

@ -32,5 +32,5 @@ dzieli się przez 27 z resztą 23.
Attention. The task is for students whose students id remainder of the division by 27 is 23.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 23/27

2
TaskC24/description.txt
View File

@ -36,5 +36,5 @@ dzieli się przez 27 z resztą 24.
Attention. The task is for students whose students id remainder of the division by 27 is 24.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 24/27

2
TaskC25/description.txt
View File

@ -35,5 +35,5 @@ dzieli się przez 27 z resztą 25.
Attention. The task is for students whose students id remainder of the division by 27 is 25.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 25/27

2
TaskC26/description.txt
View File

@ -34,5 +34,5 @@ dzieli się przez 27 z resztą 26.
Attention. The task is for students whose students id remainder of the division by 27 is 26.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 26/27

2
TaskC27/description.txt
View File

@ -34,5 +34,5 @@ dzieli się przez 27 z resztą 0.
Attention. The task is for students whose students id remainder of the division by 27 is 0.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 0/27

2
TaskC27/test.exp
View File

@ -6,7 +6,7 @@ no
yes
yes
yes
yes
no
no
yes
yes

2
TaskC28/description.txt
View File

@ -34,5 +34,5 @@ dzieli się przez 27 z resztą 1.
Attention. The task is for students whose students id remainder of the division by 27 is 1.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 1/27

2
TaskC29/description.txt
View File

@ -32,5 +32,5 @@ dzieli się przez 27 z resztą 2.
Attention. The task is for students whose students id remainder of the division by 27 is 2.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 2/27

2
TaskC30/description.txt
View File

@ -32,5 +32,5 @@ dzieli się przez 27 z resztą 3.
Attention. The task is for students whose students id remainder of the division by 27 is 3.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 3/27

2
TaskC31/description.txt
View File

@ -33,5 +33,5 @@ dzieli się przez 27 z resztą 4.
Attention. The task is for students whose students id remainder of the division by 27 is 4.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 4/27

2
TaskC32/description.txt
View File

@ -34,5 +34,5 @@ dzieli się przez 27 z resztą 5.
Attention. The task is for students whose students id remainder of the division by 27 is 5.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 5/27

2
TaskC33/description.txt
View File

@ -33,5 +33,5 @@ dzieli się przez 27 z resztą 6.
Attention. The task is for students whose students id remainder of the division by 27 is 6.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 6/27

2
TaskC34/description.txt
View File

@ -34,5 +34,5 @@ dzieli się przez 27 z resztą 7.
Attention. The task is for students whose students id remainder of the division by 27 is 7.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 7/27

2
TaskC35/description.txt
View File

@ -34,5 +34,5 @@ dzieli się przez 27 z resztą 8.
Attention. The task is for students whose students id remainder of the division by 27 is 8.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 8/27

2
TaskC36/description.txt
View File

@ -30,5 +30,5 @@ dzieli się przez 27 z resztą 9.
Attention. The task is for students whose students id remainder of the division by 27 is 9.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 9/27

2
TaskC37/description.txt
View File

@ -33,5 +33,5 @@ dzieli się przez 7 z resztą 2.
Attention. The task is for students whose students id remainder of the division by 7 is 2.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 2/7

2
TaskC38/description.txt
View File

@ -36,5 +36,5 @@ dzieli się przez 7 z resztą 3.
Attention. The task is for students whose students id remainder of the division by 7 is 3.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 3/7

2
TaskC39/description.txt
View File

@ -32,5 +32,5 @@ dzieli się przez 7 z resztą 4.
Attention. The task is for students whose students id remainder of the division by 7 is 4.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 4/7

2
TaskC40/description.txt
View File

@ -35,5 +35,5 @@ dzieli się przez 7 z resztą 5.
Attention. The task is for students whose students id remainder of the division by 7 is 5.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 5/7

2
TaskC40/test.exp
View File

@ -11,7 +11,7 @@ yes
no
yes
yes
yes
no
yes
yes
yes

2
TaskC41/description.txt
View File

@ -32,5 +32,5 @@ dzieli się przez 7 z resztą 6.
Attention. The task is for students whose students id remainder of the division by 7 is 6.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 6/7

2
TaskC42/description.txt
View File

@ -35,5 +35,5 @@ dzieli się przez 7 z resztą 0.
Attention. The task is for students whose students id remainder of the division by 7 is 0.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 0/7

2
TaskC43/description.txt
View File

@ -40,5 +40,5 @@ dzieli się przez 7 z resztą 1.
Attention. The task is for students whose students id remainder of the division by 7 is 1.
POINTS: 2
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 1/7

2
TaskC44/description.txt
View File

@ -38,5 +38,5 @@ dzieli się przez 5 z resztą 4.
Attention. The task is for students whose students id remainder of the division by 5 is 4.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 4/5

2
TaskC45/description.txt
View File

@ -37,5 +37,5 @@ dzieli się przez 5 z resztą 0.
Attention. The task is for students whose students id remainder of the division by 5 is 0.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 0/5

2
TaskC46/description.txt
View File

@ -39,5 +39,5 @@ dzieli się przez 5 z resztą 1.
Attention. The task is for students whose students id remainder of the division by 5 is 1.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 1/5

2
TaskC47/description.txt
View File

@ -34,5 +34,5 @@ dzieli się przez 5 z resztą 2.
Attention. The task is for students whose students id remainder of the division by 5 is 2.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 2/5

2
TaskC48/description.txt
View File

@ -36,5 +36,5 @@ dzieli się przez 5 z resztą 3.
Attention. The task is for students whose students id remainder of the division by 5 is 3.
POINTS: 3
DEADLINE: 2020-11-22 23:59
DEADLINE: 2020-11-27 23:59
REMAINDER: 3/5

21
TaskD00/description.txt Normal file
View File

@ -0,0 +1,21 @@
Napisać program, który wczytuje kolejne wiersze ze standardowego
wejścia i analizuje każdy wiersz (bez znaku końca wiersza). Należy w
jak największym stopniu wykorzystać wyrażenia regularne (np. nie wolno
użyć negacji jako operacji w danym języku programowania, jeśli da się
to wyrazić w samym wyrażeniu regularnym). Tam, gdzie to możliwe należy
użyć pojedynczego wyrażenia regularnego.
Write a program, which loads consecutive lines from standard input
and analyze every line (with no newline character). You should
use regular expressions to the greatest extent possible (e.g. you
can not use negation in the programming language if it is
possible to express the same in regular expression). Wherever possible,
use one regular expression.
Write a program to substitute all 4-digits string to 4-characters string.
In the substituted string "0" should change to "a", "1" should change to "b", "2" should change to "c", etc.
E.g. "1162" should change to "bbgc".
In this task digit means [0-9] class.
POINTS: 2
DEADLINE: 2020-12-06 23:59:59

50000
TaskD00/polish_wiki_excerpt.exp Normal file
View File

File diff suppressed because one or more lines are too long

1
TaskD00/polish_wiki_excerpt.in Symbolic link
View File

@ -0,0 +1 @@
../TaskA02/polish_wiki_excerpt.in

3
TaskD00/simple.exp Normal file
View File

@ -0,0 +1,3 @@
dece 34 dfd gfd 5
f33sdfsdbcdedsfsdf
3r

3
TaskD00/simple.in Normal file
View File

@ -0,0 +1,3 @@
3424 34 dfd gfd 5
f33sdfsd1234dsfsdf
3r

22
TaskD01/description.txt Normal file
View File

@ -0,0 +1,22 @@
Napisać program, który wczytuje kolejne wiersze ze standardowego
wejścia i analizuje każdy wiersz (bez znaku końca wiersza). Należy w
jak największym stopniu wykorzystać wyrażenia regularne (np. nie wolno
użyć negacji jako operacji w danym języku programowania, jeśli da się
to wyrazić w samym wyrażeniu regularnym). Tam, gdzie to możliwe należy
użyć pojedynczego wyrażenia regularnego.
Write a program, which loads consecutive lines from standard input
and analyze every line (with no newline character). You should
use regular expressions to the greatest extent possible (e.g. you
can not use negation in the programming language if it is
possible to express the same in regular expression). Wherever possible,
use one regular expression.
For each word with at least one lower case letter and one capital letter
change every lower case letter to capital case and change every capital case
letter to lower. In this task word means the string of "\w" metacharacters,
lower case letter is [a-ząćęłńóśźż] class,
capital case letter is [A-ZĄĆĘŁŃÓŚŹŻ] class.
POINTS: 2
DEADLINE: 2020-12-06 23:59:59

50000
TaskD01/polish_wiki_excerpt.exp Normal file
View File

File diff suppressed because one or more lines are too long

1
TaskD01/polish_wiki_excerpt.in Symbolic link
View File

@ -0,0 +1 @@
../TaskA02/polish_wiki_excerpt.in

3
TaskD01/simple.exp Normal file
View File

@ -0,0 +1,3 @@
ala mA KOTa
lallaa
żUK

3
TaskD01/simple.in Normal file
View File

@ -0,0 +1,3 @@
ala Ma kotA
lallaa
Żuk

23
TaskD02/description.txt Normal file
View File

@ -0,0 +1,23 @@
Napisać program, który wczytuje kolejne wiersze ze standardowego
wejścia i analizuje każdy wiersz (bez znaku końca wiersza). Należy w
jak największym stopniu wykorzystać wyrażenia regularne (np. nie wolno
użyć negacji jako operacji w danym języku programowania, jeśli da się
to wyrazić w samym wyrażeniu regularnym). Tam, gdzie to możliwe należy
użyć pojedynczego wyrażenia regularnego.
Write a program, which loads consecutive lines from standard input
and analyze every line (with no newline character). You should
use regular expressions to the greatest extent possible (e.g. you
can not use negation in the programming language if it is
possible to express the same in regular expression). Wherever possible,
use one regular expression.
For each line write 4 digits separated by space "A B C D", where
A stands for all lower case letters, B stands for
all capital case letters, C stand for digit,
D stands for all remaining characters excluding newline.
In this task, lower case letter is [a-ząćęłńóśźż] class,
capital case letter is [A-ZĄĆĘŁŃÓŚŹŻ] class.
POINTS: 1
DEADLINE: 2020-12-06 23:59:59

50000
TaskD02/polish_wiki_excerpt.exp Normal file
View File

File diff suppressed because it is too large Load Diff

1
TaskD02/polish_wiki_excerpt.in Symbolic link
View File

@ -0,0 +1 @@
../TaskA02/polish_wiki_excerpt.in

3
TaskD02/simple.exp Normal file
View File

@ -0,0 +1,3 @@
7 2 0 2
6 0 0 0
6 1 1 2

3
TaskD02/simple.in Normal file
View File

@ -0,0 +1,3 @@
ala Ma kotA
lallaa
Mam 2 żuki

24
TaskD03/description.txt Normal file
View File

@ -0,0 +1,24 @@
Napisać program, który wczytuje kolejne wiersze ze standardowego
wejścia i analizuje każdy wiersz (bez znaku końca wiersza). Należy w
jak największym stopniu wykorzystać wyrażenia regularne (np. nie wolno
użyć negacji jako operacji w danym języku programowania, jeśli da się
to wyrazić w samym wyrażeniu regularnym). Tam, gdzie to możliwe należy
użyć pojedynczego wyrażenia regularnego.
Write a program, which loads consecutive lines from standard input
and analyze every line (with no newline character). You should
use regular expressions to the greatest extent possible (e.g. you
can not use negation in the programming language if it is
possible to express the same in regular expression). Wherever possible,
use one regular expression.
For each line write 2 digits separated by space "A B", where
A stands for all words starting with lower case letter,
B stands for all words starting with capital case letter,
In this task word means a string of "\w" metacharacters,
lower case letter is [a-ząćęłńóśźż] class,
capital case letter is [A-ZĄĆĘŁŃÓŚŹŻ] class capital case letter is [A-ZĄĆĘŁŃÓŚŹŻ] class.
POINTS: 1
DEADLINE: 2020-12-06 23:59:59

50000
TaskD03/polish_wiki_excerpt.exp Normal file
View File

File diff suppressed because it is too large Load Diff

1
TaskD03/polish_wiki_excerpt.in Symbolic link
View File

@ -0,0 +1 @@
../TaskA02/polish_wiki_excerpt.in

2
TaskD03/simple.exp Normal file
View File

@ -0,0 +1,2 @@
2 1
1 0

2
TaskD03/simple.in Normal file
View File

@ -0,0 +1,2 @@
Żmija i żuk.
3daniowy obiad

20
TaskD04/description.txt Normal file
View File

@ -0,0 +1,20 @@
Napisać program, który wczytuje kolejne wiersze ze standardowego
wejścia i analizuje każdy wiersz (bez znaku końca wiersza). Należy w
jak największym stopniu wykorzystać wyrażenia regularne (np. nie wolno
użyć negacji jako operacji w danym języku programowania, jeśli da się
to wyrazić w samym wyrażeniu regularnym). Tam, gdzie to możliwe należy
użyć pojedynczego wyrażenia regularnego.
Write a program, which loads consecutive lines from standard input
and analyze every line (with no newline character). You should
use regular expressions to the greatest extent possible (e.g. you
can not use negation in the programming language if it is
possible to express the same in regular expression). Wherever possible,
use one regular expression.
Write the input line with the second digits string deleted.
Digit is a [0-9] class.
POINTS: 1
DEADLINE: 2020-12-06 23:59:59

50000
TaskD04/polish_wiki_excerpt.exp Normal file
View File

File diff suppressed because one or more lines are too long

1
TaskD04/polish_wiki_excerpt.in Symbolic link
View File

@ -0,0 +1 @@
../TaskA02/polish_wiki_excerpt.in

3
TaskD04/simple.exp Normal file
View File

@ -0,0 +1,3 @@
Mam 2 jabłka i banananów.
Mam 2 jabłka i banananów oraz 20 gruszek.
Widziałem 2 bociany.

3
TaskD04/simple.in Normal file
View File

@ -0,0 +1,3 @@
Mam 2 jabłka i 35 banananów.
Mam 2 jabłka i 35 banananów oraz 20 gruszek.
Widziałem 2 bociany.

22
TaskD05/description.txt Normal file
View File

@ -0,0 +1,22 @@
Napisać program, który wczytuje kolejne wiersze ze standardowego
wejścia i analizuje każdy wiersz (bez znaku końca wiersza). Należy w
jak największym stopniu wykorzystać wyrażenia regularne (np. nie wolno
użyć negacji jako operacji w danym języku programowania, jeśli da się
to wyrazić w samym wyrażeniu regularnym). Tam, gdzie to możliwe należy
użyć pojedynczego wyrażenia regularnego.
Write a program, which loads consecutive lines from standard input
and analyze every line (with no newline character). You should
use regular expressions to the greatest extent possible (e.g. you
can not use negation in the programming language if it is
possible to express the same in regular expression). Wherever possible,
use one regular expression.
Write the input line with the third word changed to "xxx" string.
The number of "x" in the "xxx" string should be the same as the
the number of characters in the input string.
In this task, a word means a string of "\w" metacharacters.
POINTS: 2
DEADLINE: 2020-12-06 23:59:59

50000
TaskD05/polish_wiki_excerpt.exp Normal file
View File

File diff suppressed because one or more lines are too long

1
TaskD05/polish_wiki_excerpt.in Symbolic link
View File

@ -0,0 +1 @@
../TaskA02/polish_wiki_excerpt.in

2
TaskD05/simple.exp Normal file
View File

@ -0,0 +1,2 @@
Mam 2 xxxxxx i 35 banananów.
Widziałem 2 xxxxxxx.

2
TaskD05/simple.in Normal file
View File

@ -0,0 +1,2 @@
Mam 2 jabłka i 35 banananów.
Widziałem 2 bociany.

2
blend.sh
View File

@ -19,7 +19,7 @@ cp "${PREFIX}/count-points.pl" arena/
cp "${PREFIX}/overrides.txt" arena/
cp "${PREFIX}/Makefile" arena/
for TX in X01 X02 X03 A01 B01 B02 B03 B04 # X04 X05 X06 X07 X08 B00 B01 B02 B03 B04 B05 B06 C00 C01 C02 C03 C04 C05 C06 E01 E02 E03 E04 E05 E06 E07 # X05 X06 X07 X08 X09 X10 B03 B04 X10
for TX in X01 X02 X03 A01 B01 B02 B03 B04 D00 D01 D02 D03 D04 D05 # X04 X05 X06 X07 X08 B00 B01 B02 B03 B04 B05 B06 C00 C01 C02 C03 C04 C05 C06 E01 E02 E03 E04 E05 E06 E07 # X05 X06 X07 X08 X09 X10 B03 B04 X10
do
mkdir -p arena/Task$TX
done

2
count-points.pl
View File

@ -52,7 +52,7 @@ sub update_total {
my $section = get_section($report_file_path);
if (defined $section && $section ne 'A') {
if (defined $section && ($section ne 'A' && $section ne 'B' && $section ne 'C' && $section ne 'D' )) {
if ($section_points{$section} > 0) {
print "UWAGA: TYLKO ZADANIE Z NAJWIĘKSZĄ LICZBĄ PUNKTÓW BĘDZIE LICZONE DLA DZIAŁU $section\n";
}