Time limit 2000/4000/4000/4000 ms. Memory limit 65000/65000/65000/65000 Kb.
Prepared by Geri Gokaj.
Palindromes
A palindrome is a word, phrase, number, or other sequence of characters which reads the same backward or forward e.g EYE, or RACECAR.
Write a program to find longest palindrome in a given word.
Input specification
String with N characters where 1 ≤ N ≤ 50.
Output specification
The longest palindromic sub-string. If the length of the palindromic subsequence is 1 display ”No Palindromes”.
Sample Input I
Jefferson
|
Sample Input II
Janna
|
Sample Input III
Table
|
Sample Output I
effe
|
Sample Output II
anna
|
Sample Output III
No Palindromes
|
Äëÿ îòïðàâêè ðåøåíèé íåîáõîäèìî âûïîëíèòü âõîä.
|