POJ 2418 Hardwood Species(二)
p++;
}else
{
a[t].sum++;
}
}
qsort(a,top,sizeof(a[0]),cmp);
for(i=0;i<=top-1;i++)
{
printf("%s ",a[i].s1);
printf("%.4lf\n",a[i].sum*100/s);
}
return 0;
}
struct tire* newnode()
{
int i;
struct tire *p=(struct tire*)malloc(sizeof(struct tire));
p->tag=-1;
for(i=0;i<=299;i++)
{
p->next[i]=NULL;
}
return p;
}
int build(char s2[50],struct tire* p)
{
int i,l=strlen(s2),s;
for(i=0;i<=l-1;i++)
{ www.2cto.com
s=s2[i];
if(p->next[s]==NULL)
{
p->next[s]=newnode();
}
p=p->next[s];
}
if(p->tag==-1)
{
p->tag=top;
return -1;
}
return p->tag;
}