C00-03

TaskC00/description.txt

@@ -0,0 +1,11 @@
+Read a description of a non-deterministic finite-state automaton in the AT&T format                                                                                                                                                                         
+(without weights) from the file in the first argument.
+
+Read strings from the standard input.
+If a string is accepted by the
+automaton, write YES, otherwise- write NO.
+
+The program is invoked like this: python run.py test1.arg test1.in test1.out
+
+Note that not all transitions must be included in description.
+If no transition is given for the given state and letter, write NO.

TaskC00/long.exp

@@ -0,0 +1,7 @@
+NO
+NO
+YES
+YES
+NO
+NO
+NO

TaskC00/long.in

@@ -0,0 +1,7 @@
+aaa
+aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
+aaaa
+aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
+xyz
+aba
+a

TaskC00/run.py

@@ -0,0 +1,65 @@
+import sys
+
+
+sys.setrecursionlimit(4500)
+
+def AddTransition(transitions, state_from, state_to, symbol):
+    if state_from in transitions:
+        if symbol not in transitions[state_from]:
+            transitions[state_from][symbol] = {state_to}
+        else:
+            transitions[state_from][symbol] |= {state_to}
+    else:
+        transitions[state_from] = {symbol: {state_to}}
+
+
+def AddFinalState(final_states, state):
+    final_states.add(state)
+
+
+def GetFinalStates(transitions, final_states, string, current_state):
+    if not string:
+        return current_state if current_state in final_states else -1
+
+    symbol, rest = string[0], string[1:]
+
+    try:
+        for state in transitions[current_state][symbol]:
+            result = GetFinalStates(transitions, final_states, rest, state)
+            if result != -1:
+                return result
+    except KeyError:
+        return -1
+
+    return -1
+
+
+def IsAccepted(transitions, final_states, string, initial_state):
+    final_state = GetFinalStates(transitions, final_states, string, initial_state)
+    return final_state in final_states
+
+
+
+transitions = {}
+final_states = set()
+
+with open(sys.argv[1]) as table:
+    for line in table:
+        line = line.rstrip()
+
+        if len(line.split('\t')) == 3:
+            a, b, c = line.split('\t')
+            AddTransition(transitions, a, b, c)
+        else:
+            AddFinalState(final_states, line)
+
+with open(sys.argv[2], 'r') as input_data, open(sys.argv[3], 'w') as output_data:
+    for line in input_data:
+        line = line.rstrip()
+
+        if IsAccepted(transitions, final_states, line, '0'):
+            output_data.write('YES\n')
+        else:
+            output_data.write('NO\n')
+
+

TaskC00/test1.arg

@@ -0,0 +1,16 @@
+0	1	x
+0	4	y
+0	4	z
+1	4	x
+1	2	y
+1	4	z
+2	4	x
+2	3	z
+2	4	y
+3	4	x
+3	4	y
+3	4	z
+4	4	x
+4	4	y
+4	4	z
+3

TaskC00/test1.exp

@@ -0,0 +1,9 @@
+NO
+YES
+NO
+NO
+NO
+NO
+NO
+NO
+NO

TaskC00/test1.in

@@ -0,0 +1,9 @@
+xxyz
+xyz
+xy
+zz
+xxy
+yzx
+
+x
+xyzz

TaskC00/test1.out

@@ -0,0 +1,9 @@
+NO
+YES
+NO
+NO
+NO
+NO
+NO
+NO
+NO

TaskC00/testnfa.arg

@@ -0,0 +1,7 @@
+0	1	a
+1	0	a
+1	2	b
+1	3	b
+2	4	c
+3
+4

TaskC00/testnfa.exp

@@ -0,0 +1,8 @@
+YES
+YES
+NO
+NO
+NO
+YES
+NO
+YES

TaskC00/testnfa.in

@@ -0,0 +1,8 @@
+abc
+ab
+abcd
+aaaabc
+aaaaaaaabc
+aaaaaaabc
+zzz
+aaaaaaabc

TaskC00/testnfa.out

@@ -0,0 +1,8 @@
+YES
+YES
+NO
+NO
+NO
+YES
+NO
+YES

TaskC01/description.txt

