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/clp_fd/gcd_3/en.py | 4 ++--
 prolog/problems/clp_fd/gcd_3/sl.py | 4 ++--
 2 files changed, 4 insertions(+), 4 deletions(-)

(limited to 'prolog/problems/clp_fd/gcd_3')

diff --git a/prolog/problems/clp_fd/gcd_3/en.py b/prolog/problems/clp_fd/gcd_3/en.py
index 7953eb1..8891d54 100644
--- a/prolog/problems/clp_fd/gcd_3/en.py
+++ b/prolog/problems/clp_fd/gcd_3/en.py
@@ -7,8 +7,8 @@ description = '''\
 <p><code>gcd(X, Y, GCD)</code>: <code>GCD</code> is the greatest common divisor of <code>X</code> and <code>Y</code>. Implement this predicate using constraints.</p>
 <p>Hint: try writing a predicate to find <em>all</em> common divisors of two numbers first.</p>
 <pre>
-  ?- gcd(36, 84, GCD).
-    GCD = 12.
+?- gcd(36, 84, GCD).
+  GCD = 12.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/clp_fd/gcd_3/sl.py b/prolog/problems/clp_fd/gcd_3/sl.py
index 9ef1a87..f5016fa 100644
--- a/prolog/problems/clp_fd/gcd_3/sl.py
+++ b/prolog/problems/clp_fd/gcd_3/sl.py
@@ -7,8 +7,8 @@ description = '''\
 <p><code>gcd(X, Y, GCD)</code>: <code>GCD</code> je največji skupni delitelj števil <code>X</code> in <code>Y</code>. Implementiraj ta predikat z uporabo omejitev.</p>
 <p>Namig: poskusi najprej napisati predikat, ki poišče <em>vse</em> skupne delitelje dveh števil.</p>
 <pre>
-  ?- gcd(36, 84, GCD).
-    GCD = 12.
+?- gcd(36, 84, GCD).
+  GCD = 12.
 </pre>'''
 
 hint = {}
-- 
cgit v1.2.1