forked from filipg/djfz-2019
Task for English classes
This commit is contained in:
parent
e71154b2e7
commit
5d04d167df
18
TaskE01/description.txt
Normal file
18
TaskE01/description.txt
Normal file
@ -0,0 +1,18 @@
|
||||
An upper-case letter and two digits
|
||||
===================================
|
||||
|
||||
Note: this task is only for students of "Formal languages and
|
||||
complexity theory" taught in English.
|
||||
|
||||
[Your program should read lines from the standard input and check each
|
||||
line separately (without end-of-line character). Please use regular
|
||||
expressions as much as possible (in particular, try not to use
|
||||
logical operators outside the regeular expression). If it is
|
||||
possible, use just one regular expression.]
|
||||
|
||||
For each string from the standard input, check whether if contains a
|
||||
substring composed of an upper-case letter and 2 digits. Write "true"/"false"
|
||||
on the standard output accordingly.
|
||||
|
||||
POINTS: 2
|
||||
DEADLINE: 2019-11-21 17:00
|
9
TaskE01/test.exp
Normal file
9
TaskE01/test.exp
Normal file
@ -0,0 +1,9 @@
|
||||
true
|
||||
false
|
||||
false
|
||||
true
|
||||
false
|
||||
false
|
||||
false
|
||||
true
|
||||
true
|
9
TaskE01/test.in
Normal file
9
TaskE01/test.in
Normal file
@ -0,0 +1,9 @@
|
||||
G3923d
|
||||
G9
|
||||
Ha3a5
|
||||
Z00
|
||||
Z0x0
|
||||
az33a
|
||||
dsdg34
|
||||
hahaA39dsdsd
|
||||
sssssssssssU23
|
18
TaskE02/description.txt
Normal file
18
TaskE02/description.txt
Normal file
@ -0,0 +1,18 @@
|
||||
No 555
|
||||
======
|
||||
|
||||
Note: this task is only for students of "Formal languages and
|
||||
complexity theory" taught in English.
|
||||
|
||||
[Your program should read lines from the standard input and check each
|
||||
line separately (without end-of-line character). Please use regular
|
||||
expressions as much as possible (in particular, try not to use
|
||||
logical operators outside the regeular expression). If it is
|
||||
possible, use just one regular expression.]
|
||||
|
||||
For each string from the standard input, check whether it is a 9-digit
|
||||
phone number (format "NNN-NNN-NNN" or "NNN NNN NNN"), not beginning
|
||||
with "555". Write "true"/"false" on the standard output accordingly.
|
||||
|
||||
POINTS: 3
|
||||
DEADLINE: 2019-11-21 17:00
|
7
TaskE02/test.exp
Normal file
7
TaskE02/test.exp
Normal file
@ -0,0 +1,7 @@
|
||||
true
|
||||
true
|
||||
true
|
||||
false
|
||||
true
|
||||
false
|
||||
false
|
7
TaskE02/test.in
Normal file
7
TaskE02/test.in
Normal file
@ -0,0 +1,7 @@
|
||||
055-555-555
|
||||
505-324-555
|
||||
551-233-455
|
||||
555-123-456
|
||||
556 345 667
|
||||
556 345 6675
|
||||
556 345-667
|
18
TaskE03/description.txt
Normal file
18
TaskE03/description.txt
Normal file
@ -0,0 +1,18 @@
|
||||
One vowel
|
||||
=========
|
||||
|
||||
Note: this task is only for students of "Formal languages and
|
||||
complexity theory" taught in English.
|
||||
|
||||
[Your program should read lines from the standard input and check each
|
||||
line separately (without end-of-line character). Please use regular
|
||||
expressions as much as possible (in particular, try not to use
|
||||
logical operators outside the regeular expression). If it is
|
||||
possible, use just one regular expression.]
|
||||
|
||||
For each string from the standard input, check whether it is a single
|
||||
word with exactly one vowel (consider only Latin alphabet). Write
|
||||
"true"/"false" on the standard output accordingly.
|
||||
|
||||
POINTS: 2
|
||||
DEADLINE: 2019-11-21 17:00
|
9
TaskE03/test.exp
Normal file
9
TaskE03/test.exp
Normal file
@ -0,0 +1,9 @@
|
||||
false
|
||||
false
|
||||
true
|
||||
false
|
||||
false
|
||||
false
|
||||
true
|
||||
false
|
||||
true
|
9
TaskE03/test.in
Normal file
9
TaskE03/test.in
Normal file
@ -0,0 +1,9 @@
|
||||
223
|
||||
aa
|
||||
dom
|
||||
html
|
||||
ostrach
|
||||
puko
|
||||
strach
|
||||
strachy
|
||||
u
|
19
TaskE04/description.txt
Normal file
19
TaskE04/description.txt
Normal file
@ -0,0 +1,19 @@
|
||||
Minutes
|
||||
=======
|
||||
|
||||
Note: this task is only for students of "Formal languages and
|
||||
complexity theory" taught in English.
|
||||
|
||||
[Your program should read lines from the standard input and check each
|
||||
line separately (without end-of-line character). Please use regular
|
||||
expressions as much as possible (in particular, try not to use
|
||||
logical operators outside the regeular expression). If it is
|
||||
possible, use just one regular expression.]
|
||||
|
||||
For each string from the standard input, extract minutes from a string
|
||||
representing an hour ("9:13", "18:44", etc.) and write it on the
|
||||
standard output. If the input string is not an hour, write "<NONE>" on
|
||||
the standard output.
|
||||
|
||||
POINTS: 3
|
||||
DEADLINE: 2019-11-21 17:00
|
7
TaskE04/test.exp
Normal file
7
TaskE04/test.exp
Normal file
@ -0,0 +1,7 @@
|
||||
00
|
||||
44
|
||||
59
|
||||
<NONE>
|
||||
13
|
||||
<NONE>
|
||||
<NONE>
|
7
TaskE04/test.in
Normal file
7
TaskE04/test.in
Normal file
@ -0,0 +1,7 @@
|
||||
0:00
|
||||
18:44
|
||||
23:59
|
||||
25:14
|
||||
9:13
|
||||
9:61
|
||||
x9:13y
|
2
blend.sh
2
blend.sh
@ -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 X04 B00 B01 B02 # X05 X06 X07 X08 X09 X10 B03 B04 X10
|
||||
for TX in X01 X02 X03 X04 B00 B01 B02 E01 E02 E03 E04 # X05 X06 X07 X08 X09 X10 B03 B04 X10
|
||||
do
|
||||
mkdir -p arena/Task$TX
|
||||
done
|
||||
|
Loading…
Reference in New Issue
Block a user