2 files changed, 117 insertions, 0 deletions
diff --git a/python/problems/for-fkkt/all_primes/common.py b/python/problems/for-fkkt/all_primes/common.py
new file mode 100644
index 0000000..3c121d8
--- /dev/null
+++ b/python/problems/for-fkkt/all_primes/common.py
@@ -0,0 +1,83 @@
+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 = 25021
+number = 9
+visible = True
+
+solution = '''\
+n = int(input("Vpiši število: "))
+stevec = 0
+for i in range(2, n + 1):
+    prastevilo = True
+    for j in range(2, int(i**(1/2))+1):
+        if i % j == 0:
+            prastevilo = False
+            break
+    if prastevilo:
+        stevec += 1
+print(stevec)
+
+'''
+
+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, '2\n'),
+        (None, '3\n'),
+        (None, '7\n'),
+        (None, '12\n')
+    ]
+    test_out = [
+        '0',
+        '1',
+        '3',
+        '5'
+    ]
+
+    # 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, '2\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/all_primes/sl.py b/python/problems/for-fkkt/all_primes/sl.py
new file mode 100644
index 0000000..b86dbae
--- /dev/null
+++ b/python/problems/for-fkkt/all_primes/sl.py
@@ -0,0 +1,34 @@
+import server
+mod = server.problems.load_language('python', 'sl')
+
+
+name = 'Praštevila'
+slug = 'Praštevila'
+
+
+description = '''\
+<p>Napišite program, ki izpiše, koliko praštevil je manjših od števila n.
+<br>
+Primer uporabe:</p>
+
+<pre><code>Vpiši število: <span style="color: rgb(239, 69, 64);">12</span>
+5
+</code></pre>
+
+
+<p>Če si bo program za število 50000 vzel preveč časa (beri: se ne bo izvedel dovolj hitro), poskusi optimizirati rešitev. Za še večja števila (npr. 1000000) se pa poskusi poigrati z <a href="https://sl.wikipedia.org/wiki/Eratostenovo_sito">Eratostenovim sitom</a>.</p>
+'''
+
+
+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>'''],
+
+}