summaryrefslogtreecommitdiff
path: root/prolog
diff options
context:
space:
mode:
authorAleksander Sadikov <aleksander.sadikov@fri.uni-lj.si>2016-03-14 14:50:07 +0100
committerAleksander Sadikov <aleksander.sadikov@fri.uni-lj.si>2016-03-14 14:50:07 +0100
commit4e4623577e05d8394c6840cff6b83d2c4159c29d (patch)
tree65a9c8f29d37bc706cdec249aee40ffebeee223d /prolog
parent217172b1f73f487f785a742709cd2df264bc9c83 (diff)
Plans for divide/3 added.
Diffstat (limited to 'prolog')
-rw-r--r--prolog/problems/lists/divide_3/sl.py2
1 files changed, 1 insertions, 1 deletions
diff --git a/prolog/problems/lists/divide_3/sl.py b/prolog/problems/lists/divide_3/sl.py
index e9ef210..23340cc 100644
--- a/prolog/problems/lists/divide_3/sl.py
+++ b/prolog/problems/lists/divide_3/sl.py
@@ -4,7 +4,7 @@ name = 'divide/3'
slug = 'Razdeli dani seznam na dva podseznama (približno) enake velikosti'
description = '''\
-<p><code>divide(L, L1, L2)</code>: seznam <code>L1</code> vsebuje elemente na lihih pozicijah v seznamu <code>L</code>, seznam <code>L2</code> pa elemente na sodih pozicijah v <code>L</code>.</p>
+<p><code>divide(L, L1, L2)</code>: seznam <code>L1</code> vsebuje elemente na lihih pozicijah v seznamu <code>L</code>, seznam <code>L2</code> pa elemente na sodih pozicijah v <code>L</code>. Rešuj brez uporabe aritmetike.</p>
<pre>
?- divide([a,b,c,d,e,f,g], X, Y).
X = [a,c,e,g], Y = [b,d,f].