|
||||||||||
Hat¡¯s WordsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 25157 Accepted Submission(s): 8816 Problem Description A hat¡¯s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary. You are to find all the hat¡¯s words in a dictionary. Input Standard input consists of a number of lowercase words, one per line, in alphabetical order. There will be no more than 50,000 words. Only one case. Output Your output should contain all the hat¡¯s words, one per line, in alphabetical order. Sample Input
Sample Output
Author ´÷ñ× | ||||||||||
|