学步园

http://acm.hdu.edu.cn/showproblem.php?pid=1247

Problem Description

A hat’s word is a word in the dictionary that is the concatenation of exactly two other words in the dictionary.
You are to find all the hat’s words in a dictionary.

 

 

Input

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

 

 

Output

Your output should contain all the hat’s words, one per line, in alphabetical order.

 

 

Sample Input

a ahat hat hatword hziee word

 

 

Sample Output

ahat hatword

 

分析：

用字典树暴力即可，首先建立字典树，并用标记标记好每个单词的结尾，然后遍历每个单词，对每个单词进行拆解，拆解成左右两个部分，对这两个部分，分别到字典数种查找，若能找到则输出该单词

代码：

#include<iostream>
using namespace std;
struct Node
{
    Node * next[26];
    int num;
    Node()
    {
        num=0;
        memset(next,NULL,sizeof(next));
    }
};
char str[50000][50];
void insert_tree(Node * head,char *tstr)
{
    Node *h=head;
    int len=strlen(tstr),i;
    for(i=0;i<len;i++)
    {
        int id=tstr[i]-'a';
        if(h->next[id]==NULL)
            h->next[id]=new Node;
        h=h->next[id];
    }
    h->num=1;
}
int find_tree(Node *head,char *tstr)
{
    Node *h=head;
    int len=strlen(tstr),i;
    for(i=0;i<len;i++)
    {
        int id=tstr[i]-'a';
        if(h->next[id]==NULL)
            return 0;
        h=h->next[id];
    }
    return h->num;
}
int main()
{
    int k=0,i,j;
    char str1[50],str2[50],tstr[50];
    Node *head=new Node;
    while(gets(str[k]))
    {
        insert_tree(head,str[k]);
        k++;
    }
    for(i=0;i<k;i++)
    {
        int len=strlen(str[i]);
        strcpy(tstr,str[i]);
        for(j=1;j<len;j++)
        {
            strcpy(str1,tstr);
            str1[j]='\0';
            strcpy(str2,tstr+j);
            if(find_tree(head,str1)&&find_tree(head,str2))
                break;
        }
        if(j<len)
            puts(tstr);
    }
    return 0;
}