summaryrefslogtreecommitdiff
path: root/prolog/problems/lists_advanced/palindrome_1/en.py
diff options
context:
space:
mode:
Diffstat (limited to 'prolog/problems/lists_advanced/palindrome_1/en.py')
-rw-r--r--prolog/problems/lists_advanced/palindrome_1/en.py3
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>