4 人解决，10 人已尝试。
5 份提交通过，共有 16 份提交。
8.3 EMB 奖励。
单点时限: 3.0 sec
内存限制: 256 MB
The cows are taking a trip to the lakes in Minnesota. Like everyone else, they are bored and are playing “travel games” to pass the time away.
In this travel game, the first cow thinks of a three letter word from the Sacred Travel Game Dictionary (STGD). The next cow in line must add a letter to the word (at the beginning, between two letters, or at the end) to make another word in the STGD. The cows are curious as to just how big the final word can be.
Given a dictionary of D (1 <= D <= 1000) words and a starting word, find any of the longest possible words that can be formed playing this travel game.
Line 1: The integer D followed by a space followed by a legal three letter word.
Line 2 through D+1: Each line contains a legal word no longer than 80 characters, consisting only of lowercase letters, from the STGD.
A single line with the longest word that can be formed by extending the input seed.
The input ensure the correct result will be unique.
9 cal cal calf calfs call calls choral chorale coal coral
chorale Hint [From the sequence: cal, coal, coral, choral, chorale]
4 人解决，10 人已尝试。
5 份提交通过，共有 16 份提交。
8.3 EMB 奖励。