@@ -0,0 +1,11 @@
+Use a non deterministic finite-state automaton (FSA) engine from the TaskC00.
+Create your own non deterministic FSA description to check whether the string second letter
+from right is 'b'.
+Don't use external files like in TaskF00 (description should be included in run file).
+
+The alphabet is "a", "b", "C"
+
+Read strings from the standard input.
+If a string is accepted by the 
+automaton, write YES, otherwise- write NO. 
+

TaskC01/run.py

@@ -0,0 +1,57 @@
+import sys
+
+sys.setrecursionlimit(4500)
+
+def AddTransition(transitions, state_from, state_to, symbol):
+    if state_from in transitions:
+        if symbol not in transitions[state_from]:
+            transitions[state_from][symbol] = {state_to}
+        else:
+            transitions[state_from][symbol] |= {state_to}
+    else:
+        transitions[state_from] = {symbol: {state_to}}
+
+def AddFinalState(final_states, state):
+    final_states.add(state)
+
+def GetFinalState(transitions, final_states, string, current_state):
+    if not string:
+        return current_state if current_state in final_states else -1
+
+    symbol, rest = string[0], string[1:]
+
+    try:
+        for state in transitions[current_state][symbol]:
+            result = GetFinalState(transitions, final_states, rest, state)
+            if result != -1:
+                return result
+    except KeyError:
+        return -1
+
+    return -1
+
+def IsAccepted(transitions, finalStates, string, initial_state):
+    finalState = GetFinalState(transitions, finalStates, string, initial_state)
+    return finalState in finalStates
+
+
+transitions = {}
+finalStates = {2}
+
+AddTransition(transitions, 0, 0, 'a')
+AddTransition(transitions, 0, 0, 'b')
+AddTransition(transitions, 0, 0, 'c')
+AddTransition(transitions, 0, 1, 'b')
+AddTransition(transitions, 1, 2, 'a')
+AddTransition(transitions, 1, 2, 'b')
+AddTransition(transitions, 1, 2, 'c')
+
+
+for line in sys.stdin:
+    line = line.rstrip()
+
+    if IsAccepted(transitions, finalStates, line, 0):
+        print('YES')
+    else:
+        print('NO')
+

TaskC01/test.arg

@@ -0,0 +1,8 @@
+0   0   a
+0   0   b
+0   0   c
+0   1   b
+1   2   a
+1   2   b
+1   2   c
+2

TaskC01/test.exp

@@ -0,0 +1,6 @@
+YES
+YES
+NO
+NO
+NO
+YES

TaskC01/test.in

@@ -0,0 +1,6 @@
+abc
+abbc
+bca
+b
+abaa
+aaacbb

TaskC02/description.txt

@@ -0,0 +1,11 @@
+Use a non deterministic finite-state automaton (FSA) engine from the TaskC00.
+Create your own non deterministic FSA description to check whether the string
+ends with "ab"
+Don't use external files like in TaskF00 (description should be included in run file).
+
+The alphabet is "a", "b", "C"
+
+Read strings from the standard input.
+If a string is accepted by the 
+automaton, write YES, otherwise- write NO. 
+

TaskC02/run.py

@@ -0,0 +1,59 @@
+import sys
+
+sys.setrecursionlimit(4500)
+
+def AddTransition(transitions, state_from, state_to, symbol):
+    if state_from in transitions:
+        if symbol not in transitions[state_from]:
+            transitions[state_from][symbol] = {state_to}
+        else:
+            transitions[state_from][symbol] |= {state_to}
+    else:
+        transitions[state_from] = {symbol: {state_to}}
+
+def AddFinalState(final_states, state):
+    final_states.add(state)
+
+def GetFinalState(transitions, final_states, string, current_state):
+    if not string:
+        return current_state if current_state in final_states else -1
+
+    symbol, rest = string[0], string[1:]
+
+    try:
+        for state in transitions[current_state][symbol]:
+            result = GetFinalState(transitions, final_states, rest, state)
+            if result != -1:
+                return result
+    except KeyError:
+        return -1
+
+    return -1
+
+def IsAccepted(transitions, finalStates, string, initial_state):
+    finalState = GetFinalState(transitions, finalStates, string, initial_state)
+    return finalState in finalStates
+
+
+transitions = {}
+finalStates = {2}
+
+AddTransition(transitions, 0, 0, 'a')
+AddTransition(transitions, 0, 0, 'b')
+AddTransition(transitions, 0, 0, 'c')
+AddTransition(transitions, 0, 1, 'a')
+AddTransition(transitions, 1, 2, 'b')
+AddTransition(transitions, 2, 0, 'a')
+AddTransition(transitions, 2, 0, 'b')
+AddTransition(transitions, 2, 0, 'c')
+
+
+
+for line in sys.stdin:
+    line = line.rstrip()
+
+    if IsAccepted(transitions, finalStates, line, 0):
+        print('YES')
+    else:
+        print('NO')
+

