From dcf62b62331ef259cec1728c0957ec01d0c6da02 Mon Sep 17 00:00:00 2001
From: Kirito <1362050620@qq.com>
Date: Sat, 13 Aug 2016 11:24:55 +0800
Subject: [PATCH] Create 1247.cpp

---
 HDOJ/1247.cpp | 100 ++++++++++++++++++++++++++++++++++++++++++++++++++
 1 file changed, 100 insertions(+)
 create mode 100644 HDOJ/1247.cpp

diff --git a/HDOJ/1247.cpp b/HDOJ/1247.cpp
new file mode 100644
index 0000000..bec297b
--- /dev/null
+++ b/HDOJ/1247.cpp
@@ -0,0 +1,100 @@
+#include <iostream>
+#include <cstring>
+using namespace std;
+
+class node
+{
+public:
+    node* next[26];
+    bool value;
+    node() : value(false)
+    {
+        memset(next,0,sizeof(next));
+    }
+};
+node _headnode;
+node* head=&_headnode;
+
+void insert(const char* str)
+{
+    int L=strlen(str);
+    node* p=head;
+    for(int i=0;i<L;i++)
+    {
+        if(p->next[str[i]-'a']==nullptr)
+        {
+            p->next[str[i]-'a']=new node;
+        }
+        p=p->next[str[i]-'a'];
+    }
+    p->value=true;
+}
+
+bool search(const char* str)
+{
+    int L=strlen(str);
+    node* p=head;
+
+    for(int i=0;i<L;i++)
+    {
+        if(p->next[str[i]-'a']!=nullptr)
+        {
+            p=p->next[str[i]-'a'];
+            if(p->value)
+            {
+                bool isFound=true;
+                node* q=head;
+                for(int j=i+1;j<L;j++)
+                {
+                    if(q->next[str[j]-'a']!=nullptr)
+                    {
+                        q=q->next[str[j]-'a'];
+                    }
+                    else
+                    {
+                        isFound=false;
+                        break;
+                    }
+                }
+                if(isFound)
+                {
+                    if(q->value)
+                    {
+                        return true;
+                    }
+                }
+            }
+        }
+        else
+        {
+            break;
+        }
+    }
+
+    return false;
+}
+
+#define MAXN 50005
+#define MAXLEN 1005
+char input[MAXN][MAXLEN];
+
+
+
+
+int main()
+{
+    int i=0;
+    while(cin>>input[i])
+    {
+        insert(input[i++]);
+    }
+    for(int ci=0;ci<i;ci++)
+    {
+        if(search(input[ci]))
+        {
+            cout<<input[ci]<<endl;
+        }
+    }
+
+    return 0;
+}