summaryrefslogtreecommitdiff
path: root/prolog/problems/clp_r
diff options
context:
space:
mode:
authorTimotej Lazar <timotej.lazar@fri.uni-lj.si>2016-01-13 13:51:15 +0100
committerTimotej Lazar <timotej.lazar@fri.uni-lj.si>2016-01-13 13:51:15 +0100
commit388b32039898cc8f1784378689007254eb7a33b6 (patch)
treeac9e4c6145ad323dc5479179a04f44bbcea73eff /prolog/problems/clp_r
parente36a8a2feca7552d236c0f6e89ac73e7e690e7b1 (diff)
Remove space-padding from <pre> blocks
Diffstat (limited to 'prolog/problems/clp_r')
-rw-r--r--prolog/problems/clp_r/bounding_box_3/en.py4
-rw-r--r--prolog/problems/clp_r/center_3/en.py6
-rw-r--r--prolog/problems/clp_r/max_sum_2/en.py8
-rw-r--r--prolog/problems/clp_r/megabytes_2/en.py8
4 files changed, 13 insertions, 13 deletions
diff --git a/prolog/problems/clp_r/bounding_box_3/en.py b/prolog/problems/clp_r/bounding_box_3/en.py
index 8c6a9f7..efb7a55 100644
--- a/prolog/problems/clp_r/bounding_box_3/en.py
+++ b/prolog/problems/clp_r/bounding_box_3/en.py
@@ -6,8 +6,8 @@ slug = 'find the smallest bounding box'
description = '''\
<p><code>bounding_box(Points, X1/Y1, X2/Y2)</code>: <code>X1/Y1</code> and <code>X2/Y2</code> are the bottom-left and top-right points defining the smallest bounding box containing all points in the list <code>Points</code>.
<pre>
- ?- bounding_box([4.5/2.3, 3.6/1.2, 6.7/0.1], X1/Y1, X2/Y2).
- X1 = 3.6, Y1 = 0.1, X2 = 6.7, Y2 = 2.3.
+?- bounding_box([4.5/2.3, 3.6/1.2, 6.7/0.1], X1/Y1, X2/Y2).
+ X1 = 3.6, Y1 = 0.1, X2 = 6.7, Y2 = 2.3.
</pre>'''
hint = {}
diff --git a/prolog/problems/clp_r/center_3/en.py b/prolog/problems/clp_r/center_3/en.py
index ae5aeb8..e6ca645 100644
--- a/prolog/problems/clp_r/center_3/en.py
+++ b/prolog/problems/clp_r/center_3/en.py
@@ -6,9 +6,9 @@ slug = 'find central points'
description = '''\
<p><code>center(Points, R, X/Y)</code>: <code>X/Y</code> is a point in the list <code>Points</code> that is at most <code>R</code> away from all other points.</p>
<pre>
- ?- center([1.0/1.1, 2.0/2.1, 3.0/3.1, 4.0/4.1], 4.0, X/Y).
- X = 2.0, Y = 2.1 ;
- X = 3.0, Y = 3.1.
+?- center([1.0/1.1, 2.0/2.1, 3.0/3.1, 4.0/4.1], 4.0, X/Y).
+ X = 2.0, Y = 2.1 ;
+ X = 3.0, Y = 3.1.
</pre>'''
hint = {}
diff --git a/prolog/problems/clp_r/max_sum_2/en.py b/prolog/problems/clp_r/max_sum_2/en.py
index eeff4cd..269f8b3 100644
--- a/prolog/problems/clp_r/max_sum_2/en.py
+++ b/prolog/problems/clp_r/max_sum_2/en.py
@@ -6,10 +6,10 @@ slug = 'find maximal adjacent elements'
description = '''\
<p><code>max_sum(List, Max)</code>: <code>Max</code> is the maximal sum of two adjacent elements in <code>List</code>.</p>
<pre>
- ?- max_sum([4.5, 3.6, 1.2, 6.7], Max).
- Max = 8.1.
- ?- max_sum([1.1, 1.2, -12.3, 8.8], Max).
- Max = 2.3.
+?- max_sum([4.5, 3.6, 1.2, 6.7], Max).
+ Max = 8.1.
+?- max_sum([1.1, 1.2, -12.3, 8.8], Max).
+ Max = 2.3.
</pre>'''
hint = {}
diff --git a/prolog/problems/clp_r/megabytes_2/en.py b/prolog/problems/clp_r/megabytes_2/en.py
index 01fdfff..27919dc 100644
--- a/prolog/problems/clp_r/megabytes_2/en.py
+++ b/prolog/problems/clp_r/megabytes_2/en.py
@@ -6,10 +6,10 @@ slug = 'convert mebibytes to megabytes'
description = '''\
<p>A <em>mega</em>byte is the SI unit meaning 10<sup>6</sup> bytes, while a <em>mebi</em>byte is the IEC unit meaning 2<sup>20</sup> bytes. Write the predicate <code>megabytes(SI, IEC)</code> that converts between the two using constraints.</p>
<pre>
- ?- megabytes(2, IEC).
- IEC = 1.9073486328125.
- ?- megabytes(SI, 2).
- SI = 2.097152.
+?- megabytes(2, IEC).
+ IEC = 1.9073486328125.
+?- megabytes(SI, 2).
+ SI = 2.097152.
</pre>'''
hint = {}