This preview shows pages 1–2. Sign up to view the full content.
This preview has intentionally blurred sections. Sign up to view the full version.View Full Document
Unformatted text preview: There will be fewer than 1000 words in all the input word sets combined and no word will be longer than 80 characters. c Output is a single line containing the unique longest palindrome made from each word set. The input word sets will be chosen so that there is exactly one longest palindrome that can be made from the word set without repeating words. There must be a single space character between consecutive words in the output line, and no other space characters in the line. The line may be very long. The words and the palindromes may not necessarily make sense. Sample input: an Sheet1 Page 2 bann nab foo code coder contest fast gnu problem redo reverse rung Sample output: bann an nab gnu redo code rung...
View Full Document
This note was uploaded on 04/29/2011 for the course IT 201 taught by Professor K.v.arya during the Spring '11 term at IIT Kanpur.
- Spring '11