H - Compound Words UVA - 10391

最新推荐文章于 2021-04-12 15:14:47 发布

转载最新推荐文章于 2021-04-12 15:14:47 发布 · 336 阅读

2017暑假训练专栏收录该内容

12 篇文章

订阅专栏

本文介绍了一种算法，用于从字典中找出所有由两个单词组成的复合词。输入为按字母顺序排列的单词列表，输出则是同样按字母顺序排列的复合词列表。

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

You are to find all the two-word compound words in a dictionary. A two-word compound word is aword in the dictionary that is the concatenation of exactly two other words in the dictionary.InputStandard input consists of a number of lowercase words, one per line, in alphabetical order. There willbe no more than 120,000 words.OutputYour output should contain all the compound words, one per line, in alphabetical order.Sample Inputaalienbornlesslienneverneverthelessnew

#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstring>
#include <climits>
#include <cstdio>
#include <cctype>
#include <queue>
#include <cmath>
#include <stack>
#include<set>
using namespace std;


int main()
{
    string s1;
    int i;
    string s2;
    set<string> s;
    while(cin>>s1)
    {
        s.insert(s1);
    }
      set<string>::iterator it;
    for(it=s.begin();it!=s.end();it++)
    {
        s2 = *it;
        for(i=1;i<s2.length();i++)
        {
            if(s.find(s2.substr(0,i))!=s.end()&&s.find(s2.substr(i,s2.length()-i))!=s.end())
            {
                cout<<s2<<endl;
                break;
            }
        }
    }
   return 0;
}

newbornthezebraSample Outputaliennewborn