Pagini recente » Cod sursa (job #1599407) | Cod sursa (job #2142804) | Cod sursa (job #245499) | Cod sursa (job #1748716) | Cod sursa (job #1408652)
#include<fstream>
#define M 666013
using namespace std;
ifstream f("hashuri.in"); ofstream g("hashuri.out");
struct nod {int e; nod *urm;};
nod *H[M];
void ins(int x)
{ int r=x%M;
nod *q=new nod;
q->e=x; q->urm=H[r]; H[r]=q;
}
int caut(int x)
{ int r=x%M;
for(nod *q=H[r];q;q=q->urm)
if(x==q->e) return 1;
return 0;
}
void sterg(int x)
{ int r=x%M;
if(H[r]->e == x)
{ nod *q=H[r];
H[r]=H[r]->urm;
delete(q);
}
else
for(nod *q=H[r];q->urm;q=q->urm)
{ if(q->urm->e == x)
{ q = q->urm->urm;
delete(q->urm);
break;
}
}
}
int main()
{ int t,op,x;
f>>t;
while(t--)
{ f>>op>>x;
switch(op)
{ case 1 : if(!caut(x)) ins(x); break;
case 2 : if(caut(x)) sterg(x); break;
case 3 : g<<caut(x)<<'\n';
}
}
g.close(); return 0;
}