Added a new set of exercises (regular expressions).

3 files changed, 114 insertions, 0 deletions

diff --git a/python/problems/re/intnum/common.py b/python/problems/re/intnum/common.py
new file mode 100644
index 0000000..8e8a92e
--- /dev/null
+++ b/python/problems/re/intnum/common.py
@@ -0,0 +1,74 @@
+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 = 20903
+number = 3
+visible = True
+
+solution = '''\
+def num(s):
+    res = re.search('-?[0-9]+', s)
+    if not res:
+        return None
+    return int(res.group(0))
+'''
+
+hint_type = {
+    'final_hint': Hint('final_hint')
+}
+
+def test(python, code, aux_code=''):
+    func_name = 'num'
+    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 = [
+        ('abc', None),
+        ('1', 1),
+        ('111', 111),
+        ('12 1', 12),
+        ('5-112', 5),
+        ('m-221', -221),
+        ('Rač. 356', 356),
+        ('Ulica št. 15a', 15),
+        ('Višina 180, teža 76', 180),
+    ]
+
+    test_in = [('{0}("{1}")'.format(func_name, str(l[0])), 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/re/intnum/en.py b/python/problems/re/intnum/en.py
new file mode 100644
index 0000000..33e0bd1
--- /dev/null
+++ b/python/problems/re/intnum/en.py
@@ -0,0 +1,13 @@
+id = 20903
+name = 'Signed integer'
+
+description = '''\
+<p>(translation missing)</p>'''
+
+hint = {
+    'plan': '''\
+<p>(translation missing)</p>''',
+
+    'no_input_call': '''\
+<p>(translation missing)</p>''',
+}
diff --git a/python/problems/re/intnum/sl.py b/python/problems/re/intnum/sl.py
new file mode 100644
index 0000000..8e4d8a6
--- /dev/null
+++ b/python/problems/re/intnum/sl.py
@@ -0,0 +1,27 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+id = 20903
+name = 'Predznačeno celo število'
+
+description = '''\
+<p>
+Napišite funkcijo <code>num(s)</code>, ki vrne prvo celo predznačeno število 
+v nizu. Število naj bo tipa int. Če števila v nizu ni, naj funkcija vrne
+<code>None</code>.</p>
+<pre>
+>>> num('Večna pot 113')
+113
+>>> num('a-20=22')
+-20
+</pre>
+'''
+
+plan = []
+
+hint = {
+    'final_hint': ['''\
+<p>Program je pravilen! <br>
+</p>
+'''],
+}