Algorithm analysis: the entire string in turn write back the original string. The middle separated by a special character, the middle I use 0, the last face I added a character one, if there is likely to be wrong 0. (The last one should also not), so put the problem into a request string of a new two longest common prefix suffix NOTE: to provide the answer should be a set of data zzzdzaadzzz output zzz, and if not careful, then procedures may enter zdz, because there may be no answer to the prefix is adjacent to the loop where a judge had to deal with. WA three times because of this

ural1297.txt

• We are an exchange download platform that only provides communication channels. The downloaded content comes from the internet. Except for download issues, please Google on your own.
• The downloaded content is provided for members to upload. If it unintentionally infringes on your copyright, please contact us.
• Please use Winrar for decompression tools
• If download fail, Try it againg or Feedback to us.
• If downloaded content did not match the introduction, Feedback to us，Confirm and will be refund.
• Before downloading, you can inquire through the uploaded person information

Nothing．