summaryrefslogtreecommitdiff
path: root/prolog/problems/lists/rev_2
diff options
context:
space:
mode:
Diffstat (limited to 'prolog/problems/lists/rev_2')
-rw-r--r--prolog/problems/lists/rev_2/en.py8
-rw-r--r--prolog/problems/lists/rev_2/sl.py8
2 files changed, 8 insertions, 8 deletions
diff --git a/prolog/problems/lists/rev_2/en.py b/prolog/problems/lists/rev_2/en.py
index 7941f9e..3ae126e 100644
--- a/prolog/problems/lists/rev_2/en.py
+++ b/prolog/problems/lists/rev_2/en.py
@@ -6,10 +6,10 @@ slug = 'reverse a list'
description = '''\
<p><code>rev(L1, L2)</code>: the list <code>L2</code> is obtained from <code>L1</code> by reversing the order of the elements.</p>
<pre>
- ?- rev([1,2,3], X).
- X = [3,2,1].
- ?- rev([], X).
- X = [].
+?- rev([1,2,3], X).
+ X = [3,2,1].
+?- rev([], X).
+ X = [].
</pre>'''
hint = {}
diff --git a/prolog/problems/lists/rev_2/sl.py b/prolog/problems/lists/rev_2/sl.py
index 95ba8b7..ab58a1c 100644
--- a/prolog/problems/lists/rev_2/sl.py
+++ b/prolog/problems/lists/rev_2/sl.py
@@ -6,10 +6,10 @@ slug = 'Obrni seznam'
description = '''\
<p><code>rev(L1, L2)</code>: seznam <code>L2</code> ima elemente v obratnem vrstnem redu kot seznam <code>L1</code>.</p>
<pre>
- ?- rev([1,2,3], X).
- X = [3,2,1].
- ?- rev([], X).
- X = [].
+?- rev([1,2,3], X).
+ X = [3,2,1].
+?- rev([], X).
+ X = [].
</pre>'''
hint = {}