diff options
author | Martin Možina <martin.mozina@fri.uni-lj.si> | 2016-10-25 11:44:09 +0200 |
---|---|---|
committer | Martin Možina <martin.mozina@fri.uni-lj.si> | 2016-10-25 11:44:09 +0200 |
commit | 0bfa95be7046b101a00f83f082260b5d0e007159 (patch) | |
tree | 3d40f550b1b4ac620ca16914cef62f7066d2ef12 /python/problems/recursion/distance | |
parent | f12796f00b36d143d8e2735cbec988cad3a3e9e3 (diff) |
Added new exercises with recursion.
Added description for functions.
Diffstat (limited to 'python/problems/recursion/distance')
-rw-r--r-- | python/problems/recursion/distance/common.py | 84 | ||||
-rw-r--r-- | python/problems/recursion/distance/en.py | 13 | ||||
-rw-r--r-- | python/problems/recursion/distance/sl.py | 31 |
3 files changed, 128 insertions, 0 deletions
diff --git a/python/problems/recursion/distance/common.py b/python/problems/recursion/distance/common.py new file mode 100644 index 0000000..f9a8c13 --- /dev/null +++ b/python/problems/recursion/distance/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, \ + all_tokens, has_comprehension, has_loop, almost_equal, get_ast +from server.hints import Hint + +id = 20811 +number = 11 +visible = True + +solution = '''\ +def distance(map, room1, room2): + if room1 not in map or room2 not in map: + return -1 + if room1 == room2: + return 0 + d1 = distance(map, map[room1][0], room2) + if d1 > -1: + return d1 + 1 + d2 = distance(map, map[room1][1], room2) + if d2 > -1: + return d2 + 1 + return -1 +''' + +hint_type = { + 'final_hint': Hint('final_hint') +} + +map = {0: [6, 3], 6: [5, 81], 3: [8, 24], 5: [2, 18], +81: [None, None], 8: [42, None], 24: [63, 13], 2: [7, 27], +18: [None, 35], 42: [None, 66], 63: [61, None], 13: [4, 12], +7: [None, None], 27: [None, None], 35: [None, None], 66: [None, None], +61: [None, None], 4: [None, None], 12: [None, None]} + +def test(python, code, aux_code=''): + func_name = 'distance' + 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 = [ + ((0, 42), 3), + ((0, 4), 4), + ((0, 5), 2), + ((0, 3), 1), + ((0, 0), 0), + ((42, 42), 0), + ((8, 66), 2), + ] + test_in = [('{}({}, {}, {})'.format(func_name, str(map), l[0][0], l[0][1]), None) + for l in in_out] + test_out = [l[1] for l in in_out] + + answers = python(code=aux_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, aux_code=''): + tokens = get_tokens(code) + + # run one test first to see if there are any exceptions + answer = python(code=aux_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/distance/en.py b/python/problems/recursion/distance/en.py new file mode 100644 index 0000000..316859b --- /dev/null +++ b/python/problems/recursion/distance/en.py @@ -0,0 +1,13 @@ +id = 20811 +name = 'Distance' + +description = '''\ +<p>(translation missing)</p>''' + +hint = { + 'plan': '''\ +<p>(translation missing)</p>''', + + 'no_input_call': '''\ +<p>(translation missing)</p>''', +} diff --git a/python/problems/recursion/distance/sl.py b/python/problems/recursion/distance/sl.py new file mode 100644 index 0000000..9cf9418 --- /dev/null +++ b/python/problems/recursion/distance/sl.py @@ -0,0 +1,31 @@ +import server +mod = server.problems.load_language('python', 'sl') + +id = 20811 +name = 'Razdalja' + +description = '''\ +<p> <img src="[%@resource map.png%]"> </p> +<p> +Nadaljujmo z meglenim gorovjem. Napiši funkcijo +<code>distance(map, start_room, ring_room)</code>, +ki prejme zemljevid, številko začetne sobe in številko sobe s prstanom, +kot rezultat pa vrne dolžino poti do nje. Če katerakoli od sob ne obstaja, +vrni <code>-1</code>. +Na gornjem zemljevidu je globina sobe 42 enaka 3. Zato:</p> +<pre> +>>> distance(map, 0, 42) +3 +>>> distance(map, 0, 43) +-1 +</pre> +''' + +plan = [] + +hint = { + 'final_hint': ['''\ +<p>Program je pravilen! <br> +</p> +'''] +} |