hdu 1305 Immediate Decodability

#include<iostream>
#include<string>
#include<vector>
#include<cstring>
#include<cstdio>
using namespace std;
#define maxn 500
struct node
{    char* s;
int count1;
bool isword;
node* next[2];
node()
{    s=NULL;
count1=0;
isword=false;
memset(next,0,sizeof(next));
}
}*root;

void insert(node* root,char* s)
{    node* p=root;
for(int i=0;s[i];i++)
{    int x=s[i]-'0';
p->s=s+i;
if(p->next[x]==NULL)
p->next[x]=new node;
p=p->next[x];
p->count1++;
}
p->isword=true;
}

bool Search(node* root,const char* s)
{    node* p=root;
for(int i=0;s[i];i++)
{    int x=s[i]-'0';
if(p->next[x]==NULL)
return false;
p=p->next[x];
}
return p->isword;
}

int count(node* root,const char* s)
{
node* p=root;
for(int i=0;s[i];i++)
{
int x=s[i]-'0';
if(p->next[x]==NULL)
return 0;
p=p->next[x];
}
return p->count1 ;
}
int main()
{
char s[maxn];
bool flag;
int cas = 1;
while(scanf("%s",s) != EOF)
{     flag = true;
root = new node;
vector<string> v;
insert(root,s);
string str(s);
v.push_back(str);
while(scanf("%s",s))
{
if(s[0]=='9') break;
insert(root,s);
string str1(s);
v.push_back(str1);
}
for(int i = 0;i < (int)v.size(); i++)
{
if(count(root,v[i].c_str()) > 1)
{
flag = false;
break;
}
}
if(flag)
printf("Set %d is immediately decodable\n",cas++);
else
printf("Set %d is not immediately decodable\n",cas++);
}
return 0;
}