Common permutation 
Time Limit: 1000ms, Special Time Limit:2500ms, Memory Limit:32768KB 
Total submit users: 48, Accepted users: 41 
Problem 10024 :
No special judgement

Problem description 
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 consists of pairs of lines. 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 1,000 lowercase letters.

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

Sample Input 
pretty
women
walking
down
the
street 
Sample Output 
e
nw
et 
Problem Source 
UAL 1999

Submit
Discuss
Judge Status
Problems
Ranklist
