From 12378810ee9207536bfa0c264c1bf2a2b0296171 Mon Sep 17 00:00:00 2001 From: =?UTF-8?q?Martin=20Mo=C5=BEina?= Date: Wed, 24 Aug 2016 15:32:22 +0200 Subject: Added several new exercises for Python (related to dictionaries and sets). --- python/problems/dictionaries/successors/common.py | 82 +++++++++++++++++++++++ python/problems/dictionaries/successors/en.py | 13 ++++ python/problems/dictionaries/successors/sl.py | 35 ++++++++++ 3 files changed, 130 insertions(+) create mode 100644 python/problems/dictionaries/successors/common.py create mode 100644 python/problems/dictionaries/successors/en.py create mode 100644 python/problems/dictionaries/successors/sl.py (limited to 'python/problems/dictionaries/successors') diff --git a/python/problems/dictionaries/successors/common.py b/python/problems/dictionaries/successors/common.py new file mode 100644 index 0000000..5f824f5 --- /dev/null +++ b/python/problems/dictionaries/successors/common.py @@ -0,0 +1,82 @@ +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 = 20609 +number = 10 +visible = True + +solution = '''\ +def children(tree, name): + if name in tree: + return tree[name] + return [] + +def successors(tree, name): + names = [] + for child in children(tree, name): + names.append(child) + names.extend(successors(tree, child)) + return names +''' + +hint_type = { + 'final_hint': Hint('final_hint') +} + +def test(python, code): + func_name = 'successors' + 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, 'tom'), ['ken', 'suzan']), + ((tree, 'sid'), ['rob', 'bob', 'jim', 'mary', + 'tom', 'judy', 'ken', 'suzan']), + ((tree, 'suzan'), []), + ((tree, 'ken'), ['suzan']), + ((tree, 'rob'), ['jim']), +] + + 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/successors/en.py b/python/problems/dictionaries/successors/en.py new file mode 100644 index 0000000..fb7c662 --- /dev/null +++ b/python/problems/dictionaries/successors/en.py @@ -0,0 +1,13 @@ +id = 20609 +name = 'Successors (family tree 4)' + +description = '''\ +

(translation missing)

''' + +hint = { + 'plan': '''\ +

(translation missing)

''', + + 'no_input_call': '''\ +

(translation missing)

''', +} diff --git a/python/problems/dictionaries/successors/sl.py b/python/problems/dictionaries/successors/sl.py new file mode 100644 index 0000000..e92e2d7 --- /dev/null +++ b/python/problems/dictionaries/successors/sl.py @@ -0,0 +1,35 @@ +import server +mod = server.problems.load_language('python', 'sl') + + +id = 20609 +name = 'Nasledniki (družinsko drevo 4)' + +description = '''\ +

+Napišite funkcijo successors(tree, name), +ki vrne seznam vseh naslednikov osebe. +

+ +

+Družinsko drevo tree je slovar, kjer ključi predstavljajo imena +staršev, vrednosti pa so njihovi otroci. Primer: +

+>>> tree = {'renee': ['rob', 'bob'], 'ken': ['suzan'], 'rob': ['jim'],
+            'sid': ['rob', 'bob'], ... , 'bob': ['mary', 'tom', 'judy']}
+>>> successors(tree, 'tom')
+['ken', 'suzan']
+>>> successors(tree, 'sid')
+['rob', 'bob', 'jim', 'mary', 'tom', 'judy', 'ken', 'suzan']
+
+

+''' + +plan = [] + +hint = { + 'final_hint': ['''\ +

Program je pravilen!
+

+'''], +} -- cgit v1.2.1