Added recursion exercises.

3 files changed, 151 insertions, 0 deletions

diff --git a/python/problems/recursion/path_to/common.py b/python/problems/recursion/path_to/common.py
new file mode 100644
index 0000000..cf63b6c
--- /dev/null
+++ b/python/problems/recursion/path_to/common.py
@@ -0,0 +1,108 @@
+import re
+from python.util import has_token_sequence, string_almost_equal, \
+    string_contains_number, get_tokens, get_numbers, get_exception_desc, \
+    all_tokens, has_comprehension, has_loop, almost_equal, get_ast
+from server.hints import Hint
+
+id = 20805
+number = 5
+visible = True
+
+solution = '''\
+def pathto(fr, to):
+    if fr == to:
+        return [fr]
+    for c in children[fr]:
+        d = pathto(c, to)
+        if d is not None:
+            return [fr] + d
+'''
+
+hint_type = {
+    'final_hint': Hint('final_hint')
+}
+
+precode = """
+children = {
+    "Adam": ["Matjaž", "Cilka", "Daniel", "Erik"],
+    "Aleksander": [],
+    "Alenka": [],
+    "Barbara": [],
+    "Cilka": [],
+    "Daniel": ["Elizabeta", "Hans"],
+    "Erik": [],
+    "Elizabeta": ["Ludvik", "Jurij", "Barbara", "Herman", "Mihael"],
+    "Franc": [],
+    "Herman": ["Margareta"],
+    "Hans": [],
+    "Jožef": ["Alenka", "Aleksander", "Petra"],
+    "Jurij": ["Franc", "Jožef"],
+    "Ludvik": [],
+    "Margareta": [],
+    "Matjaž": ["Viljem"],
+    "Mihael": [],
+    "Petra": [],
+    "Tadeja": [],
+    "Viljem": ["Tadeja"],
+}
+
+age = {
+    "Adam": 111, "Matjaž": 90, "Cilka": 88, "Daniel": 85, "Erik": 83,
+    "Viljem": 58, "Tadeja": 20, "Elizabeta": 67, "Hans": 64, "Ludvik": 50,
+    "Jurij": 49, "Barbara": 45, "Herman": 39, "Mihael": 32, "Franc": 30,
+    "Jožef": 29, "Margareta": 10, "Alenka": 5, "Aleksander": 7, "Petra": 9
+}"""
+
+def test(python, code):
+    code = precode + "\n" + code
+
+    func_name = 'pathto'
+    tokens = get_tokens(code)
+    if not has_token_sequence(tokens, ['def', func_name]):
+        return False, [{'id' : 'no_func_name', 'args' : {'func_name' : func_name}}]
+
+    in_out = [
+        (('Hans', 'Hans'), ['Hans']),
+        (('Daniel', 'Hans'), ['Daniel', 'Hans']),
+        (('Adam', 'Hans'), ['Adam', 'Daniel', 'Hans']),
+        (('Adam', 'Franc'), ['Adam', 'Daniel', 'Elizabeta', 'Jurij', 'Franc']),
+        (('Adam', 'Petra'), ['Adam', 'Daniel', 'Elizabeta', 'Jurij', 'Jožef', 'Petra']),
+        (('Elizabeta', 'Aleksander'), ['Elizabeta', 'Jurij', 'Jožef', 'Aleksander']),
+        (('Adam', 'Tadeja'), ['Adam', 'Matjaž', 'Viljem', 'Tadeja']),
+        (('Daniel', 'Ludvik'), ['Daniel', 'Elizabeta', 'Ludvik'])
+    ]
+
+    test_in = [('{0}{1}'.format(func_name, str(l[0])), None)
+               for l in in_out]
+    test_out = [l[1] for l in in_out]
+
+    answers = python(code=code, inputs=test_in, timeout=1.0)
+    n_correct = 0
+    tin, tout = None, None
+    for i, (ans, to) in enumerate(zip(answers, test_out)):
+        res = ans[0]
+        corr = res == to
+        n_correct += corr
+        if not corr:
+            tin = test_in[i][0]
+            tout = to
+
+    passed = n_correct == len(test_in)
+    hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_in)}}]
+    if tin:
+        hints.append({'id': 'problematic_test_case', 'args': {'testin': str(tin), 'testout': str(tout)}})
+    if passed:
+        hints.append({'id': 'final_hint'})
+
+    return passed, hints
+
+
+def hint(python, code):
+    tokens = get_tokens(code)
+
+    # run one test first to see if there are any exceptions
+    answer = python(code=code, inputs=[(None, None)], timeout=1.0)
+    exc = get_exception_desc(answer[0][3])
+    if exc: return exc
+
+    return None
diff --git a/python/problems/recursion/path_to/en.py b/python/problems/recursion/path_to/en.py
new file mode 100644
index 0000000..703d818
--- /dev/null
+++ b/python/problems/recursion/path_to/en.py
@@ -0,0 +1,13 @@
+id = 20805
+name = 'Family tree: path to'
+
+description = '''\
+<p>(translation missing)</p>'''
+
+hint = {
+    'plan': '''\
+<p>(translation missing)</p>''',
+
+    'no_input_call': '''\
+<p>(translation missing)</p>''',
+}
diff --git a/python/problems/recursion/path_to/sl.py b/python/problems/recursion/path_to/sl.py
new file mode 100644
index 0000000..b53bd26
--- /dev/null
+++ b/python/problems/recursion/path_to/sl.py
@@ -0,0 +1,30 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+id = 20805
+name = 'Družinsko drevo: pot do'
+
+description = '''\
+<p>
+Reši podobno nalogo kot je prejšnja, le da naj funkcija ne vrne razdalje do
+določene osebe, temveč pot do nje. Uporabite družinsko
+drevo (<a target="_blank" href="[%@resource novak.png%]">slika</a> in
+<a target="_blank" href="[%@resource slovar.html%]">slovar</a>). </p>
+<pre>
+>>> pathto('Daniel', 'Hans')
+['Daniel', 'Hans']
+>>> pathto('Adam', 'Hans')
+['Adam', 'Daniel', 'Hans']
+>>> pathto('Adam', 'Franc')
+['Adam', 'Daniel', 'Elizabeta', 'Jurij', 'Franc']
+</pre>
+'''
+
+plan = []
+
+hint = {
+    'final_hint': ['''\
+<p>Program je pravilen! <br>
+</p>
+'''],
+}