Translate into English

TaskB05/description.txt

@@ -1,22 +1,28 @@
-Cykle
-=====
+Cycles
+======
 
-Program powinien wczytać automat skończeniestanowy (bez wag) ze
-standardowego wejścia. Automat może być niedeterministyczny i zawierać
-epsilon-przejścia.
+Your program should read a finite-state automaton (without weights)
+from standard input. The automaton can be nondeterministic and can
+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
 
-w przeciwnym razie
+otherwise:
 
 NIE
 
-NOTE: Task only for students whose student index number ("numer
-indeksu") is divisable by 3 with a remainder of 2
+("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
+indeksu") is divisable by 3 with a remainder of 2.
 
 POINTS: 14
 DEADLINE: 2019-12-16 23:59