TaskC02/test.arg

@@ -0,0 +1,9 @@
+0   0   a
+0   0   b
+0   0   c
+0   1   a
+1   2   b
+2   0   a
+2   0   b
+2   0   c
+2

TaskC02/test.exp

@@ -0,0 +1,6 @@
+YES
+NO
+YES
+NO
+YES
+NO

TaskC02/test.in

@@ -0,0 +1,6 @@
+ab
+a
+abbab
+bbbbb
+ababaab
+b

TaskC03/description.txt

@@ -0,0 +1,10 @@
+Use a non deterministic finite-state automaton (FSA) engine from the TaskC00.
+Create your own non deterministic FSA description to check whether the string
+contains "abc"
+Don't use external files like in TaskF00 (description should be included in run file).
+
+The alphabet is "a", "b", "c"
+
+Read strings from the standard input.
+If a string is accepted by the 
+automaton, write YES, otherwise- write NO. 

TaskC03/run.py

@@ -0,0 +1,63 @@
+import sys
+
+sys.setrecursionlimit(4500)
+
+def AddTransition(transitions, state_from, state_to, symbol):
+    if state_from in transitions:
+        if symbol not in transitions[state_from]:
+            transitions[state_from][symbol] = {state_to}
+        else:
+            transitions[state_from][symbol] |= {state_to}
+    else:
+        transitions[state_from] = {symbol: {state_to}}
+
+def AddFinalState(final_states, state):
+    final_states.add(state)
+
+def GetFinalState(transitions, final_states, string, current_state):
+    if not string:
+        return current_state if current_state in final_states else -1
+
+    symbol, rest = string[0], string[1:]
+
+    try:
+        for state in transitions[current_state][symbol]:
+            result = GetFinalState(transitions, final_states, rest, state)
+            if result != -1:
+                return result
+    except KeyError:
+        return -1
+
+    return -1
+
+def IsAccepted(transitions, finalStates, string, initial_state):
+    finalState = GetFinalState(transitions, finalStates, string, initial_state)
+    return finalState in finalStates
+
+
+transitions = {}
+finalStates = {3}
+
+AddTransition(transitions, 0, 0, 'b')
+AddTransition(transitions, 0, 0, 'c')
+AddTransition(transitions, 0, 1, 'a')
+AddTransition(transitions, 1, 1, 'a')
+AddTransition(transitions, 1, 0, 'c')
+AddTransition(transitions, 1, 2, 'b')
+AddTransition(transitions, 2, 1, 'a')
+AddTransition(transitions, 2, 0, 'b')
+AddTransition(transitions, 2, 3, 'c')
+AddTransition(transitions, 3, 3, 'a')
+AddTransition(transitions, 3, 3, 'b')
+AddTransition(transitions, 3, 3, 'c')
+
+
+
+for line in sys.stdin:
+    line = line.rstrip()
+
+    if IsAccepted(transitions, finalStates, line, 0):
+        print('YES')
+    else:
+        print('NO')
+

TaskC03/test.arg

@@ -0,0 +1,13 @@
+0   0   b
+0   0   c
+0   1   a
+1   1   a
+1   0   c
+1   2   b
+2   1   a
+2   0   b
+2   3   c
+3   3   a
+3   3   b
+3   3   c
+3

TaskC03/test.exp

@@ -0,0 +1,7 @@
+YES
+YES
+YES
+NO
+NO
+NO
+NO

TaskC03/test.in

@@ -0,0 +1,7 @@
+abc
+acabc
+acabccb
+abbab
+bbbbb
+ababaab
+bc

TaskC04/description.txt

