qq_34596217的博客

题意： 给出一个词典，找出所有的复合词，即恰好有两个单词链接而成的单词。 输入：每行都是由小写字母有组成的单词。输入已经按照词典序从小到大排序，且不超过120000个单词。 输出：输出所有的复合词，按照字典序从小到大排列。 Sample Input a alien born less lien never nevertheless new newborn the zebra Sample Output alien newborn #include <iostream> #include <

Input Input will consist of a series of lines. No line will be more than 80 characters long, but may contain any number of words. Words consist of up to 20 upper and/or lower case letters, and will not be broken across lines. Spaces may appear freely aroun

Input The input file is a text with no more than 5000 lines. An input line has at most 200 characters. Input is terminated by EOF. Output Your output should give a list of different words that appears in the input text, one in a line. The words should all