ADFRUITS - Advanced Fruits

The company "21st Century Fruits" has specialized in creating new sorts of fruits by transferring genes from one fruit into the genome of another one. Most times this method doesn't work, but sometimes, in very rare cases, a new fruit emerges that tastes like a mixture between both of them.

A big topic of discussion inside the company is "How should the new creations be called?" A mixture between an apple and a pear could be called an apple-pear, of course, but this doesn't sound very interesting. The boss finally decides to use the shortest string that contains both names of the original fruits as sub-strings as the new name. For instance, "applear" contains "apple" and "pear" (APPLEar and apPlEAR), and there is no shorter string that has the same property.
A combination of a cranberry and a boysenberry would therefore be called a "boysecranberry" or a "craboysenberry", for example.

Your job is to write a program that computes such a shortest name for a combination of two given fruits. Your algorithm should be efficient, otherwise it is unlikely that it will execute in the alloted time for long fruit names.

Input Specification

Each line of the input file contains two strings that represent the names of the fruits that should be combined. All names have a maximum length of 100 and only consist of alphabetic characters.
Input is terminated by end of file.

Output Specification

For each test case, output the shortest name of the resulting fruit on one line. If more than one shortest name is possible, any one is acceptable.

Sample Input

apple peach
ananas banana
pear peach

Sample Output


hide comments
mammadbastar: 2019-02-27 15:41:17

ba tashakr az ostade khoobam kianoosh abbasi

phoemur: 2018-09-08 03:34:21

Google it: Shortest Common Supersequence Problem

dennislo: 2018-06-20 19:08:54

Implementation is not hard at all

flyingduchman_: 2018-04-07 13:13:30

Similar to printing LCS with the help of 2D bottom-up table, modification needed.

Last edit: 2018-04-07 13:14:20
amitboss: 2018-02-28 14:10:55

ac in 1 go , they are asking for subsequences not for substring

mohit_aggarwal: 2018-02-20 18:33:44

Too much of string Manipulation !!

yashgulani: 2018-02-20 18:33:14

Better skip this problem , very long implementation and not much worthy

alysalhab5: 2018-02-17 12:22:58

to find lcs ??

karthik1997: 2017-12-15 19:47:37

Guys , this is a really good problem . Dont confuse with comments such as easy , AC in one go etc . it is a worthy one , if you are a beginner . Good Luck :)

armageddon117: 2017-11-14 09:31:52

Nice problem :)

Added by:Vincenzo Bonifaci
Time limit:0.153s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:University of Ulm Local Contest 1999