/*?
?*?File:???main.cpp
?*?Author:?GuoXiang
?*聲明本程序版權歸guoxiang所有任何人不得商用，只供學習
?*?Created?on?2009年12月10日?下午12:22
?*/

#include?
#include
#include
#include?
#include
#include
using?namespace?std;
const?int?LenChild=26;
const?int?Max_Word_Len=30;
const?int?Max_Word_Information_Len=300;
typedef?class?node{
????bool?has;
????node?*?child[LenChild];
????string?*?inf;
????friend?class?TREE;
public:
????node（）{
????????has=false;
????????inf=NULL;
????????for（int?i=0;i????}
????~node（）{
????????????delete?inf;
????}
????string?*?getinf（）{
????????return?inf;???
????}
}node*tree;

class?TREE{
????tree?T;
public:
????TREE（）{
????????T=new?node;;
????}
????void?clear（node?*p）{
????????for（int?i=0;i????????????if（p->child[i]）?clear（p）;????
????????}?
????????delete?p;
????}
????~TREE（）{
???????clear（T）;?????
????}
????bool?Insert_word（char?*wordchar?*ch）{
????????int?i=0;?node?*p=T;
????????while（word[i]）{
????????????int?index=word[i]-?‘a‘;
????????????if（!p->child[index]）{
????????????????p->child[index]=new?node;
????????????}
????????????p=p->child[index];
????????????i++;
????????}
????????p->has=true;
????????p->inf=new?string（ch）;
????????return?true;
????}

????bool?has_word（char?*wordtree?&the）{
????????int?i=0;?node?*p=T;
????????while（word[i]）{
????????????int?index=word[i]-?‘a‘;
????????????if（!p->child[index]）?break;
????????????p=p->child[index];
????????????i++;
????????}
????????the=p;
????????return?p->has?&&?i==strlen（word）;
????}

????bool?delete_word（char?*word）{
????????int?i=0;?node?*p=T;
????????while（word[i]）{
????????????int?index=word[i]-?‘a‘;
????????????if（!p->child[index]）?break;
????????????p=p->child[index];
????????????i++;
????????}
?????????if（p->has?&&?i==strlen（word））{
?????????????delete?p->inf;
?????????????p->has=false;?return?true;
?????????}
?????????else?{?return?false;}

????}
????void?dfs（tree?pstring?*w[]node?*ans[]int?&?Countchar?*eint?len）{
??????????if（Count>=8）return;
??????????e[len]=‘\0‘;
??????????if（p->has）{
??????????????ans[Count]=p;
??????????????w[Count++]=new?string（e）;????????
??????????}????
??????????for（int?i=0;i??????????????if（p->child[i]）{
??????????????????e[len]=i+‘a‘;
??????????????????dfs（p->child[i]wansCountelen+1）;?????????????
??????????????}????
??????????}
????}
????void?Find_word（char?*wordstring?*w[]node?*ans[]int?&?Count）{
????????char?e[Max_Word_Len];
????????int?i=0len=0;?node?*p=T;
????????while（word[i]）{
????????????int?index=word[i]-?‘a‘;
????????????e[len++]=word[i];
????????????if（!p->child[index]）?break;
????????????p=p->child[index];
????????????i++;
????????}
????????if（?i==strlen（word））{
????????????dfs（pwansCountelen）;
????????}
???????
????}
????void?Creat（）{
???????system（“cls“）;
???????cout<