2019-12-05 12:40:47 +01:00
|
|
|
Paths
|
|
|
|
|
======
|
2019-11-26 17:47:39 +01:00
|
|
|
|
2019-12-05 12:40:47 +01:00
|
|
|
Your program should read a finite-state automaton from standard input.
|
|
|
|
|
The automaton is deterministic, you can assume it does not contain
|
|
|
|
|
cycles. The automaton alphabet is the set of Polish lower-case letters
|
|
|
|
|
(English letters plus: ą, ć, ę, ł, ń, ó, ś, ź and ż).
|
2019-11-26 17:47:39 +01:00
|
|
|
|
2019-12-05 12:40:47 +01:00
|
|
|
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.
|
|
|
|
|
|
|
|
|
|
The program does not have to check whether the automaton is correct
|
|
|
|
|
and whether it is deterministic and does not contain cycles.
|
2019-11-26 17:47:39 +01:00
|
|
|
|
2019-12-05 12:40:47 +01:00
|
|
|
Weights (if any) should be disregarded.
|
|
|
|
|
|
|
|
|
|
NOTE 1. In section B for points for your tasks, the maximum (rather
|
|
|
|
|
than sum) is taken.
|
2019-11-26 17:47:39 +01:00
|
|
|
|
2019-12-05 12:40:47 +01:00
|
|
|
NOTE 2. Task only for students whose student index number ("numer
|
2019-12-05 12:49:55 +01:00
|
|
|
indeksu") is divisible by 3 with a remainder of 1
|
2019-11-26 19:58:23 +01:00
|
|
|
|
2019-11-26 17:47:39 +01:00
|
|
|
POINTS: 14
|
|
|
|
|
DEADLINE: 2019-12-16 23:59
|
2019-11-26 19:58:23 +01:00
|
|
|
REMAINDER: 1/3
|
