HomeVolumesContestsSectionsForumsUsersPrintHelpAbout

Contests > Epoka Science Olympiad 2013-2015 > problem:


2015-11Gr-40. 50307 - Palindromes

Epoka Science Olympiad 2013-2015

Start: May.18.2013 at 10:00:00 AM
Finish: May.18.2013 at 03:00:00 PM
The contest is finished!
• Contest scoreboard

Guest
• Review clarifications (2)

Contest problems

• 2015-09Gr-20. 50725 - Fibonacci Se...
• 2015-09Gr-30. 50302 - Paper Sciss...
• 2015-09Gr-40. 50303 - Pattern
• 2015-10Gr-10. 50308 - IT Knowledg...
• 2015-10Gr-40. 50322 - Snake Pattern
• 2015-11Gr-10. 50304 - Number Pattern
• 2015-11Gr-20. 50305 - John's Tasks
• 2015-11Gr-30. 50306 - Beautiful N...
• 2015-11Gr-40. 50307 - Palindr...
• 6-P2. 50882 - Say Hello

Feedback

If you notice incorrect translations in Contester, please let author know.

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


Äëÿ îòïðàâêè ðåøåíèé íåîáõîäèìî âûïîëíèòü âõîä.

www.contester.ru