Compound Words

最新推荐文章于 2019-04-17 20:01:05 发布

weixin_33859665

最新推荐文章于 2019-04-17 20:01:05 发布

阅读量153

点赞数

CC 4.0 BY-SA版权

原文链接：http://www.cnblogs.com/zsyacm666666/p/4659949.html

本博客介绍如何在字典中查找由两个其他单词组成的双词复合词。通过输入一系列按字母顺序排列的单词，输出所有双词复合词，并保持排序。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

You are to find all the two-word compound words in a dictionary. A two-word compound word is a word in the dictionary that is theconcatenation of exactly two other words in the dictionary.

Input

Standard input consists of a number of lowercase words, one per line,in alphabetical order. There will be no more than 120,000 words.

Output

Your output should contain all the compound words, one per line, inalphabetical order.

Sample Input

a
alien
born
less
lien
never
nevertheless
new
newborn
the
zebra

Sample Output

alien
newborn


AC代码：

#include"iostream"
#include"set"
using namespace std;
int main()
{
    set<string> dic;
    string s;
    while(cin>>s) dic.insert(s);
    set<string> ::iterator it;
    for(it=dic.begin();it!=dic.end();it++)
    {
     string str,sub1,sub2;
     str=*it;
     for(int i=0;i<str.size()-1;i++)
     {
         sub1=str.substr(0,i+1);
         sub2=str.substr(i+1,str.size()-i-1);
         if(dic.find(sub1)!=dic.end()&&dic.find(sub2)!=dic.end())
         {
            cout<<str<<endl;
            break;     //一定要即时break掉，以免重复
         }
     }


    }
    return 0;
}