2019-12-05 12:32:48 +01:00
|
|
|
Cycles
|
|
|
|
|
======
|
2019-11-26 17:47:39 +01:00
|
|
|
|
2019-12-05 12:32:48 +01:00
|
|
|
Your program should read a finite-state automaton (without weights)
|
|
|
|
|
from standard input. The automaton can be nondeterministic and can
|
|
|
|
|
contain epsilon-transitions.
|
2019-11-26 17:47:39 +01:00
|
|
|
|
2019-12-05 12:32:48 +01:00
|
|
|
Your program should check whether the automaton contains a cycle (of any length).
|
2019-11-26 17:47:39 +01:00
|
|
|
|
2019-12-05 12:32:48 +01:00
|
|
|
If so, the following line should be written on the standard output:
|
2019-11-26 17:47:39 +01:00
|
|
|
|
|
|
|
|
TAK
|
|
|
|
|
|
2019-12-05 12:32:48 +01:00
|
|
|
otherwise:
|
2019-11-26 17:47:39 +01:00
|
|
|
|
|
|
|
|
NIE
|
|
|
|
|
|
2019-12-05 12:32:48 +01:00
|
|
|
("TAK" and "NIE" are "YES" and "NO" in Polish, these are used for
|
|
|
|
|
compatibility with further tasks.)
|
|
|
|
|
|
|
|
|
|
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
|
2019-12-05 12:49:55 +01:00
|
|
|
indeksu") is divisible by 3 with a remainder of 2.
|
2019-11-26 17:47:39 +01:00
|
|
|
|
|
|
|
|
POINTS: 14
|
2020-01-09 10:54:46 +01:00
|
|
|
DEADLINE: 2020-01-11 23:59
|
2019-11-26 19:58:23 +01:00
|
|
|
REMAINDER: 2/3
|
