Online Judge - 10252 - Common Permutation
來源代碼：UVa
時間限制：3 s
題目說明
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 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.
輸出說明
For each set of input, output a line containing x. If several x satisfy the criteria above, choose the first one in alphabetical order.
輸入輸出範例
範例輸入
pretty women walking down the street
範例輸出
e nw et
討論
登入後即可加入討論。
登入
目前還沒有討論文章。