summaryrefslogtreecommitdiff
path: root/prolog/problems/lists/min_2
diff options
context:
space:
mode:
Diffstat (limited to 'prolog/problems/lists/min_2')
-rw-r--r--prolog/problems/lists/min_2/common.py53
-rw-r--r--prolog/problems/lists/min_2/en.py15
-rw-r--r--prolog/problems/lists/min_2/sl.py15
3 files changed, 0 insertions, 83 deletions
diff --git a/prolog/problems/lists/min_2/common.py b/prolog/problems/lists/min_2/common.py
deleted file mode 100644
index 213da5a..0000000
--- a/prolog/problems/lists/min_2/common.py
+++ /dev/null
@@ -1,53 +0,0 @@
-# coding=utf-8
-
-from operator import itemgetter
-import prolog.engine
-import server.problems
-
-id = 108
-number = 15
-visible = False
-facts = None
-
-solution = '''\
-min([X], X).
-min([H|T], Min):-
- min(T, Min1),
- ( H < Min1, Min is H
- ;
- H >= Min1, Min is Min1 ).
-'''
-
-test_cases = [
- ('min([15], X)',
- [{'X': '15'}]),
- ('min([22, 13, 81], X)',
- [{'X': '13'}]),
- ('min([42, 42, 42, 42], X)',
- [{'X': '42'}]),
- ('min([-22, 113, 1], 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/min_2/en.py b/prolog/problems/lists/min_2/en.py
deleted file mode 100644
index 18f45a6..0000000
--- a/prolog/problems/lists/min_2/en.py
+++ /dev/null
@@ -1,15 +0,0 @@
-# coding=utf-8
-
-name = 'min/2'
-slug = 'find the smallest element'
-
-description = '''\
-<p><code>min(L, Min)</code>: <code>Min</code> is the smallest value in the list <code>L</code>.</p>
-<pre>
-?- min([5,4,1,6], M).
- M = 1.
-?- min([3,2,2], M).
- M = 2.
-</pre>'''
-
-hint = {}
diff --git a/prolog/problems/lists/min_2/sl.py b/prolog/problems/lists/min_2/sl.py
deleted file mode 100644
index 703a05e..0000000
--- a/prolog/problems/lists/min_2/sl.py
+++ /dev/null
@@ -1,15 +0,0 @@
-# coding=utf-8
-
-name = 'min/2'
-slug = 'Poišči najmanjši element v danem seznamu'
-
-description = '''\
-<p><code>min(L, Min)</code>: <code>Min</code> je najmanjši element v seznamu <code>L</code>.</p>
-<pre>
-?- min([5,4,1,6], M).
- M = 1.
-?- min([3,2,2], M).
- M = 2.
-</pre>'''
-
-hint = {}