summaryrefslogtreecommitdiff
path: root/prolog/problems/clp_fd/gcd_3/en.py
diff options
context:
space:
mode:
Diffstat (limited to 'prolog/problems/clp_fd/gcd_3/en.py')
-rw-r--r--prolog/problems/clp_fd/gcd_3/en.py4
1 files changed, 2 insertions, 2 deletions
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 = {}