From cfce413fe354140a9989eef7a1fac2cfb5cd434f Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Filip=20Grali=C5=84ski?= Date: Tue, 10 Dec 2019 14:10:35 +0100 Subject: [PATCH 1/7] Add link to git --- TaskA49/description.txt | 4 +++- 1 file changed, 3 insertions(+), 1 deletion(-) diff --git a/TaskA49/description.txt b/TaskA49/description.txt index 6886df7..4f973ef 100644 --- a/TaskA49/description.txt +++ b/TaskA49/description.txt @@ -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 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 when you're sure you'll take part in it — the dataset and instructions From e2e815a9e95e5591971d40b3f9fc4ee230e93a5f Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Filip=20Grali=C5=84ski?= Date: Tue, 10 Dec 2019 15:07:39 +0100 Subject: [PATCH 2/7] Fix --- TaskB01/description.txt | 4 ++-- 1 file changed, 2 insertions(+), 2 deletions(-) diff --git a/TaskB01/description.txt b/TaskB01/description.txt index 7e13d5c..5d94363 100644 --- a/TaskB01/description.txt +++ b/TaskB01/description.txt @@ -4,8 +4,8 @@ Deterministic automaton II Read a description of a finite-state automaton in the AT&T format (without weights) from the standard input. Then, read strings from the 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 -standard output, otherwise — write NO, a space and the string. +accepted by the automated, write TRUE, a space and the string on the +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. From ca4730938fe5add669f00c9fdb823ac3ba4f62ba Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Filip=20Grali=C5=84ski?= Date: Tue, 10 Dec 2019 16:22:10 +0100 Subject: [PATCH 3/7] Fix B04 --- TaskB04/medium.exp | 1 + 1 file changed, 1 insertion(+) diff --git a/TaskB04/medium.exp b/TaskB04/medium.exp index eaf0309..30d3540 100644 --- a/TaskB04/medium.exp +++ b/TaskB04/medium.exp @@ -1,3 +1,4 @@ +a abace abadance abadanek From f1a81e7e048b66b38ceb0ca8492d1a333214c080 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Filip=20Grali=C5=84ski?= Date: Tue, 10 Dec 2019 16:28:10 +0100 Subject: [PATCH 4/7] More explanations --- TaskB04/description.txt | 7 +++++-- 1 file changed, 5 insertions(+), 2 deletions(-) diff --git a/TaskB04/description.txt b/TaskB04/description.txt index 605d73a..958cffd 100644 --- a/TaskB04/description.txt +++ b/TaskB04/description.txt @@ -7,8 +7,9 @@ cycles. The automaton alphabet is the set of Polish lower-case letters (English letters plus: ą, ć, ę, ł, ń, ó, ś, ź and ż). Your program should print, on standard output, all the paths of the -automaton in alphabetical order. "Print a path" means print a text -line containing all subsequent characters. +automaton in alphabetical order (to be precise: order induced by byte +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 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 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 DEADLINE: 2019-12-16 23:59 REMAINDER: 1/3 From 983775e95880d1f17f6669a78f668ead8107b37d Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Filip=20Grali=C5=84ski?= Date: Thu, 12 Dec 2019 09:23:03 +0100 Subject: [PATCH 5/7] Translate into English --- TaskX05/description.txt | 10 +++++----- TaskX06/description.txt | 8 ++++---- 2 files changed, 9 insertions(+), 9 deletions(-) diff --git a/TaskX05/description.txt b/TaskX05/description.txt index b93dfe6..e9d0d05 100644 --- a/TaskX05/description.txt +++ b/TaskX05/description.txt @@ -1,9 +1,9 @@ -Napisz gramatykę Thraxową, która zamienia wszystkie wystąpienia form -słowa "Legia" na odpowiadające formy słowa "Lech" (forma "Legii" ma -zostać zamieniona na "Lecha"). +Write a Thrax grammar which replaces all occurrences of Polish +inflected forms of the word "Legia" ("Legia", "Legią", "Legię", +"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ż -rozwiązanie, proszę go nie rozwiązywać! +The task has a solution already, do not solve it! POINTS: 0 DEADLINE: 2020-01-30 23:00 diff --git a/TaskX06/description.txt b/TaskX06/description.txt index 50d3de4..79b046a 100644 --- a/TaskX06/description.txt +++ b/TaskX06/description.txt @@ -1,8 +1,8 @@ -Napisz gramatykę Thraxową, która zamienia zera na jedynki -i jedynki na zera, a pozostałe cyfry pozostawia bez zmian. +Write a Thrax grammar which replaces all 0s to 1s and 1s to 0s (other +digits should not be changed). -Można założyć, że na wejściu podawane są jedynie napisy składające się -z cyfr. +You can assume that only string composed of digits are given on the +input. POINTS: 1 DEADLINE: 2019-12-13 23:59 From 014b64e6f724af87be415d3d4270494bade92af0 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Filip=20Grali=C5=84ski?= Date: Thu, 12 Dec 2019 09:23:53 +0100 Subject: [PATCH 6/7] Move deadlines --- TaskB00/description.txt | 2 +- TaskB01/description.txt | 2 +- TaskB02/description.txt | 2 +- 3 files changed, 3 insertions(+), 3 deletions(-) diff --git a/TaskB00/description.txt b/TaskB00/description.txt index d84cb21..9660543 100644 --- a/TaskB00/description.txt +++ b/TaskB00/description.txt @@ -18,5 +18,5 @@ NOTE: Task only for students whose student index number ("numer indeksu") is divisable by 3. POINTS: 8 -DEADLINE: 2019-12-09 18:45 +DEADLINE: 2019-12-12 18:45 REMAINDER: 0/3 diff --git a/TaskB01/description.txt b/TaskB01/description.txt index 5d94363..23db8c8 100644 --- a/TaskB01/description.txt +++ b/TaskB01/description.txt @@ -16,5 +16,5 @@ NOTE: Task only for students whose student index number ("numer indeksu") is divisable by 3 with a remainder of 1 POINTS: 8 -DEADLINE: 2019-12-09 18:45 +DEADLINE: 2019-12-12 18:45 REMAINDER: 1/3 diff --git a/TaskB02/description.txt b/TaskB02/description.txt index 5c1e651..a067ca1 100644 --- a/TaskB02/description.txt +++ b/TaskB02/description.txt @@ -24,5 +24,5 @@ NOTE: Task only for students whose student index number ("numer indeksu") is divisable by 3 with a remainder of 2 POINTS: 8 -DEADLINE: 2019-12-09 18:45 +DEADLINE: 2019-12-12 18:45 REMAINDER: 2/3 From 181464f83bca1604ca15407196649f82328cdf33 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Filip=20Grali=C5=84ski?= Date: Thu, 12 Dec 2019 16:55:09 +0100 Subject: [PATCH 7/7] fix deadline --- TaskB06/description.txt | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/TaskB06/description.txt b/TaskB06/description.txt index a556e1c..6212309 100644 --- a/TaskB06/description.txt +++ b/TaskB06/description.txt @@ -11,4 +11,4 @@ NOTE. In section B for points for your tasks, the maximum (rather than sum) is taken. POINTS: 18 -DEADLINE: 2019-01-10 23:59 +DEADLINE: 2020-01-10 23:59