s426197/djfz-2019-s426197
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

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

Browse Source
This commit is contained in:
Eryk Miszczuk 2019-12-13 14:14:09 +01:00
commit dcce6dfb9d
9 changed files with 24 additions and 18 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

4
TaskA49/description.txt
View File

@ -7,7 +7,9 @@ http://poleval2020.nlp.ipipan.waw.pl/challenge/poleval-diachronic-morpho
Also, apart from submitting a solution you're expected to report any Also, apart from submitting a solution you're expected to report any
problems with the web site (including incorrect English, unclear problems with the web site (including incorrect English, unclear
instructions, software errors). instructions, software errors). Please add issues at
https://git.wmi.amu.edu.pl/filipg/gonito with label "poleval".
(first check whether you're the first to submit a problem).
For an account there, please contact Filip Graliński, but do it only For an account there, please contact Filip Graliński, but do it only
when you're sure you'll take part in it — the dataset and instructions when you're sure you'll take part in it — the dataset and instructions

2
TaskB00/description.txt
View File

@ -18,5 +18,5 @@ NOTE: Task only for students whose student index number ("numer
indeksu") is divisable by 3. indeksu") is divisable by 3.
POINTS: 8 POINTS: 8
DEADLINE: 2019-12-09 18:45 DEADLINE: 2019-12-12 18:45
REMAINDER: 0/3 REMAINDER: 0/3

6
TaskB01/description.txt
View File

@ -4,8 +4,8 @@ Deterministic automaton II
Read a description of a finite-state automaton in the AT&T format Read a description of a finite-state automaton in the AT&T format
(without weights) from the standard input. Then, read strings from the (without weights) from the standard input. Then, read strings from the
file whose name was given as the first argument. If a string is file whose name was given as the first argument. If a string is
accepted by the automated, write YES, a space and the string on the accepted by the automated, write TRUE, a space and the string on the
standard output, otherwise — write NO, a space and the string. standard output, otherwise — write FALSE, a space and the string.
If there is a non-determinism in the automaton, the first transition should be chosen. If there is a non-determinism in the automaton, the first transition should be chosen.
@ -16,5 +16,5 @@ NOTE: Task only for students whose student index number ("numer
indeksu") is divisable by 3 with a remainder of 1 indeksu") is divisable by 3 with a remainder of 1
POINTS: 8 POINTS: 8
DEADLINE: 2019-12-09 18:45 DEADLINE: 2019-12-12 18:45
REMAINDER: 1/3 REMAINDER: 1/3

2
TaskB02/description.txt
View File

@ -24,5 +24,5 @@ NOTE: Task only for students whose student index number ("numer
indeksu") is divisable by 3 with a remainder of 2 indeksu") is divisable by 3 with a remainder of 2
POINTS: 8 POINTS: 8
DEADLINE: 2019-12-09 18:45 DEADLINE: 2019-12-12 18:45
REMAINDER: 2/3 REMAINDER: 2/3

7
TaskB04/description.txt
View File

@ -7,8 +7,9 @@ cycles. The automaton alphabet is the set of Polish lower-case letters
(English letters plus: ą, ć, ę, ł, ń, ó, ś, ź and ż). (English letters plus: ą, ć, ę, ł, ń, ó, ś, ź and ż).
Your program should print, on standard output, all the paths of the Your program should print, on standard output, all the paths of the
automaton in alphabetical order. "Print a path" means print a text automaton in alphabetical order (to be precise: order induced by byte
line containing all subsequent characters. codes of strings, not according to the standard Polish order). "Print
a path" means print a text line containing all subsequent characters.
The program does not have to check whether the automaton is correct The program does not have to check whether the automaton is correct
and whether it is deterministic and does not contain cycles. and whether it is deterministic and does not contain cycles.
@ -21,6 +22,8 @@ than sum) is taken.
NOTE 2. Task only for students whose student index number ("numer NOTE 2. Task only for students whose student index number ("numer
indeksu") is divisible by 3 with a remainder of 1 indeksu") is divisible by 3 with a remainder of 1
NOTE 3. You can add `LANG=C sort` to your Bash wrapper for the write sort.
POINTS: 14 POINTS: 14
DEADLINE: 2019-12-16 23:59 DEADLINE: 2019-12-16 23:59
REMAINDER: 1/3 REMAINDER: 1/3

1
TaskB04/medium.exp
View File

@ -1,3 +1,4 @@
a
abace abace
abadance abadance
abadanek abadanek

2
TaskB06/description.txt
View File

@ -11,4 +11,4 @@ NOTE. In section B for points for your tasks, the maximum (rather
than sum) is taken. than sum) is taken.
POINTS: 18 POINTS: 18
DEADLINE: 2019-01-10 23:59 DEADLINE: 2020-01-10 23:59

10
TaskX05/description.txt
View File

@ -1,9 +1,9 @@
Napisz gramatykę Thraxową, która zamienia wszystkie wystąpienia form Write a Thrax grammar which replaces all occurrences of Polish
słowa "Legia" na odpowiadające formy słowa "Lech" (forma "Legii" ma inflected forms of the word "Legia" ("Legia", "Legią", "Legię",
zostać zamieniona na "Lecha"). "Legii") into the corresponding forms of the word "Lech" ("Lech",
"Lechem", "Lecha", "Lecha", respectively).
Uwaga: to tylko przykład zadania (i rozwiązania). Zadanie ma już The task has a solution already, do not solve it!
rozwiązanie, proszę go nie rozwiązywać!
POINTS: 0 POINTS: 0
DEADLINE: 2020-01-30 23:00 DEADLINE: 2020-01-30 23:00

8
TaskX06/description.txt
View File

@ -1,8 +1,8 @@
Napisz gramatykę Thraxową, która zamienia zera na jedynki Write a Thrax grammar which replaces all 0s to 1s and 1s to 0s (other
i jedynki na zera, a pozostałe cyfry pozostawia bez zmian. digits should not be changed).
Można założyć, że na wejściu podawane są jedynie napisy składające się You can assume that only string composed of digits are given on the
z cyfr. input.
POINTS: 1 POINTS: 1
DEADLINE: 2019-12-13 23:59 DEADLINE: 2019-12-13 23:59