summaryrefslogtreecommitdiff
path: root/python/problems/for-fkkt/sum_to_n
diff options
context:
space:
mode:
authorMatevž Poberžnik <tevzpoberznik@gmail.com>2017-11-06 17:15:27 +0100
committerMatevž Poberžnik <tevzpoberznik@gmail.com>2017-11-06 17:15:27 +0100
commit73c22b77730970bcfa13eedec409c2477453dc5f (patch)
treec09c3e52fcff770916482df45ba41b88af820e37 /python/problems/for-fkkt/sum_to_n
parentd224a2d6a215264e6ca5854d07461311bda773c1 (diff)
FKKT: for loop group
Diffstat (limited to 'python/problems/for-fkkt/sum_to_n')
-rw-r--r--python/problems/for-fkkt/sum_to_n/common.py74
-rw-r--r--python/problems/for-fkkt/sum_to_n/sl.py31
2 files changed, 105 insertions, 0 deletions
diff --git a/python/problems/for-fkkt/sum_to_n/common.py b/python/problems/for-fkkt/sum_to_n/common.py
new file mode 100644
index 0000000..d61612e
--- /dev/null
+++ b/python/problems/for-fkkt/sum_to_n/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
+from server.hints import Hint
+
+id = 25017
+number = 5
+visible = True
+
+solution = '''\
+st = int(input("Vpiši število: "))
+vsota = 0
+for x in range(1, st + 1):
+ vsota += x
+print(vsota)
+'''
+
+hint_type = {
+ 'no_input_call' : Hint('no_input_call'),
+ 'printing': Hint('printing'),
+ 'final_hint': Hint('final_hint')
+}
+
+def test(python, code, aux_code=''):
+ tokens = get_tokens(code)
+
+ test_in = [
+ (None, '0\n'),
+ (None, '120\n'),
+ (None, '7\n')
+ ]
+ test_out = [
+ '0',
+ '7260',
+ '28'
+ ]
+
+ # List of outputs: (expression result, stdout, stderr, exception).
+ answers = python(code=aux_code+code, inputs=test_in, timeout=1.0)
+ outputs = [ans[1] for ans in answers]
+
+ n_correct = 0
+ tin = None
+ for i, (output, correct) in enumerate(zip(outputs, test_out)):
+ if output.rstrip().endswith(correct):
+ n_correct += 1
+ else:
+ tin = test_in[i][1]
+ tout = correct
+
+ passed = n_correct == len(test_in)
+ hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_in)}}]
+ if tin != None:
+ hints.append({'id': 'problematic_test_case', 'args': {'testin': str(tin), 'testout': str(tout)}})
+ else:
+ hints.append({'id' : 'final_hint'})
+ return passed, hints
+
+def hint(python, code, aux_code=''):
+ # run one test first to see if there are any exceptions
+ answer = python(code=aux_code+code, inputs=[(None, '12\n')], timeout=1.0)
+ exc = get_exception_desc(answer[0][3])
+ if exc: return exc
+
+ tokens = get_tokens(code)
+
+ if not has_token_sequence(tokens, ['input']):
+ return [{'id': 'no_input_call'}]
+
+ # student is not using print function
+ if not has_token_sequence(tokens, ['print']):
+ return [{'id' : 'printing'}]
+
+ return None
diff --git a/python/problems/for-fkkt/sum_to_n/sl.py b/python/problems/for-fkkt/sum_to_n/sl.py
new file mode 100644
index 0000000..c7c11de
--- /dev/null
+++ b/python/problems/for-fkkt/sum_to_n/sl.py
@@ -0,0 +1,31 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+
+name = 'Vsota n naravnih števil'
+slug = 'Vsota n naravnih števil'
+
+
+description = '''\
+<p>Napišite program, ki izračuna vsoto prvih <code>n</code> naravnih števil. Število <code>n</code> poda uporabnik. Če uporabnik vpiše <code>7</code>, mora program izpisati <code>28</code>, saj je <code>1 + 2 + 3 + 4 + 5 + 6 + 7 = 28</code>.
+<br>
+Primer uporabe:</p>
+
+<pre><code>Vpiši število: <span style="color: rgb(239, 69, 64);">7</span>
+28
+</code></pre>
+'''
+
+
+plan = []
+
+hint = {
+ 'no_input_call': '''<p>Za branje uporabi funkcijo <code>input</code></p>''',
+
+ 'printing': ['''\
+<p>Izpiši rezultat.</p>'''],
+
+ 'final_hint': ['''\
+<p>Program deluje pravilno!</p>'''],
+
+}