diff options
| author | Timotej Lazar <timotej.lazar@fri.uni-lj.si> | 2016-01-13 13:51:15 +0100 |
|---|---|---|
| committer | Timotej Lazar <timotej.lazar@fri.uni-lj.si> | 2016-01-13 13:51:15 +0100 |
| commit | 388b32039898cc8f1784378689007254eb7a33b6 (patch) | |
| tree | ac9e4c6145ad323dc5479179a04f44bbcea73eff /prolog/problems/clp_fd/gcd_3 | |
| parent | e36a8a2feca7552d236c0f6e89ac73e7e690e7b1 (diff) | |
Remove space-padding from <pre> blocks
Diffstat (limited to 'prolog/problems/clp_fd/gcd_3')
| -rw-r--r-- | prolog/problems/clp_fd/gcd_3/en.py | 4 | ||||
| -rw-r--r-- | prolog/problems/clp_fd/gcd_3/sl.py | 4 |
2 files changed, 4 insertions, 4 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 = {} 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 = {} |