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

3 files changed, 149 insertions, 0 deletions

diff --git a/python/problems/dictionaries/family/common.py b/python/problems/dictionaries/family/common.py
new file mode 100644
index 0000000..8d175e1
--- /dev/null
+++ b/python/problems/dictionaries/family/common.py
@@ -0,0 +1,80 @@
+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 = 20601
+number = 7
+visible = True
+
+solution = '''\
+def family_tree(family):
+    tree = {}
+    for parent, child in family:
+        if parent not in tree:
+            tree[parent] = []
+        tree[parent].append(child)
+    return tree
+'''
+
+hint_type = {
+    'final_hint': Hint('final_hint')
+}
+
+def test(python, code):
+    func_name = 'family_tree'
+    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 = [
+        ([('bob', 'mary')], {'bob':['mary']}),
+        ([('bob', 'mary'), ('bob', 'tom')], {'bob':['mary','tom']}),
+        ([], {}),
+        ([('bob','mary'),('mary','ken'),('alice','mary')], 
+         {'bob':['mary'], 'mary':['ken'], 'alice':['mary']}),
+        ([('bob','mary'), ('bob', 'tom'), ('bob', 'judy'), ('alice', 'mary'),
+          ('alice', 'tom'), ('alice', 'judy'),('renee', 'rob'), ('renee', 'bob'),
+          ('sid', 'rob'), ('sid', 'bob'),('tom', 'ken'), ('ken', 'suzan'),
+          ('rob', 'jim')],tree)
+    ]
+
+    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)):
+        n_correct += dict(ans[0]) == to
+        if dict(ans[0]) != to:
+            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/family/en.py b/python/problems/dictionaries/family/en.py
new file mode 100644
index 0000000..d04f58e
--- /dev/null
+++ b/python/problems/dictionaries/family/en.py
@@ -0,0 +1,14 @@
+id = 20601
+name = 'Family Tree'
+slug = 'Family Tree'
+
+description = '''\
+<p>(translation missing)</p>'''
+
+hint = {
+    'plan': '''\
+<p>(translation missing)</p>''',
+
+    'no_input_call': '''\
+<p>(translation missing)</p>''',
+}
diff --git a/python/problems/dictionaries/family/sl.py b/python/problems/dictionaries/family/sl.py
new file mode 100644
index 0000000..2a572d3
--- /dev/null
+++ b/python/problems/dictionaries/family/sl.py
@@ -0,0 +1,55 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+
+id = 20601
+name = 'Družinsko drevo'
+
+description = '''\
+<p>
+V seznamu imamo spravljeno družinsko drevo. Primer:
+<pre>
+family = [('bob', 'mary'), ('bob', 'tom'),
+          ('bob', 'judy'), ('alice', 'mary'),
+          ('alice', 'tom'), ('alice', 'judy'),
+          ('renee', 'rob'), ('renee', 'bob'),
+          ('sid', 'rob'), ('sid', 'bob'),
+          ('tom', 'ken'), ('ken', 'suzan'),
+          ('rob', 'jim')]
+</pre>
+</p>
+<p>
+V vsaki terki sta zapisani dve imeni: ime starša in ime otroka. Terka
+<code>('bob', 'mary')</code> nam pove, da je Bob Maryjin oče, terka
+<code>('bob', 'tom')</code> pa, da je Bob Tomov oče, itd.
+Za lažje razumevanje si relacije predstavimo s sliko:
+<figure>
+  <a href="[%@resource family.png%]" target="_blank">
+    <img src="[%@resource family.png%]" />
+  </a>
+</figure>
+</p>
+<h3>Naloga</h3>
+<p>
+Napišite funkcijo <code>family_tree(family)</code>, ki sprejeme seznam
+v katerem je spravljeno družinsko drevo in vrne slovar v katerem je za vsakega
+starša spravljen seznam vseh njegovih otrok.</p>
+<pre>
+>>> family_tree(family)
+{'renee': ['rob', 'bob'],
+'ken': ['suzan'],
+'rob': ['jim'],
+'sid': ['rob', 'bob'],
+... ,
+'bob': ['mary', 'tom', 'judy']}
+</pre>
+</p>'''
+
+plan = []
+
+hint = {
+    'final_hint': ['''\
+<p>Program je pravilen! <br>
+</p>
+'''],
+}