UVA 10391 Compound Words



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

题意：找出由两个单词构成的单词

想了半天都没想到，看了题解才发现原来这么合情理，智商碾压了

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <string>
#include <map>
using namespace std;
const int MAX = 120000+5;

map<string, int> Map;
char str[MAX][100];

int main()
{
    int n = 0;
    Map.clear();
    while(~scanf("%s", str[n]) && strcmp(str[n], "END"))
    {
        Map[str[n]] = 1;
        n++;
    }
    for(int i=0;i<n;i++)
    {
        int len = strlen(str[i]);
        for(int j = 0;j<len;j++)
        {
            char temp1[100];
            char temp2[100];
            memset(temp1,'\0',sizeof(temp1));  //注意初始化，不初始化WA
            memset(temp2,'\0',sizeof(temp2));
            strncpy(temp1,str[i],j);
            strncpy(temp2,str[i]+j,len-j);
            if(Map[temp1] && Map[temp2])
            {
                printf("%s\n",str[i]);
                break;
            }
        }
    }
    return 0;
}