summaryrefslogtreecommitdiff
path: root/prolog/problems/sets/intersect_3
diff options
context:
space:
mode:
Diffstat (limited to 'prolog/problems/sets/intersect_3')
-rw-r--r--prolog/problems/sets/intersect_3/en.py4
-rw-r--r--prolog/problems/sets/intersect_3/sl.py4
2 files changed, 4 insertions, 4 deletions
diff --git a/prolog/problems/sets/intersect_3/en.py b/prolog/problems/sets/intersect_3/en.py
index fed5e34..fefc50a 100644
--- a/prolog/problems/sets/intersect_3/en.py
+++ b/prolog/problems/sets/intersect_3/en.py
@@ -6,8 +6,8 @@ slug = 'find the intersection of two sets'
description = '''\
<p><code>intersect(S1, S2, I)</code>: the list <code>I</code> contains every element that appears in both <code>S1</code> and <code>S2</code>, with no duplicates.</p>
<pre>
- ?- intersect([1,5,6,3,4,2], [8,1,5,9,4,3], I).
- I = [1,5,3,4].
+?- intersect([1,5,6,3,4,2], [8,1,5,9,4,3], I).
+ I = [1,5,3,4].
</pre>'''
hint = {}
diff --git a/prolog/problems/sets/intersect_3/sl.py b/prolog/problems/sets/intersect_3/sl.py
index a6af2d5..ac5501b 100644
--- a/prolog/problems/sets/intersect_3/sl.py
+++ b/prolog/problems/sets/intersect_3/sl.py
@@ -6,8 +6,8 @@ slug = 'Poišči presek dveh množic'
description = '''\
<p><code>intersect(S1, S2, I)</code>: seznam <code>I</code> vsebuje presek elementov v <code>S1</code> in <code>S2</code>.</p>
<pre>
- ?- intersect([1,5,6,3,4,2], [8,1,5,9,4,3], I).
- I = [1,5,3,4].
+?- intersect([1,5,6,3,4,2], [8,1,5,9,4,3], I).
+ I = [1,5,3,4].
</pre>'''
hint = {}