@@ -0,0 +1,22 @@
+Deterministic automaton III
+===========================
+
+Read a description of a finite-state automaton in the AT&T format
+(without weights) from the file in the first argument. Then, read strings from the
+standard input. If a string is
+accepted by the automated, write YES, a space and the string on the
+standard output, otherwise — write NO, a space and the string.
+
+If there is a non-determinism in the automaton, the first transition should be chosen.
+
+The automaton can contain epsilon transitions ("<eps>" instead of a
+character). They should be interpreted as follows: an epsilon
+transition can be used (without "eating" a character from the input),
+if there is no other transition applicable. You can assume that there
+is at most one epsilon transition from a given state and that there
+are no cycles with epsilon transition.
+
+Your program does not have to check whether the description is correct
+and whether the automaton is deterministic. You can assume that the
+automaton does not contain epsilon transitions.
+

TaskC04/eps.arg

@@ -0,0 +1,8 @@
+0	1	a
+1	0	a
+1	2	b
+2	4	c
+1	3	<eps>
+3	4	d
+3
+4

TaskC04/eps.exp

@@ -0,0 +1,10 @@
+TRUE a
+FALSE aa
+TRUE aaa
+TRUE abc
+TRUE aaabc
+FALSE aaabcd
+FALSE aabc
+FALSE abd
+TRUE ad
+FALSE aad

TaskC04/eps.in

@@ -0,0 +1,10 @@
+a
+aa
+aaa
+abc
+aaabc
+aaabcd
+aabc
+abd
+ad
+aad

TaskC04/long.exp

@@ -0,0 +1,7 @@
+FALSE aaa
+FALSE aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
+TRUE aaaa
+TRUE aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
+FALSE xyz
+FALSE aba
+FALSE a

TaskC04/long.in

@@ -0,0 +1,7 @@
+aaa
+aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
+aaaa
+aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
+xyz
+aba
+a

TaskC04/simple1.arg

@@ -0,0 +1,5 @@
+# prosty automat akceptujący tylko napis "abc"
+0	1	a
+1	2	b
+2	3	c
+3

TaskC04/simple1.exp

@@ -0,0 +1,8 @@
+FALSE a
+FALSE ab
+TRUE abc
+FALSE abcd
+FALSE aaaaab
+TRUE abc
+FALSE xyz
+FALSE 0

TaskC04/simple1.in

@@ -0,0 +1,8 @@
+a
+ab
+abc
+abcd
+aaaaab
+abc
+xyz
+0

TaskC04/simple2.arg

@@ -0,0 +1,9 @@
+# automat akceptujący napis "ab*c" (b powielony dowolną liczbę razy) i "kot"
+0	1	a
+1	1	b
+1	2	c
+0	3	k
+3	4	o
+4	5	t
+2
+5

TaskC04/simple2.exp

@@ -0,0 +1,9 @@
+TRUE kot
+TRUE ac
+TRUE abc
+TRUE abbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbc
+FALSE abcd
+FALSE abbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcccccc
+FALSE kotek
+FALSE kotabc
+TRUE kot

TaskC04/simple2.in

@@ -0,0 +1,9 @@
+kot
+ac
+abc
+abbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbc
+abcd
+abbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbbcccccc
+kotek
+kotabc
+kot

TaskC05/description.txt

@@ -0,0 +1,49 @@
+Dictionary
+==========
+
+Your program should read a finite-state automaton from file in the first argument.
+The automaton is deterministic, you can assume it does not contain
+cycles.
+
+Each automaton path is labeled with a symbol sequence of the following form:
+
+<input word>;<description>
+
+e.g.:
+
+biały;ADJ
+dom;N
+piła;N
+piła;V
+stali;N
+stali;V
+stali;ADJ
+
+Next you should read words from the standard input.
+For each word, you should all automaton
+paths that begin a given word, the following symbol is ';'
+(semicolon), e.g. for the word 'dom' we are looking for paths
+beginning with 'dom;'. If there is no such path, the following message
+should be printed:
+
+<input word>;OOV
+
+For instance, for the automaton given above and the input:
+
+budynek
+dom
+piła
+
+we should get:
+
+budynek;OOV
+dom;N
+piła;N
+piła;V
+
+If there is more than one path for a given word, they should be given in alphabetical order.
+
+The program does not have to check whether the automaton is correct
+and whether it is deterministic and does not contain cycles.
+
+

