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

Fix deadlines

Browse Source
This commit is contained in:
Filip Gralinski 2020-12-24 09:36:56 +01:00
parent e8ca40d29e
commit fb20c4ffe9
10 changed files with 42 additions and 42 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
TaskE00/description.txt
View File

@ -1,4 +1,4 @@
Read a description of a deterministic finite-state automaton in the AT&T format
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.
@ -8,4 +8,4 @@ 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
DEADLINE: 2020-12-23 15:30:00

10
TaskE01/description.txt
View File

@ -2,13 +2,13 @@ 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
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.
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
DEADLINE: 2020-12-24 15:30:00
REMAINDER: 0/4

10
TaskE02/description.txt
View File

@ -2,13 +2,13 @@ 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
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.
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
DEADLINE: 2020-12-24 15:30:00
REMAINDER: 1/4

10
TaskE03/description.txt
View File

@ -2,13 +2,13 @@ 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
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.
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
DEADLINE: 2020-12-24 15:30:00
REMAINDER: 2/4

10
TaskE04/description.txt
View File

@ -2,13 +2,13 @@ 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
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.
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
DEADLINE: 2020-12-24 15:30:00
REMAINDER: 3/4

8
TaskE05/description.txt
View File

@ -3,12 +3,12 @@ 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
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.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
POINTS: 2
DEADLINE: 2020-12-20 23:59:59
DEADLINE: 2020-12-24 15:30:00

8
TaskE06/description.txt
View File

@ -5,9 +5,9 @@ Don't use external files like in TaskE00 (description should be included in run
The alphabet is "0", "1".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
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
DEADLINE: 2020-12-24 15:30:00
REMAINDER: 1/4

8
TaskE07/description.txt
View File

@ -5,9 +5,9 @@ Don't use external files like in TaskE00 (description should be included in run
The alphabet is "0", "1".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
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
DEADLINE: 2020-12-24 15:30:00
REMAINDER: 2/4

8
TaskE08/description.txt
View File

@ -6,9 +6,9 @@ Don't use external files like in TaskE00 (description should be included in run
The alphabet is "0", "1".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
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
DEADLINE: 2020-12-24 15:30:00
REMAINDER: 3/4

8
TaskE09/description.txt
View File

@ -6,9 +6,9 @@ Don't use external files like in TaskE00 (description should be included in run
The alphabet is "0", "1".
Read strings from the standard input.
If a string is accepted by the
automaton, write YES, otherwise- write NO.
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
DEADLINE: 2020-12-24 15:30:00
REMAINDER: 0/4