From fc34673e84ea9bc823e8530c7564f0caa6a99000 Mon Sep 17 00:00:00 2001
From: =?UTF-8?q?Martin=20Mo=C5=BEina?= <martin.mozina@fri.uni-lj.si>
Date: Tue, 27 Sep 2016 16:38:23 +0200
Subject: Added exercises with list comprehensions.

---
 .../comprehensions/sumsquares_palindrome/common.py | 74 ++++++++++++++++++++++
 .../comprehensions/sumsquares_palindrome/en.py     | 13 ++++
 .../comprehensions/sumsquares_palindrome/sl.py     | 36 +++++++++++
 3 files changed, 123 insertions(+)
 create mode 100644 python/problems/comprehensions/sumsquares_palindrome/common.py
 create mode 100644 python/problems/comprehensions/sumsquares_palindrome/en.py
 create mode 100644 python/problems/comprehensions/sumsquares_palindrome/sl.py

(limited to 'python/problems/comprehensions/sumsquares_palindrome')

diff --git a/python/problems/comprehensions/sumsquares_palindrome/common.py b/python/problems/comprehensions/sumsquares_palindrome/common.py
new file mode 100644
index 0000000..9e66eb0
--- /dev/null
+++ b/python/problems/comprehensions/sumsquares_palindrome/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,\
+    get_ast, has_comprehension, has_loop
+
+from server.hints import Hint
+
+id = 20702
+number = 2
+visible = True
+
+solution = '''\
+def ss_palindrome(n):
+    return sum(i**2 for i in range(n) if str(i) == str(i)[::-1])
+'''
+
+hint_type = {
+    'final_hint': Hint('final_hint'),
+    'no_comprehension': Hint('no_comprehension'),
+    'has_loop': Hint('has_loop')
+}
+
+def test(python, code):
+    func_name = 'ss_palindrome'
+    tokens = get_tokens(code)
+    ast = get_ast(code)
+    if not has_token_sequence(tokens, ['def', func_name]):
+        return False, [{'id' : 'no_func_name', 'args' : {'func_name' : func_name}}]
+
+    in_out = [
+        (100, 34770),
+        (10, 285),
+        (1000, 33454620),
+        (1, 0)
+    ]
+
+    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=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 = ans[0] == 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:
+        if not has_comprehension(ast):
+            hints.append({'id': 'no_comprehension'})
+        elif has_loop(ast):
+            hints.append({'id': 'has_loop'})
+        else:
+            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/comprehensions/sumsquares_palindrome/en.py b/python/problems/comprehensions/sumsquares_palindrome/en.py
new file mode 100644
index 0000000..a4416d0
--- /dev/null
+++ b/python/problems/comprehensions/sumsquares_palindrome/en.py
@@ -0,0 +1,13 @@
+id = 20702
+name = 'Sum of squares of palindrome numbers'
+
+description = '''\
+<p>(translation missing)</p>'''
+
+hint = {
+    'plan': '''\
+<p>(translation missing)</p>''',
+
+    'no_input_call': '''\
+<p>(translation missing)</p>''',
+}
diff --git a/python/problems/comprehensions/sumsquares_palindrome/sl.py b/python/problems/comprehensions/sumsquares_palindrome/sl.py
new file mode 100644
index 0000000..bf855f5
--- /dev/null
+++ b/python/problems/comprehensions/sumsquares_palindrome/sl.py
@@ -0,0 +1,36 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+
+id = 20702
+name = 'Vsota kvadratov palindromskih števil'
+
+description = '''\
+<p>
+Napišite funkcijo <code>ss_palindrome(n)</code>, ki izračuna in vrne vsoto vseh
+palindromskih števil manjših do števila <code>n</code>. Če je <code>n=1000</code>,
+potem: </p>
+<p>1<sup>2</sup> + 2<sup>2</sup> + ... +
+323<sup>2</sup> + 333<sup>2</sup> + 343<sup>2</sup> + ... + 999<sup>2</sup> = ?</p>
+'''
+
+plan = []
+
+hint = {
+    'final_hint': ['''\
+<p>Program je pravilen! <br>
+</p>
+'''],
+
+    'no_comprehension': ['''\
+<p>Program je sicer pravilen, vendar ne vsebuje izpeljanih seznamov ali
+generatorjev...
+</p>
+'''],
+
+    'has_loop': ['''\
+<p>Program je sicer pravilen, vendar vsebuje zanko.
+</p>
+'''],
+
+}
-- 
cgit v1.2.1