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-sequences of 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 allotted 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

appleach
bananas
pearch

hide comments
siddharth_0196: 2016-10-10 21:20:15

LCS! No Backtracking required! Think Simple! :D

Last edit: 2016-10-10 21:27:10
lalywr: 2016-10-08 14:36:31

Awesome problem
LCS + BackTracking + Pointers = 0.00
Must do for DP beginners

vandit_15: 2016-09-27 08:18:48

I am getting a runtime error, any suggestions please!!

sharif ullah: 2016-09-01 21:18:26

helpful link www.geeksforgeeks.org/shortest-common-supersequence/

avisheksanvas: 2016-08-20 13:28:48

Don't use global DP array. Also, don't forget to remove spaces from the starting of the LCS string formed.

shridharfly: 2016-08-16 22:16:43

What will be the output if the input is "qwe ewq" ??

fsdom: 2016-07-18 16:50:41

Excellent problem

razor123: 2016-06-21 15:05:11

Backtracking not required. A very straightforward example of LCS .

lt: 2016-04-20 22:48:19

why the hell am I getting wrong answer? Can somebody give me stronger test case?

mjguru: 2016-04-20 13:27:01

Simple LCS and common sense. No backtracking stuff required.


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