summaryrefslogtreecommitdiff
path: root/prolog/problems/lists/min_2
diff options
context:
space:
mode:
authorAleš Smodiš <aless@guru.si>2015-08-18 16:06:19 +0200
committerAleš Smodiš <aless@guru.si>2015-08-18 16:06:19 +0200
commit95e2fe57f6e4639f6ae9f1fef368829d5090dbf6 (patch)
tree462ba05eb0c4732ca1c97739548801258bf47b40 /prolog/problems/lists/min_2
Exported all problems from the SQLite database into the new directory structure.
Diffstat (limited to 'prolog/problems/lists/min_2')
-rw-r--r--prolog/problems/lists/min_2/common.py14
-rw-r--r--prolog/problems/lists/min_2/en.py14
2 files changed, 28 insertions, 0 deletions
diff --git a/prolog/problems/lists/min_2/common.py b/prolog/problems/lists/min_2/common.py
new file mode 100644
index 0000000..7e9a0bc
--- /dev/null
+++ b/prolog/problems/lists/min_2/common.py
@@ -0,0 +1,14 @@
+id = 108
+group = 'lists'
+number = 15
+visible = True
+facts = None
+
+solution = '''\
+min([X], X).
+min([H|T], Min):-
+ min(T, Min1),
+ ( H < Min1, Min is H
+ ;
+ H >= Min1, Min is Min1 ).
+'''
diff --git a/prolog/problems/lists/min_2/en.py b/prolog/problems/lists/min_2/en.py
new file mode 100644
index 0000000..a0a8e74
--- /dev/null
+++ b/prolog/problems/lists/min_2/en.py
@@ -0,0 +1,14 @@
+id = 108
+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 = {}