filipg/djfz-2019
1
1
Fork 3
Code Issues Pull Requests 1 Releases Wiki Activity

More explanations

Browse Source
This commit is contained in:
Filip Graliński 2019-12-10 16:28:10 +01:00
parent ca4730938f
commit f1a81e7e04
1 changed files with 5 additions and 2 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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