diff options
| author | Aleksander Sadikov <aleksander.sadikov@fri.uni-lj.si> | 2016-09-09 00:50:01 +0200 |
|---|---|---|
| committer | Aleksander Sadikov <aleksander.sadikov@fri.uni-lj.si> | 2016-09-09 00:50:01 +0200 |
| commit | 028ee21ff18c68f662a7dbf53ada4d22d486eb0f (patch) | |
| tree | 52dda3b20eb19f76963feba0d51c9aee901b0005 /prolog/problems/lists_advanced/palindrome_1 | |
| parent | d2264c60a2382d0aa00ec4cf8cc5d794213e2a2a (diff) | |
English translation for sublist/2 added.
Diffstat (limited to 'prolog/problems/lists_advanced/palindrome_1')
| -rw-r--r-- | prolog/problems/lists_advanced/palindrome_1/en.py | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/prolog/problems/lists_advanced/palindrome_1/en.py b/prolog/problems/lists_advanced/palindrome_1/en.py index 27103d3..8471ae2 100644 --- a/prolog/problems/lists_advanced/palindrome_1/en.py +++ b/prolog/problems/lists_advanced/palindrome_1/en.py @@ -13,7 +13,8 @@ description = '''\ </pre>''' plan = ['''\ -<p>A palindrome is a list (ok, a word) that reads the same from front or back. Like aibohphobia. ;)</p> +<p>A palindrome is a list (ok, a word) that reads the same from front or back. Like aibohphobia! +Was it a car or a cat I saw? ;)</p> ''', '''\ <p>As always we want to reduce the problem into a smaller one. Let's chop off the first and the last element of a list, and, if equal, proceed recursively.</p> |