Pagini recente » Cod sursa (job #616719) | Cod sursa (job #736939) | Cod sursa (job #2713359) | Cod sursa (job #984306) | Cod sursa (job #2297273)
#include<fstream>
#include<string.h>
using namespace std;
ifstream f("trie.in");
ofstream g("trie.out");
int x;
char cuv[20];
class nod
{ public:
int nr_cuvinte,ex_cuv;
nod *fii[26];
}*rad=new nod;
void ad_cuv(char *w)
{
nod *q=rad;
for(int i=0;i<strlen(w);i++)
{
if(q->fii[w[i]-'a']==0)
{ q->fii[w[i]-'a']=new nod;
(q->fii[w[i]-'a'])->nr_cuvinte=0;
(q->fii[w[i]-'a'])->ex_cuv=0;
for(int j=0;j<=25;j++)
(q->fii[w[i]-'a'])->fii[j]=0;
}
q=q->fii[w[i]-'a'];
++q->ex_cuv;
}
++q->nr_cuvinte;
}
bool del_cuv(int poz,nod *q,char *w)
{
if(poz==strlen(w))
{
q->nr_cuvinte=q->nr_cuvinte-1;
q->ex_cuv=q->ex_cuv-1;
if(q->ex_cuv==0)
{
delete q;
return 1;
}
return 0;
}
if(del_cuv(poz+1,q->fii[w[poz]-'a'],w))
q->fii[w[poz]-'a']=NULL;
if(q!=rad)
{
--q->ex_cuv;
if(q->ex_cuv==0)
{
delete q;
return 1;
}
}
return 0;
}
void print_nrcuv (char *w)
{
nod *aux=rad; int i;
for(i=0;i<strlen(w)&&aux->fii[w[i]-'a']!=NULL;aux=aux->fii[w[i]-'a'],i++);
g<<(aux->nr_cuvinte)*(i==strlen(w))<<'\n';
}
void prefix_maxim(char *w)
{
int i=0;
nod *aux=rad;
for(i=0;i<strlen(w)&&aux->fii[w[i]-'a']!=NULL;aux=aux->fii[w[i]-'a'],i++);
g<<i<<'\n';
}
int main()
{
while(f>>x>>cuv)
{
switch(x)
{
case 0:
ad_cuv(cuv);
break;
case 1:
del_cuv(0,rad,cuv);
break;
case 2:
print_nrcuv(cuv);
break;
case 3:
prefix_maxim(cuv);
break;
}
}
f.close();
g.close();
return 0;
}