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

1个回答

Csdn user default icon
上传中...
上传图片
插入图片
抄袭、复制答案,以达到刷声望分或其他目的的行为,在CSDN问答是严格禁止的,一经发现立刻封号。是时候展现真正的技术了!
立即提问