原题:
Hat’s Words
1000ms 32768K
描述:
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.
输入:
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.
输出:
Your output should contain all the hat’s words, one per line, in alphabetical order.
样例输入:
a ahat hat hatword hziee word
样例输出:
ahat hatword
(链接:Hat’s Words | JXNUOJ)
翻译:
帽子单词
一个帽子单词在字典里是由两个单词串联而成。你需要找出一本字典里的所有帽子单词。
输入:
输入由大量小写单词组成,按字母顺序一行一个单词。不超过50,000个单词。只有一组数据。
输出:
输出为所有帽子单词,按字母顺序,一行一个。