ACM暑假集训_STL&模拟_H-Compound Words_h

本文链接：https://blog.csdn.net/W_anning/article/details/81195475

ACM暑假集训_STL&模拟_H-Compound Words

Description

You are to ﬁnd all the two-word compound words in a dictionary. A two-word compound word is a word in the dictionary that is the concatenation 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, in alphabetical order.

Sample Input

a

alien

born

less

lien

never

nevertheless

new

newborn

the

zebra

Sample Output

alien

newborn

Hint

解题思路

把每个单词可能的拆分结果都枚举一遍，判断是否在“字典”里存在。

代码

#include <set>
#include <iostream>
using namespace std;
set<string>s;
int main() 
{
	string w;
	while(cin>>w) 
	{
		s.insert(w);
	}
	set<string>::iterator it; 
	for(it=s.begin();it!=s.end();it++) 
	{
		for(int i=1;i<(*it).size();i++) 
		{
			string head=(*it).substr(0,i);
			string foot=(*it).substr(i);
			if(s.count(head)&&s.count(foot)) 
			{
				cout <<(*it)<<endl;
				break;
			}
		}
	}
	return 0;
}