Merge branch 'master' of https://git.wmi.amu.edu.pl/filipg/djfz-2020

TaskE00/description.txt

@@ -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

TaskE00/test1.arg

@@ -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

TaskE00/test1.exp

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

TaskE00/test1.in

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

TaskE01/description.txt

@@ -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  

TaskE01/shakespeare.in

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

TaskE02/description.txt

@@ -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  

TaskE02/shakespeare.in

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

TaskE03/description.txt

@@ -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  

TaskE03/shakespeare.in

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

TaskE04/description.txt

@@ -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  

TaskE04/shakespeare.in

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

TaskE05/description.txt

@@ -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

TaskE05/polish_wiki_excerpt.in

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

TaskE06/description.txt

@@ -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  

TaskE06/test.exp

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

TaskE06/test.in

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

TaskE07/description.txt

@@ -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  

TaskE07/test.exp

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

TaskE07/test.in

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

TaskE08/description.txt

@@ -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  

TaskE08/test.exp

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

TaskE08/test.in

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

TaskE09/description.txt

@@ -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  

TaskE09/test.exp

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

TaskE09/test.in

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

blend.sh

@@ -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 E01 E02 E03 E04 E05 E06 E07 E08 E09 # 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

count-points.pl

@@ -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);
 

overrides.txt

@@ -0,0 +1,10 @@
+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
+444379 C40 2 http://filipg-jenkins.wmi.amu.edu.pl:8090/view/DJFZ-2020/job/djfz-2020-s444379/15/console
+444428 C40 2  http://filipg-jenkins.wmi.amu.edu.pl:8090/job/djfz-2020-s444428/8/console
+442778 A01 2 http://filipg-jenkins.wmi.amu.edu.pl:8090/job/djfz-2020-s442778/6/console
+444486 D02 1 http://filipg-jenkins.wmi.amu.edu.pl:8090/view/DJFZ-2020/job/djfz-2020-s444486/6/console