1 #include <cstdio>
 2 #include <cstdlib>
 3 #include <cstring>
 4 #include <algorithm>
 5 #include <iostream>
 6 #include <cmath>
 7 #include <queue>
 8 #include <map>
 9 #include <stack>
10 #include <list>
11 #include <vector>
12 
13 using namespace std;
14 
15 char str[66666][81];
16 
17 typedef struct Node {
18     Node *next[26];
19     int cnt;
20     Node() {
21         cnt = 0;
22         for(int i = 0; i < 26; i++) {
23             next[i] = NULL;
24         }
25     }
26 }Node;
27 
28 void insert(Node *p, char *str) {
29     for(int i = 0; str[i]; i++) {
30         int t = str[i] - ‘a‘;
31         if(p->next[t] == NULL) {
32             p->next[t] = new Node();
33         }
34         p = p->next[t];
35     }
36     p->cnt++;   //is a word
37 }
38 
39 int find(Node *p, char *str) {
40     for(int i = 0; str[i]; i++) {
41         int t = str[i] - ‘a‘;
42         p = p->next[t];
43         if(!p) {
44             return 0;
45         }
46     }
47     if(p->cnt >= 1) {
48         return 1;
49     }
50     return 0;
51     // return p->cnt;
52 }
53 
54 int main() {
55     int n = 0;
56     Node *root = new Node();
57     // freopen("in", "r", stdin);
58     while(gets(str[n]) && strlen(str[n])) {
59         insert(root, str[n]);
60         n++;
61     }
62     char a[81];
63     char b[81];
64     for(int i = 0; i < n; i++) {
65         int len = strlen(str[i]);
66         for(int j = 1; j < len; j++) {
67             memset(a, 0, sizeof(a));
68             memset(b, 0, sizeof(b));
69             strncpy(a, str[i], j);
70             strncpy(b, str[i] + j, len - j);
71             if(find(root, a) && find(root, b)) {
72                 printf("%s\n", str[i]);
73                 break;
74             }
75         }
76     }
77     return 0;
78 }