CPRMT - Common Permutation

no tags 

Given two strings of lowercase letters, a and b, print the longest string x of lowercase letters such that there is a permutation of x that is a subsequence of a and there is a permutation of x that is a subsequence of b.

Input

Input file contains several lines of input. Consecutive two lines make a set of input. That means in the input file line 1 and 2 is a set of input, line 3 and 4 is a set of input and so on. The first line of a pair contains a and the second contains b. Each string is on a separate line and consists of at most 1000 lowercase letters.

Output

For each set of input, output a line containing x. If several x satisfy the criteria above, choose the first one in alphabetical order.

Example

Sample input:
pretty
women
walking
down
the
street
 
Sample output:
e
nw
et 

hide comments
sandeep_4141: 2017-06-14 18:25:17

too easy and straightforward !!!

aditya9125: 2017-04-17 20:22:36

Its easy ,just think simply.

a2j007: 2017-03-17 19:40:46


Last edit: 2017-03-19 04:51:43
vengatesh15: 2017-03-15 21:17:10

did in O(n)..

epsilonalpha: 2017-03-13 12:51:06

Why does DP approach fail here? I got a WA using DP but A/C using simple logic.

vineetpratik: 2017-03-09 19:06:46

too easy!!

nilabja16180: 2017-03-07 14:55:20

Easy but looks complicated!

scorpion_ajay: 2017-02-28 07:27:05

too easy....
100!!!!
balle balle ;)

hamjosh1: 2016-11-18 11:33:28

simple adhoc

kshubham02: 2016-06-20 20:34:57

@codedog answer to that test case would be a blank line.


Added by:Andrés Leonardo Rojas Duarte
Date:2007-08-05
Time limit:0.133s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ERL JS-RHINO NODEJS PERL6 VB.NET
Resource:University of Alberta Local Contest 1999