Online Judge | Problem Set | Authors | Online Contests | User | ||||||
---|---|---|---|---|---|---|---|---|---|---|

Web Board Home Page F.A.Qs Statistical Charts | Current Contest Past Contests Scheduled Contests Award Contest |

Language: Suffidromes
Description Given two strings of lowercase letters, a and b, print the shortest string x of lowercase letters such that exactly one (but not both) of ax or bx is a palindrome; that is, equal to itself when reversed. Input Standard input contains several pairs of a and b. Each string is on a separate line and consists of between 0 and 1,000 lowercase letters. Output For each pair, output a line containing x. If several x satisfy the criteria above, choose the first one in alphabetical order.If there no such string x, output "No Solution." Sample Input abab ababab abc def Sample Output baba ba Source |

[Submit] [Go Back] [Status] [Discuss]

All Rights Reserved 2003-2013 Ying Fuchen,Xu Pengcheng,Xie Di

Any problem, Please Contact Administrator