Pagini recente » Cod sursa (job #1202143) | Cod sursa (job #2415140) | Cod sursa (job #811846) | Cod sursa (job #2980754) | Cod sursa (job #2261575)
#include <fstream>
#define ch (*s-'a')
#include <cstring>
using namespace std;
struct Trie
{
short pr,rasp;
Trie *fii[26];
};
Trie *t=new Trie();
int i,ma,c,rasp,nr;
char s[26];
void adauga(Trie *p,char *s)
{
p->pr++;
if(*s=='\0')
{
p->rasp++;
return;
}
else
{
if(p->fii[ch]==NULL)
{
p->fii[ch]=new Trie();
}
adauga(p->fii[ch],s+1);
}
}
void elimina(Trie *p,char *s)
{
p->pr--;
if(*s=='\0')
{
p->rasp--;
return;
}
else
{
elimina(p->fii[ch],s+1);
}
}
int calculeaza(Trie *p,char *s)
{
if(*s=='\0')
{
return p->rasp;
}
if(p->fii[ch]==NULL)
{
return 0;
}
return calculeaza(p->fii[ch],s+1);
}
int cauta(Trie *p,char *s)
{
if(*s!='\0' && p->fii[ch]!=NULL && p->fii[ch]->pr>0)
{
ma++;
return cauta(p->fii[ch],s+1);
}
else
{
return ma;
}
}
int main()
{
ifstream f("trie.in");
ofstream g("trie.out");
while(f>>c)
{
//f.get();
f.getline(s,30);
ma=0;
if(c==0)
{
adauga(t,s);
}
else if(c==1)
{
elimina(t,s);
}
else if(c==2)
{
g<<calculeaza(t,s)<<'\n';
}
else
{
ma=0;
g<<cauta(t,s)<<'\n';
}
}
return 0;
}