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

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

This commit is contained in:
Adam 2020-12-06 18:38:52 +01:00
parent 08f802f8a9 b7df139dd7
commit a3ff17b549
92 changed files with 728124 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. changed
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
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
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

11
TaskE00/description.txt Normal file
View File

@ -0,0 +1,11 @@
Read a description of a deterministic finite-state automaton in the AT&T format
(without weights) from the file in the first argument.
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
The program is invoked like this: ./run test1.arg < test1.in > test1.out
POINTS: 3
DEADLINE: 2020-12-20 23:59:59

16
TaskE00/test1.arg Normal file
View File

@ -0,0 +1,16 @@
0 1 x
1 2 y
2 3 z
0 4 y
0 4 z
1 4 x
1 4 z
2 4 x
2 4 y
3 4 x
3 4 y
3 4 z
4 4 x
4 4 y
4 4 z
3

9
TaskE00/test1.exp Normal file
View File

@ -0,0 +1,9 @@
NO
YES
NO
NO
NO
NO
NO
NO
NO

9
TaskE00/test1.in Normal file
View File

@ -0,0 +1,9 @@
xxyz
xyz
xy
zz
xxy
yzx
x
xyzz

14
TaskE01/description.txt Normal file
View File

@ -0,0 +1,14 @@
Use a deterministic finite-state automaton (FSA) engine from the previous task.
Create your own FSA description to check whether the word "Hamlet" is in the given line.
Don't use external files like in TaskE00 (description should be included in run file).
You may restrict the FSA alphabet to characters included in the word "Hamlet" plus "x" and
change all characters different from characters in word "Hamlet" to "x".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
POINTS: 2
DEADLINE: 2020-12-20 23:59:59
REMAINDER: 0/4

169442
TaskE01/shakespeare.exp Normal file
View File

File diff suppressed because it is too large Load Diff

1
TaskE01/shakespeare.in Symbolic link
View File

@ -0,0 +1 @@
../TaskA01/shakespeare.in

14
TaskE02/description.txt Normal file
View File

@ -0,0 +1,14 @@
Use a deterministic finite-state automaton (FSA) engine from the previous task.
Create your own FSA description to check whether the word "Ophelia" is in the given line.
Don't use external files like in TaskE00 (description should be included in run file).
You may restrict the FSA alphabet to characters included in the word "Ophelia" plus "x" and
change all characters different from characters in word "Ophelia" to "x".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
POINTS: 2
DEADLINE: 2020-12-20 23:59:59
REMAINDER: 1/4

169442
TaskE02/shakespeare.exp Normal file
View File

File diff suppressed because it is too large Load Diff

1
TaskE02/shakespeare.in Symbolic link
View File

@ -0,0 +1 @@
../TaskA01/shakespeare.in

14
TaskE03/description.txt Normal file
View File

@ -0,0 +1,14 @@
Use a deterministic finite-state automaton (FSA) engine from the previous task.
Create your own FSA description to check whether the word "Juliet" is in the given line.
Don't use external files like in TaskE00 (description should be included in run file).
You may restrict the FSA alphabet to characters included in the word "Juliet" plus "x" and
change all characters different from characters in word "Juliet" to "x".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
POINTS: 2
DEADLINE: 2020-12-20 23:59:59
REMAINDER: 2/4

169442
TaskE03/shakespeare.exp Normal file
View File

File diff suppressed because it is too large Load Diff

1
TaskE03/shakespeare.in Symbolic link
View File

@ -0,0 +1 @@
../TaskA01/shakespeare.in

14
TaskE04/description.txt Normal file
View File

@ -0,0 +1,14 @@
Use a deterministic finite-state automaton (FSA) engine from the previous task.
Create your own FSA description to check whether the word "Macbeth" is in the given line.
Don't use external files like in TaskE00 (description should be included in run file).
You may restrict the FSA alphabet to characters included in the word "Macbeth" plus "x" and
change all characters different from characters in word "Macbeth" to "x".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
POINTS: 2
DEADLINE: 2020-12-20 23:59:59
REMAINDER: 3/4

169442
TaskE04/shakespeare.exp Normal file
View File

File diff suppressed because it is too large Load Diff

1
TaskE04/shakespeare.in Symbolic link
View File

@ -0,0 +1 @@
../TaskA01/shakespeare.in

14
TaskE05/description.txt Normal file
View File

@ -0,0 +1,14 @@
Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
Create your own FSA description to check whether the line contains
date from 1900 to 1999 in format '19XX r.'
Don't use external files like in TaskE00 (description should be included in run file).
You may restrict the FSA alphabet to all possible characters included in the word "19XX r." plus "x" and
change all irrelevant characters in line to 'x'.
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
POINTS: 2
DEADLINE: 2020-12-20 23:59:59

50000
TaskE05/polish_wiki_excerpt.exp Normal file
View File

File diff suppressed because it is too large Load Diff

1
TaskE05/polish_wiki_excerpt.in Symbolic link
View File

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

13
TaskE06/description.txt Normal file
View File

