Prolog: split lists exercises into two groups

3 files changed, 83 insertions, 0 deletions

diff --git a/prolog/problems/lists_advanced/max_2/common.py b/prolog/problems/lists_advanced/max_2/common.py
new file mode 100644
index 0000000..92cf793
--- /dev/null
+++ b/prolog/problems/lists_advanced/max_2/common.py
@@ -0,0 +1,53 @@
+# coding=utf-8
+
+from operator import itemgetter
+import prolog.engine
+import server.problems
+
+id = 109
+number = 16
+visible = False
+facts = None
+
+solution = '''\
+max([X], X).
+max([H|T], Max):-
+  max(T, Max1),
+  ( H > Max1, Max is H
+    ;
+    H =< Max1, Max is Max1 ).
+'''
+
+test_cases = [
+    ('max([15], X)',
+        [{'X': '15'}]),
+    ('max([22, 13, 81], X)',
+        [{'X': '81'}]),
+    ('max([42, 42, 42, 42], X)',
+        [{'X': '42'}]),
+    ('max([-22, -113, -41], X)',
+        [{'X': '-22'}]),
+]
+
+def test(code, aux_code):
+    n_correct = 0
+    engine_id = None
+    try:
+        engine_id, output = prolog.engine.create(code=code+aux_code, timeout=1.0)
+        if engine_id is not None and 'error' not in map(itemgetter(0), output):
+            # Engine successfully created, and no syntax error in program.
+            for query, answers in test_cases:
+                if prolog.engine.check_answers(engine_id, query=query, answers=answers, timeout=1.0):
+                    n_correct += 1
+    except socket.timeout:
+        pass
+    finally:
+        if engine_id:
+            prolog.engine.destroy(engine_id)
+
+    hints = [{'id': 'test_results', 'args': {'passed': n_correct, 'total': len(test_cases)}}]
+    return n_correct, len(test_cases), hints
+
+def hint(code, aux_code):
+    # TODO
+    return []
diff --git a/prolog/problems/lists_advanced/max_2/en.py b/prolog/problems/lists_advanced/max_2/en.py
new file mode 100644
index 0000000..c4bc7e2
--- /dev/null
+++ b/prolog/problems/lists_advanced/max_2/en.py
@@ -0,0 +1,15 @@
+# coding=utf-8
+
+name = 'max/2'
+slug = 'find the largest element in list'
+
+description = '''\
+<p><code>max(L, Max)</code>: <code>Max</code> is the largest value in the list <code>L</code>.</p>
+<pre>
+?- max([5,4,1,6], M).
+  M = 6.
+?- max([3,2,2], M).
+  M = 3.
+</pre>'''
+
+hint = {}
diff --git a/prolog/problems/lists_advanced/max_2/sl.py b/prolog/problems/lists_advanced/max_2/sl.py
new file mode 100644
index 0000000..7a0d07a
--- /dev/null
+++ b/prolog/problems/lists_advanced/max_2/sl.py
@@ -0,0 +1,15 @@
+# coding=utf-8
+
+name = 'max/2'
+slug = 'Poišči največji element v danem seznamu'
+
+description = '''\
+<p><code>max(L, Max)</code>: <code>Max</code> je največji element v seznamu <code>L</code>.</p>
+<pre>
+?- max([5,4,1,6], M).
+  M = 6.
+?- max([3,2,2], M).
+  M = 3.
+</pre>'''
+
+hint = {}