Remove space-padding from <pre> blocks

12 files changed, 32 insertions, 32 deletions

diff --git a/prolog/problems/sorting/is_sorted_1/en.py b/prolog/problems/sorting/is_sorted_1/en.py
index 3ea6572..9848df1 100644
--- a/prolog/problems/sorting/is_sorted_1/en.py
+++ b/prolog/problems/sorting/is_sorted_1/en.py
@@ -6,10 +6,10 @@ slug = 'check if list is sorted'
 description = '''\
 <p><code>is_sorted(L)</code>: the elements of list <code>L</code> are sorted in non-decreasing order.</p>
 <pre>
-  ?- is_sorted([2,3,6,8,12]).
-    true.
-  ?- is_sorted([2,3,1,6,5]).
-    false.
+?- is_sorted([2,3,6,8,12]).
+  true.
+?- is_sorted([2,3,1,6,5]).
+  false.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sorting/is_sorted_1/sl.py b/prolog/problems/sorting/is_sorted_1/sl.py
index 5d4c1c5..a1429d3 100644
--- a/prolog/problems/sorting/is_sorted_1/sl.py
+++ b/prolog/problems/sorting/is_sorted_1/sl.py
@@ -6,10 +6,10 @@ slug = 'Preveri, če so elementi seznama naraščajoče urejeni'
 description = '''\
 <p><code>is_sorted(L)</code>: elementi v seznamu <code>L</code> morajo biti urejeni v naraščajočem vrstnem redu.</p>
 <pre>
-  ?- is_sorted([2,3,6,8,12]).
-    true.
-  ?- is_sorted([2,3,1,6,5]).
-    false.
+?- is_sorted([2,3,6,8,12]).
+  true.
+?- is_sorted([2,3,1,6,5]).
+  false.
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sorting/isort_2/en.py b/prolog/problems/sorting/isort_2/en.py
index 9fba6ac..0998a6d 100644
--- a/prolog/problems/sorting/isort_2/en.py
+++ b/prolog/problems/sorting/isort_2/en.py
@@ -6,8 +6,8 @@ slug = 'sort a list using insertion sort'
 description = '''\
 <p><code>isort(L, SL)</code>: the list <code>SL</code> contains the elements of <code>L</code> sorted in non-decreasing order. Use the predicate <code>sins/3</code> to implement insertion sort.</p>
 <pre>
-  ?- isort([2,3,1,5,4], L).
-    L = [1,2,3,4,5].
+?- isort([2,3,1,5,4], L).
+  L = [1,2,3,4,5].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sorting/isort_2/sl.py b/prolog/problems/sorting/isort_2/sl.py
index 79c3239..63459c4 100644
--- a/prolog/problems/sorting/isort_2/sl.py
+++ b/prolog/problems/sorting/isort_2/sl.py
@@ -6,8 +6,8 @@ slug = 'Uredi seznam z uporabo urejanja z vstavljanjem'
 description = '''\
 <p><code>isort(L, SL)</code>: seznam <code>SL</code> vsebuje elemente iz seznama <code>L</code> urejene v naraščajočem vrstnem redu. Uporabi predikat <code>sins/3</code> za implementacijo urejanja z vstavljanjem.</p>
 <pre>
-  ?- isort([2,3,1,5,4], L).
-    L = [1,2,3,4,5].
+?- isort([2,3,1,5,4], L).
+  L = [1,2,3,4,5].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sorting/pivoting_4/en.py b/prolog/problems/sorting/pivoting_4/en.py
index 43e4ae3..82976ba 100644
--- a/prolog/problems/sorting/pivoting_4/en.py
+++ b/prolog/problems/sorting/pivoting_4/en.py
@@ -6,8 +6,8 @@ slug = 'split a list according to the pivot'
 description = '''\
 <p><code>pivoting(P, L, S, G)</code>: the list <code>S</code> contains the elements of <code>L</code> <em>smaller or equal to</em> <code>P</code>, and the list <code>G</code> contains the elements of <code>L</code> <em>greater than</em> <code>P</code>. The order of elements in <code>S</code> and <code>G</code> should be the same as in <code>L</code>.</p>
 <pre>
-  ?- pivoting(4, [1,4,5,8,6,4,2], S, G).
-    S = [1,4,4,2], G = [5,8,6].
+?- pivoting(4, [1,4,5,8,6,4,2], S, G).
+  S = [1,4,4,2], G = [5,8,6].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sorting/pivoting_4/sl.py b/prolog/problems/sorting/pivoting_4/sl.py
index b18e112..e1aeb7a 100644
--- a/prolog/problems/sorting/pivoting_4/sl.py
+++ b/prolog/problems/sorting/pivoting_4/sl.py
@@ -6,8 +6,8 @@ slug = 'Razdeli seznam na dva dela glede na podani element (pivot)'
 description = '''\
 <p><code>pivoting(P, L, S, G)</code>: seznam <code>S</code> vsebuje elemente iz <code>L</code> <em>manjše ali enake</em> <code>P</code>, seznam <code>G</code> pa elemente iz <code>L</code> <em>večje od</em> <code>P</code>. Vrstni red elementov v <code>S</code> in <code>G</code> naj bo enak kot v <code>L</code>.</p>
 <pre>
