s426197/djfz-2019-s426197
1
0
Fork 0
Code Issues Pull Requests Releases Wiki Activity

Translate into English

Browse Source
This commit is contained in:
Filip Graliński 2019-12-05 12:32:48 +01:00
parent 2c38255934
commit 7bf77f64c0
1 changed files with 16 additions and 10 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

26
TaskB05/description.txt
View File

@ -1,22 +1,28 @@
Cykle Cycles
===== ======
Program powinien wczytać automat skończeniestanowy (bez wag) ze Your program should read a finite-state automaton (without weights)
standardowego wejścia. Automat może być niedeterministyczny i zawierać from standard input. The automaton can be nondeterministic and can
epsilon-przejścia. contain epsilon-transitions.
Program powinien sprawdzić, czy automat zawiera cykle. Your program should check whether the automaton contains a cycle (of any length).
Jeśli tak, na wyjściu powinna zostać wypisana linia If so, the following line should be written on the standard output:
TAK TAK
w przeciwnym razie otherwise:
NIE NIE
NOTE: Task only for students whose student index number ("numer ("TAK" and "NIE" are "YES" and "NO" in Polish, these are used for
indeksu") is divisable by 3 with a remainder of 2 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
indeksu") is divisable by 3 with a remainder of 2.
POINTS: 14 POINTS: 14
DEADLINE: 2019-12-16 23:59 DEADLINE: 2019-12-16 23:59