統計難題
Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 20031 Accepted Submission(s): 8776
注意:本題只有一組測試數據,處理到文件結束.
#include <stdio.h>
#include <string.h>
struct node
{
int flag;
node *next[26];
};
void build(node *&head,char str[],int len)
{
node *p = head,*q;
for(int i = 0;i < len;i++)
{
int zh = str[i] - 'a';
if(!p->next[zh])
{
q = new node;
memset(q->next,0,sizeof(q->next));
q->flag = 1;
p->next[zh] = q;
p = q;
}
else
{
p = p->next[zh];
p->flag++;
}
}
}
void nfind(node *&head,char str[],int len)
{
node *p = head;
for(int i = 0;i < len;i++)
{
int zh = str[i] - 'a';
if(p->next[zh])
p = p->next[zh];
else
{
printf("0\n");
return ;
}
}
printf("%d\n",p->flag);
}
int main()
{
char str[15];
bool flag = false;
node *head = new node;
memset(head->next,0,sizeof(head->next));
while(gets(str))
{
int len = strlen(str);
if(!len)
{
flag = true;
continue;
}
if(flag)
{
nfind(head,str,len);
}
else
{
build(head,str,len);
}
}
return 0;
}