标签:
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
1 #include <bits/stdc++.h> 2 using namespace std; 3 unordered_set<string>us; 4 string word[1000010]; 5 int main() { 6 ios::sync_with_stdio(false); 7 int tot = 0; 8 while(cin>>word[tot]) us.insert(word[tot++]); 9 for(int i = 0; i < tot; ++i) { 10 if(word[i].length() > 1) { 11 for(int j = 1,len = word[i].length(); j < len; ++j) { 12 string a = word[i].substr(0,j); 13 string b = word[i].substr(j); 14 if(us.count(a) && us.count(b)) { 15 cout<<word[i]<<endl; 16 break; 17 } 18 } 19 } 20 } 21 return 0; 22 }
标签:
原文地址:http://www.cnblogs.com/crackpotisback/p/4662762.html