Mix and Build

Time Limit
5s
Memory Limit
65536KB
Judge Program
Special
Ratio(Solve/Submit)
0.00%(0/0)
Description:

In this problem, you are given a list of words (sequence of lower case letters). From this list, find the longest chain of words w1, ..., wn such that wi is a mixed extension of wi-1. A word A is a mixed extension of another word B if A can be formed by adding one letter to B and permuting the result. For example, "ab", "bar", "crab", "cobra", and "carbon" form a chain of length 5.

Input:

The input contains at least two, but no more than 10000 lines. Each line contains a word. The length of each word is at least 1 and no more than 20. All words in the input are distinct.

Output:

Write the longest chain that can be constructed from the given words. Output each word in the chain on a separate line, starting from the first one. If there are multiple longest chains, any longest chain is acceptable.

Sample Input:
ab
arc
arco
bar
bran
carbon
carbons
cobra
crab
crayon
narc
Sample Output:
ab
bar
crab
cobra
carbon
carbons

Submit