4 files changed, 145 insertions, 0 deletions
diff --git a/python/problems/recursion/where_to/common.py b/python/problems/recursion/where_to/common.py
new file mode 100644
index 0000000..55a9aed
--- /dev/null
+++ b/python/problems/recursion/where_to/common.py
@@ -0,0 +1,77 @@
+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 = 20810
+number = 10
+visible = True
+
+solution = '''\
+def where_to(map, room, path):
+    if path:
+        return where_to(map, map[room][path[0] == "R"], path[1:])
+    else:
+        return room
+'''
+
+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 = 'where_to'
+    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, "LLR"), 18),
+        ((0, "RRRR"), 12),
+        ((0, "L"), 6),
+        ((0, ""), 0),
+        ((0, "RLL"), 42),
+        ((0, "RRLL"), 61),
+        ((0, "LLLL"), 7),
+    ]
+    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/where_to/en.py b/python/problems/recursion/where_to/en.py
new file mode 100644
index 0000000..df43164
--- /dev/null
+++ b/python/problems/recursion/where_to/en.py
@@ -0,0 +1,13 @@
+id = 20810
+name = 'Where to'
+
+description = '''\
+<p>(translation missing)</p>'''
+
+hint = {
+    'plan': '''\
+<p>(translation missing)</p>''',
+
+    'no_input_call': '''\
+<p>(translation missing)</p>''',
+}
diff --git a/python/problems/recursion/where_to/map.png b/python/problems/recursion/where_to/map.png
new file mode 100644
index 0000000..014d78e
--- /dev/null
+++ b/python/problems/recursion/where_to/map.png
diff --git a/python/problems/recursion/where_to/sl.py b/python/problems/recursion/where_to/sl.py
new file mode 100644
index 0000000..365d7cd
--- /dev/null
+++ b/python/problems/recursion/where_to/sl.py
@@ -0,0 +1,55 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+id = 20810
+name = 'Kam?'
+
+description = '''\
+<p>
+od Meglenim gorovjem je, kot nekateri vedo že dolgo,
+nekateri pa so morali čakati na film, cel labirint votlin.
+Bilbu bi bilo veliko lažje, če bi imel zemljevid. Mi ga imamo.
+
+Zemljevid lahko shranimo tudi v obliki slovarja,
+v katerem so ključi številke sob, vrednosti pa sobe,
+v katere pridemo po levi in po desni poti.
+Kadar kakšne poti ni, je ustrezni element enak None.</p>
+
+<img src="[%@resource map.png%]">
+
+<pre>
+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]}</pre>
+
+<p>Napiši funkcijo <code>where_to(map, room, path)</code>,
+ki kot argument prejme zemljevid (npr. zgornji slovar),
+začetno sobo (ta bo vedno 0, a to naj te ne moti) in pot (<code>path</code>),
+podano kot zaporedje znakov <code>L</code> in <code>R</code> (levo in desno).
+Kot rezultat mora vrniti sobo, v katero pelje podana pot.</p>
+
+<pre>
+>>> where_to(map, 0, "LLR")
+18
+>>> where_to(map, 0, "RRRR")
+12
+>>> where_to(map, 0, "L")
+6
+>>> where_to(map, 0, "")
+0
+</pre>
+
+<p> Predpostaviti smeš, da je pot pravilna in se nikoli ne odpravi v hodnik,
+ki ga ni.</p>
+'''
+
+plan = []
+
+hint = {
+    'final_hint': ['''\
+<p>Program je pravilen! <br>
+</p>
+''']
+}