TaskC05/elem.arg

@@ -0,0 +1,31 @@
+0	1	b
+0	2	d
+0	3	p
+0	4	s
+1	5	i
+2	6	o
+3	7	i
+4	8	t
+5	9	a
+6	10	m
+7	11	ł
+8	12	a
+9	13	ł
+10	14	;
+11	15	a
+12	16	l
+13	17	y
+14	24	N
+15	18	;
+16	19	i
+17	20	;
+18	24	N
+18	24	V
+19	21	;
+20	22	A
+21	22	A
+21	24	N
+21	24	V
+22	23	D
+23	24	J
+24

TaskC05/elem.exp

@@ -0,0 +1 @@
+dom;N

TaskC05/elem.in

@@ -0,0 +1 @@
+dom

TaskC05/medium.exp

@@ -0,0 +1,7 @@
+arbuz;N
+arbuza;N
+arbuzowi;ADJ
+arbuzowi;N
+azylant;N
+azylanci;N
+azylantowie;OOV

TaskC05/medium.in

@@ -0,0 +1,6 @@
+arbuz
+arbuza
+arbuzowi
+azylant
+azylanci
+azylantowie

TaskC05/multi.arg

@@ -0,0 +1,31 @@
+0	1	b
+0	2	d
+0	3	p
+0	4	s
+1	5	i
+2	6	o
+3	7	i
+4	8	t
+5	9	a
+6	10	m
+7	11	ł
+8	12	a
+9	13	ł
+10	14	;
+11	15	a
+12	16	l
+13	17	y
+14	24	N
+15	18	;
+16	19	i
+17	20	;
+18	24	N
+18	24	V
+19	21	;
+20	22	A
+21	22	A
+21	24	N
+21	24	V
+22	23	D
+23	24	J
+24

TaskC05/multi.exp

@@ -0,0 +1,2 @@
+piła;N
+piła;V

TaskC05/multi.in

@@ -0,0 +1 @@
+piła

TaskC05/oov.arg

@@ -0,0 +1,31 @@
+0	1	b
+0	2	d
+0	3	p
+0	4	s
+1	5	i
+2	6	o
+3	7	i
+4	8	t
+5	9	a
+6	10	m
+7	11	ł
+8	12	a
+9	13	ł
+10	14	;
+11	15	a
+12	16	l
+13	17	y
+14	24	N
+15	18	;
+16	19	i
+17	20	;
+18	24	N
+18	24	V
+19	21	;
+20	22	A
+21	22	A
+21	24	N
+21	24	V
+22	23	D
+23	24	J
+24

TaskC05/oov.exp

@@ -0,0 +1 @@
+budynek;OOV

TaskC05/oov.in

@@ -0,0 +1 @@
+budynek

TaskC06/description.txt

@@ -0,0 +1,21 @@
+Paths
+======
+
+Your program should read a finite-state automaton from
+the 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 (to be precise: order induced by byte
+codes of strings, not according to the standard Polish 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. You can add `LANG=C sort` to your Bash wrapper for the write sort.
+

TaskC06/medium2.exp

@@ -0,0 +1 @@
+a

TaskC06/small.exp

@@ -0,0 +1,4 @@
+biały
+dom
+piła
+stali

TaskC06/small.in

@@ -0,0 +1,18 @@
+0	1	b
+0	2	d
+0	3	p
+0	4	s
+1	5	i
+2	6	o
+3	7	i
+4	8	t
+5	9	a
+6	14	m
+7	10	ł
+8	11	a
+9	12	ł
+10	14	a
+11	13	l
+12	14	y
+13	14	i
+14

TaskC06/small2.exp

@@ -0,0 +1,3 @@
+biały
+piła
+stali

TaskC06/small2.in

@@ -0,0 +1,18 @@
+0	1	b
+0	2	d
+0	3	p
+0	4	s
+1	5	i
+2	6	o
+3	7	i
+4	8	t
+5	9	a
+6	15	m
+7	10	ł
+8	11	a
+9	12	ł
+10	14	a
+11	13	l
+12	14	y
+13	14	i
+14