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/sets/intersect_3/en.py | |
| parent | e36a8a2feca7552d236c0f6e89ac73e7e690e7b1 (diff) | |
Remove space-padding from <pre> blocks
Diffstat (limited to 'prolog/problems/sets/intersect_3/en.py')
| -rw-r--r-- | prolog/problems/sets/intersect_3/en.py | 4 |
1 files changed, 2 insertions, 2 deletions
diff --git a/prolog/problems/sets/intersect_3/en.py b/prolog/problems/sets/intersect_3/en.py index fed5e34..fefc50a 100644 --- a/prolog/problems/sets/intersect_3/en.py +++ b/prolog/problems/sets/intersect_3/en.py @@ -6,8 +6,8 @@ slug = 'find the intersection of two sets' description = '''\ <p><code>intersect(S1, S2, I)</code>: the list <code>I</code> contains every element that appears in both <code>S1</code> and <code>S2</code>, with no duplicates.</p> <pre> - ?- intersect([1,5,6,3,4,2], [8,1,5,9,4,3], I). - I = [1,5,3,4]. +?- intersect([1,5,6,3,4,2], [8,1,5,9,4,3], I). + I = [1,5,3,4]. </pre>''' hint = {} |