From 969812724912512740dbf037940a9e6770df19ed Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Martin=20Mo=C5=BEina?= <martin.mozina@fri.uni-lj.si>
Date: Thu, 6 Oct 2016 12:55:26 +0200
Subject: Added recursion exercises.

---
 .../recursion/family_tree_youngest/common.py       | 104 +++++++++++++++++++++
 .../problems/recursion/family_tree_youngest/en.py  |  13 +++
 .../problems/recursion/family_tree_youngest/sl.py  |  29 ++++++
 3 files changed, 146 insertions(+)
 create mode 100644 python/problems/recursion/family_tree_youngest/common.py
 create mode 100644 python/problems/recursion/family_tree_youngest/en.py
 create mode 100644 python/problems/recursion/family_tree_youngest/sl.py

(limited to 'python/problems/recursion/family_tree_youngest')

diff --git a/python/problems/recursion/family_tree_youngest/common.py b/python/problems/recursion/family_tree_youngest/common.py
new file mode 100644
index 0000000..099c1d3
--- /dev/null
+++ b/python/problems/recursion/family_tree_youngest/common.py
@@ -0,0 +1,104 @@
+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 = 20803
+number = 3
+visible = True
+
+solution = '''\
+def youngest(name):
+    xs = [(age[name], name)]
+    for c in children[name]:
+        xs.append(youngest(c))
+    return min(xs)
+'''
+
+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 = 'youngest'
+    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', (64, 'Hans')),
+        ('Daniel', (5, 'Alenka')),
+        ('Herman', (10, 'Margareta')),
+        ('Viljem', (20, 'Tadeja')),
+        ('Aleksander', (7, 'Aleksander')),
+        ('Adam', (5, 'Alenka'))
+    ]
+
+    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/family_tree_youngest/en.py b/python/problems/recursion/family_tree_youngest/en.py
new file mode 100644
index 0000000..ba3f813
--- /dev/null
+++ b/python/problems/recursion/family_tree_youngest/en.py
@@ -0,0 +1,13 @@
+id = 20803
+name = 'Family tree: the youngest'
+
+description = '''\
+<p>(translation missing)</p>'''
+
+hint = {
+    'plan': '''\
+<p>(translation missing)</p>''',
+
+    'no_input_call': '''\
+<p>(translation missing)</p>''',
+}
diff --git a/python/problems/recursion/family_tree_youngest/sl.py b/python/problems/recursion/family_tree_youngest/sl.py
new file mode 100644
index 0000000..04c2700
--- /dev/null
+++ b/python/problems/recursion/family_tree_youngest/sl.py
@@ -0,0 +1,29 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+id = 20803
+name = 'Družinsko drevo: najmlajši'
+
+description = '''\
+<p>
+Funkcija <code>youngest(name)</code> naj vrne starost in ime
+najmlajšega člana določene rodbine.
+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>
+>>> youngest('Hans')
+(64, 'Hans')
+>>> youngest('Daniel')
+(5, 'Alenka')
+</pre>
+'''
+
+plan = []
+
+hint = {
+    'final_hint': ['''\
+<p>Program je pravilen! <br>
+</p>
+'''],
+}
-- 
cgit v1.2.1