From 388b32039898cc8f1784378689007254eb7a33b6 Mon Sep 17 00:00:00 2001
From: Timotej Lazar <timotej.lazar@fri.uni-lj.si>
Date: Wed, 13 Jan 2016 13:51:15 +0100
Subject: Remove space-padding from <pre> blocks

---
 prolog/problems/sets/union_3/en.py | 4 ++--
 prolog/problems/sets/union_3/sl.py | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

(limited to 'prolog/problems/sets/union_3')

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 = {}
-- 
cgit v1.2.1