djfz-2019-s439415/TaskB04/description.txt

Paths
======

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 ż).

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.

Weights (if any) should be disregarded.

NOTE 1. In section B for points for your tasks, the maximum (rather
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

POINTS: 14
DEADLINE: 2019-12-16 23:59
REMAINDER: 1/3