hdu 1257 trie树

#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstdlib>
#include<map>
#include<queue>
#include <deque>
#include <list>
#include <ctime>
#include <stack>
#include <vector>
#include<iomanip>
#include<set>
#define Maxn
#define mod
typedef long long ll;
#define FOR(i,j,n) for(int i=j;i<=n;i++)
#define DFR(i,j,k) for(int i=j;i>=k;--i)
#define lowbit(a) a&-a
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define mem(a) memset(a,0,sizeof(a))
#define eps 1e-9
const int inf = 0x3f3f3f3f;
const double pi = acos(-1.0);
using namespace std;
char ch[5050][100];
struct node
{   struct node *next[26];
    bool value;
    node()
    {FOR(i,0,25)next[i]=NULL;
     value=false;
    }
}*root;
void Insert(char s[])
{   int k = 0;
    node *p =root;
    while(s[k]!='\0')
    {if(!p->next[s[k]-'a'])
        p->next[s[k]-'a']=new node();
        p=p->next[s[k]-'a'];k++;
    }
    p->value=true;
}
bool Find(char s[])
{   int k=0;
    node *p=root;
    while(s[k]!='\0'&& p->next[s[k]-'a'])
    {   p=p->next[s[k]-'a'];
        k++;
    }
    if(s[k]=='\0'&&p->value)
        return p->value;
    return false;
}
int main()
{   int i=0,k;
    root =new node();
    while(~scanf("%s",ch[i]))
    {   Insert(ch[i]);i++;}
    for(k=0;k<i;k++)
    {   int j;
        for(j=1;j<strlen(ch[k])-1;j++)
        {   char s1[100],s2[100];
            FOR(jj,0,j-1)s1[jj]=ch[k][jj];
            s1[j]='\0';
            strcpy(s2,ch[k]+j);
            if(Find(s1) && Find(s2))
        {   cout<<ch[k]<<endl;
            break;
        }
        }

    }
    return 0;
}