-  ?- pivoting(4, [1,4,5,8,6,4,2], S, G).
-    S = [1,4,4,2], G = [5,8,6].
+?- pivoting(4, [1,4,5,8,6,4,2], S, G).
+  S = [1,4,4,2], G = [5,8,6].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sorting/quick_sort_2/en.py b/prolog/problems/sorting/quick_sort_2/en.py
index faf6d41..3457440 100644
--- a/prolog/problems/sorting/quick_sort_2/en.py
+++ b/prolog/problems/sorting/quick_sort_2/en.py
@@ -6,8 +6,8 @@ slug = 'sort a list using quicksort'
 description = '''\
 <p><code>quick_sort(L, SL)</code>: the list <code>SL</code> contains the elements of <code>L</code> sorted in non-decreasing order. Use the predicate <code>pivoting/4</code> to implement quicksort.</p>
 <pre>
-  ?- quick_sort([2,3,1,5,4], L).
-    L = [1,2,3,4,5].
+?- quick_sort([2,3,1,5,4], L).
+  L = [1,2,3,4,5].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sorting/quick_sort_2/sl.py b/prolog/problems/sorting/quick_sort_2/sl.py
index 9611b46..8b6ad94 100644
--- a/prolog/problems/sorting/quick_sort_2/sl.py
+++ b/prolog/problems/sorting/quick_sort_2/sl.py
@@ -6,8 +6,8 @@ slug = 'Uredi seznam z algoritmom quicksort'
 description = '''\
 <p><code>quick_sort(L, SL)</code>: seznam <code>SL</code> vsebuje elemente iz <code>L</code> urejene v naraščajočem vrstnem redu. Uporabi predikat <code>pivoting/4</code> za implementacijo algoritma quicksort.</p>
 <pre>
-  ?- quick_sort([2,3,1,5,4], L).
-    L = [1,2,3,4,5].
+?- quick_sort([2,3,1,5,4], L).
+  L = [1,2,3,4,5].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sorting/sins_3/en.py b/prolog/problems/sorting/sins_3/en.py
index 2d9cf98..db35da2 100644
--- a/prolog/problems/sorting/sins_3/en.py
+++ b/prolog/problems/sorting/sins_3/en.py
@@ -6,10 +6,10 @@ slug = 'insert an element at correct position into a sorted list'
 description = '''\
 <p><code>sins(X, SortedList, NewList)</code>: the list <code>NewList</code> is obtained by inserting <code>X</code> into <code>SortedList</code> at the correct position to preserve the non-decreasing order of elements.</p>
 <pre>
-  ?- sins(4, [1,2,3,5], L).
-    L = [1,2,3,4,5].
-  ?- sins(3, [1,2,3,4], L).
-    L = [1,2,3,3,4].
+?- sins(4, [1,2,3,5], L).
+  L = [1,2,3,4,5].
+?- sins(3, [1,2,3,4], L).
+  L = [1,2,3,3,4].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sorting/sins_3/sl.py b/prolog/problems/sorting/sins_3/sl.py
index 22e51b2..fe7d015 100644
--- a/prolog/problems/sorting/sins_3/sl.py
+++ b/prolog/problems/sorting/sins_3/sl.py
@@ -6,10 +6,10 @@ slug = 'Vstavi element na ustrezno mesto v urejen seznam'
 description = '''\
 <p><code>sins(X, SortedList, NewList)</code>: seznam <code>NewList</code> dobiš tako, da vstaviš element <code>X</code> v <code>SortedList</code> na ustrezno mesto tako, da ohraniš urejenost elementov.</p>
 <pre>
-  ?- sins(4, [1,2,3,5], L).
-    L = [1,2,3,4,5].
-  ?- sins(3, [1,2,3,4], L).
-    L = [1,2,3,3,4].
+?- sins(4, [1,2,3,5], L).
+  L = [1,2,3,4,5].
+?- sins(3, [1,2,3,4], L).
+  L = [1,2,3,3,4].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sorting/slowest_sort_ever_2/en.py b/prolog/problems/sorting/slowest_sort_ever_2/en.py
index e327102..689060c 100644
--- a/prolog/problems/sorting/slowest_sort_ever_2/en.py
+++ b/prolog/problems/sorting/slowest_sort_ever_2/en.py
@@ -6,8 +6,8 @@ slug = 'sort a list by randomly permuting elements'
 description = '''\
 <p><code>slowest_sort_ever(L, SL)</code>: the list <code>SL</code> contains the elements of <code>L</code> sorted in non-decreasing order. Average and worst case running time is O(n * n!).</p>
 <pre>
-  ?- slowest_sort_ever([2,3,1,5,4], L).
-    L = [1,2,3,4,5].
+?- slowest_sort_ever([2,3,1,5,4], L).
+  L = [1,2,3,4,5].
 </pre>'''
 
 hint = {}
diff --git a/prolog/problems/sorting/slowest_sort_ever_2/sl.py b/prolog/problems/sorting/slowest_sort_ever_2/sl.py
index c62582c..d6cf66b 100644
--- a/prolog/problems/sorting/slowest_sort_ever_2/sl.py
+++ b/prolog/problems/sorting/slowest_sort_ever_2/sl.py
@@ -6,8 +6,8 @@ slug = 'Uredi seznam elementov s pomočjo naključnih permutacij'
 description = '''\
 <p><code>slowest_sort_ever(L, SL)</code>: seznam <code>SL</code> vsebuje elemente seznama <code>L</code> v naraščajočem vrstnem redu. Časovna zahtevnost algoritma naj bo O(n * n!).</p>
 <pre>
-  ?- slowest_sort_ever([2,3,1,5,4], L).
-    L = [1,2,3,4,5].
+?- slowest_sort_ever([2,3,1,5,4], L).
+  L = [1,2,3,4,5].
 </pre>'''
 
 hint = {}