码迷,mamicode.com
首页 > 其他好文 > 详细

ZOJ 1825 Compound Words

时间:2015-07-20 22:51:35      阅读:105      评论:0      收藏:0      [点我收藏+]

标签:

Compound Words

Time Limit: 5000ms
Memory Limit: 32768KB
This problem will be judged on ZJU. Original ID: 1825
64-bit integer IO format: %lld      Java class name: Main
 
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 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

 

Source

 
解题:好久没写代码 开始脑残了
 
技术分享
 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 }
View Code

 

ZOJ 1825 Compound Words

标签:

原文地址:http://www.cnblogs.com/crackpotisback/p/4662762.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!