@ -0,0 +1,13 @@
Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
Create your own FSA description to check whether the string starts with "01" and ends with "01.
Don't use external files like in TaskE00 (description should be included in run file).
The alphabet is "0", "1".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
POINTS: 3
DEADLINE: 2020-12-20 23:59:59
REMAINDER: 1/4

14
TaskE06/test.exp Normal file
View File

@ -0,0 +1,14 @@
YES
NO
YES
NO
YES
NO
NO
YES
NO
NO
NO
NO
NO
NO

14
TaskE06/test.in Normal file
View File

@ -0,0 +1,14 @@
01
10
0101
1010
011101
101010
100010
0100001
00110
0000
10101
0
1

13
TaskE07/description.txt Normal file
View File

@ -0,0 +1,13 @@
Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
Create your own FSA description to check whether the string starts with "10" and ends with "10.
Don't use external files like in TaskE00 (description should be included in run file).
The alphabet is "0", "1".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
POINTS: 3
DEADLINE: 2020-12-20 23:59:59
REMAINDER: 2/4

14
TaskE07/test.exp Normal file
View File

@ -0,0 +1,14 @@
NO
YES
NO
YES
NO
YES
YES
NO
NO
NO
NO
NO
NO
NO

14
TaskE07/test.in Normal file
View File

@ -0,0 +1,14 @@
01
10
0101
1010
011101
101010
100010
0100001
00110
0000
10101
0
1

14
TaskE08/description.txt Normal file
View File

@ -0,0 +1,14 @@
Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
Create your own FSA description to check whether the string contains "0"
even number of times.
Don't use external files like in TaskE00 (description should be included in run file).
The alphabet is "0", "1".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
POINTS: 3
DEADLINE: 2020-12-20 23:59:59
REMAINDER: 3/4

14
TaskE08/test.exp Normal file
View File

@ -0,0 +1,14 @@
NO
NO
YES
YES
YES
NO
YES
NO
YES
NO
YES
YES
NO
YES

14
TaskE08/test.in Normal file
View File

@ -0,0 +1,14 @@
01
10
0101
1010
011101
101010
100010
0100001
00110
0000
10101
0
1

14
TaskE09/description.txt Normal file
View File

@ -0,0 +1,14 @@
Use a deterministic finite-state automaton (FSA) engine from the TaskE00.
Create your own FSA description to check whether the string contains "0"
odd number of times.
Don't use external files like in TaskE00 (description should be included in run file).
The alphabet is "0", "1".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
POINTS: 3
DEADLINE: 2020-12-20 23:59:59
REMAINDER: 0/4

14
TaskE09/test.exp Normal file
View File

@ -0,0 +1,14 @@
YES
YES
NO
NO
NO
YES
NO
YES
NO
YES
NO
NO
YES
NO

14
TaskE09/test.in Normal file
View File

@ -0,0 +1,14 @@
01
10
0101
1010
011101
101010
100010
0100001
00110
0000
10101
0
1

6
blend.sh
View File

@ -4,7 +4,9 @@ PREFIX=djfz-2020
cd ..
STUDENT_DIR=`ls -d ${PREFIX}-s??????`
shopt -s extglob
STUDENT_DIR=`ls -d ${PREFIX}-s+([0-9])`
echo "USING $STUDENT_DIR"
@ -19,7 +21,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 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
for TX in X01 X02 X03 A01 B01 B02 B03 B04 D00 D01 D02 D03 D04 D05 E00 # 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

4
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' && $section ne 'B' && $section ne 'C' && $section ne 'D' )) {
if (defined $section && ($section ne 'A' && $section ne 'B' && $section ne 'C' && $section ne 'D' && $section ne 'E')) {
if ($section_points{$section} > 0) {
print "UWAGA: TYLKO ZADANIE Z NAJWIĘKSZĄ LICZBĄ PUNKTÓW BĘDZIE LICZONE DLA DZIAŁU $section\n";
}
@ -168,7 +168,7 @@ sub check_if_the_right_task {
}
}
return 0 if $task_id =~ m{^TaskE} and not is_estudent($student_id);
# return 0 if $task_id =~ m{^TaskE} and not is_estudent($student_id);
return 0 if $task_id =~ m{^Task[AC]} and is_estudent($student_id);

6
overrides.txt
View File

@ -0,0 +1,6 @@
153253 A01 2 http://filipg-jenkins.wmi.amu.edu.pl:8090/job/djfz-2020-s153253/15/console
444469 A01 2 http://filipg-jenkins.wmi.amu.edu.pl:8090/job/djfz-2020-s444469/5/console
444469 A02 2 http://filipg-jenkins.wmi.amu.edu.pl:8090/job/djfz-2020-s444469/5/console
444469 A03 2 http://filipg-jenkins.wmi.amu.edu.pl:8090/job/djfz-2020-s444469/5/console
444469 X03 1 http://filipg-jenkins.wmi.amu.edu.pl:8090/job/djfz-2020-s444469/5/console
444523 B01 1 TS