Added several new exercises for Python (related to dictionaries and sets).

3 files changed, 130 insertions, 0 deletions

diff --git a/python/problems/dictionaries/grandchildren/common.py b/python/problems/dictionaries/grandchildren/common.py
new file mode 100644
index 0000000..0e71fba
--- /dev/null
+++ b/python/problems/dictionaries/grandchildren/common.py
@@ -0,0 +1,84 @@
+import re
+from python.util import has_token_sequence, string_almost_equal, \
+    string_contains_number, get_tokens, get_numbers, get_exception_desc
+from server.hints import Hint
+
+id = 20608
+number = 9
+visible = True
+
+solution = '''\
+def children(tree, name):
+    if name in tree:
+        return tree[name]
+    return []
+
+def grandchildren(tree, name):
+    names = []
+    for child in children(tree, name):
+        for grandchild in children(tree, child):
+            names.append(grandchild)
+    return names
+'''
+
+hint_type = {
+    'final_hint': Hint('final_hint')
+}
+
+
+def test(python, code):
+    func_name = 'grandchildren'
+    tokens = get_tokens(code)
+    if not has_token_sequence(tokens, ['def', func_name]):
+        return False, [{'id' : 'no_func_name', 'args' : {'func_name' : func_name}}]
+
+    tree = {
+            'alice': ['mary', 'tom', 'judy'],
+            'bob': ['mary', 'tom', 'judy'],
+            'ken': ['suzan'],
+            'renee': ['rob', 'bob'],
+            'rob': ['jim'],
+            'sid': ['rob', 'bob'],
+            'tom': ['ken']}
+
+    in_out = [
+        ((tree, 'alice'), ['ken']),
+        ((tree, 'bob'), ['ken']),
+        ((tree, 'ken'), []),
+        ((tree, 'mary'), []),
+        ((tree, 'renee'), ['jim', 'mary', 'tom', 'judy']),
+        ((tree, 'sid'), ['jim', 'mary', 'tom', 'judy']),
+        ((tree, 'tom'), ['suzan']),
+]
+
+    test_in = [(func_name+'%s'%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)):
+        corr = set(ans[0]) == set(to) and len(ans[0]) == len(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/dictionaries/grandchildren/en.py b/python/problems/dictionaries/grandchildren/en.py
new file mode 100644
index 0000000..3f98328
--- /dev/null
+++ b/python/problems/dictionaries/grandchildren/en.py
@@ -0,0 +1,13 @@
+id = 20608
+name = 'Grandchildren (family tree 3)'
+
+description = '''\
+<p>(translation missing)</p>'''
+
+hint = {
+    'plan': '''\
+<p>(translation missing)</p>''',
+
+    'no_input_call': '''\
+<p>(translation missing)</p>''',
+}
diff --git a/python/problems/dictionaries/grandchildren/sl.py b/python/problems/dictionaries/grandchildren/sl.py
new file mode 100644
index 0000000..b24c315
--- /dev/null
+++ b/python/problems/dictionaries/grandchildren/sl.py
@@ -0,0 +1,33 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+
+id = 20608
+name = 'Vnuki (družinsko drevo 3)'
+
+description = '''\
+<p>
+Napišite funkcijo <code>grandchildren(tree, name)</code>, ki v družinskem drevesu <code>tree</code>
+vrne seznam vseh vnukov in vnukinj osebe. V primeru, da oseba nima vnukov, vrnite prazen seznam.
+</p>
+
+<p>
+Družinsko drevo <code>tree</code> je slovar, kjer ključi predstavljajo imena
+staršev, vrednosti pa so njihovi otroci. Primer iz prejšnje naloge:
+<pre>
+>>> tree = {'renee': ['rob', 'bob'], 'ken': ['suzan'], 'rob': ['jim'],
+            'sid': ['rob', 'bob'], ... , 'bob': ['mary', 'tom', 'judy']}
+>>> grandchildren(tree, 'renee')
+['jim', 'mary', 'tom', 'judy']
+</pre>
+</p>
+'''
+
+plan = []
+
+hint = {
+    'final_hint': ['''\
+<p>Program je pravilen! <br>
+</p>
+'''],
+}