From fb20c4ffe9f84f1449b464264e974b8f7f996dcd Mon Sep 17 00:00:00 2001 From: Filip Gralinski Date: Thu, 24 Dec 2020 09:36:56 +0100 Subject: [PATCH] Fix deadlines --- TaskE00/description.txt | 4 ++-- TaskE01/description.txt | 10 +++++----- TaskE02/description.txt | 10 +++++----- TaskE03/description.txt | 10 +++++----- TaskE04/description.txt | 10 +++++----- TaskE05/description.txt | 8 ++++---- TaskE06/description.txt | 8 ++++---- TaskE07/description.txt | 8 ++++---- TaskE08/description.txt | 8 ++++---- TaskE09/description.txt | 8 ++++---- 10 files changed, 42 insertions(+), 42 deletions(-) diff --git a/TaskE00/description.txt b/TaskE00/description.txt index e1ced0f..8b885cf 100644 --- a/TaskE00/description.txt +++ b/TaskE00/description.txt @@ -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 diff --git a/TaskE01/description.txt b/TaskE01/description.txt index 0502454..a985e08 100644 --- a/TaskE01/description.txt +++ b/TaskE01/description.txt @@ -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 diff --git a/TaskE02/description.txt b/TaskE02/description.txt index 442a472..8009b70 100644 --- a/TaskE02/description.txt +++ b/TaskE02/description.txt @@ -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 diff --git a/TaskE03/description.txt b/TaskE03/description.txt index 18a0d75..d65ad1c 100644 --- a/TaskE03/description.txt +++ b/TaskE03/description.txt @@ -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 diff --git a/TaskE04/description.txt b/TaskE04/description.txt index 38aa53c..93eafb9 100644 --- a/TaskE04/description.txt +++ b/TaskE04/description.txt @@ -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 diff --git a/TaskE05/description.txt b/TaskE05/description.txt index 42f14c6..b3bb33e 100644 --- a/TaskE05/description.txt +++ b/TaskE05/description.txt @@ -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 diff --git a/TaskE06/description.txt b/TaskE06/description.txt index 0248a67..ed92a71 100644 --- a/TaskE06/description.txt +++ b/TaskE06/description.txt @@ -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 diff --git a/TaskE07/description.txt b/TaskE07/description.txt index 2324216..0342cd6 100644 --- a/TaskE07/description.txt +++ b/TaskE07/description.txt @@ -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 diff --git a/TaskE08/description.txt b/TaskE08/description.txt index ae98b10..30066d1 100644 --- a/TaskE08/description.txt +++ b/TaskE08/description.txt @@ -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 diff --git a/TaskE09/description.txt b/TaskE09/description.txt index ecd22f0..74d7473 100644 --- a/TaskE09/description.txt +++ b/TaskE09/description.txt @@ -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