summaryrefslogtreecommitdiff
path: root/prolog/problems/sets/union_3
diff options
context:
space:
mode:
Diffstat (limited to 'prolog/problems/sets/union_3')
-rw-r--r--prolog/problems/sets/union_3/en.py4
-rw-r--r--prolog/problems/sets/union_3/sl.py4
2 files changed, 4 insertions, 4 deletions
diff --git a/prolog/problems/sets/union_3/en.py b/prolog/problems/sets/union_3/en.py
index db6bbd9..3789e96 100644
--- a/prolog/problems/sets/union_3/en.py
+++ b/prolog/problems/sets/union_3/en.py
@@ -6,8 +6,8 @@ slug = 'find the union of two sets'
description = '''\
<p><code>union(S1, S2, U)</code>: the list <code>U</code> contains all elements of <code>S1</code> and <code>S2</code>, with no duplicates.</p>
<pre>
- ?- union([1,5,2,3], [3,4,8,2], U).
- U = [1,5,3,4,8,2].
+?- union([1,5,2,3], [3,4,8,2], U).
+ U = [1,5,3,4,8,2].
</pre>'''
hint = {}
diff --git a/prolog/problems/sets/union_3/sl.py b/prolog/problems/sets/union_3/sl.py
index 27d3088..9a19323 100644
--- a/prolog/problems/sets/union_3/sl.py
+++ b/prolog/problems/sets/union_3/sl.py
@@ -6,8 +6,8 @@ slug = 'Poišči unijo dveh množic'
description = '''\
<p><code>union(S1, S2, U)</code>: seznam <code>U</code> predstavlja unijo elementov v seznamih <code>S1</code> in <code>S2</code>, duplikatov (kot se za množice spodobi) ni.</p>
<pre>
- ?- union([1,5,2,3], [3,4,8,2], U).
- U = [1,5,3,4,8,2].
+?- union([1,5,2,3], [3,4,8,2], U).
+ U = [1,5,3,4,8,2].
</pre>'''
hint = {}