Pagini recente » Istoria paginii utilizator/lost | Monitorul de evaluare | Istoria paginii runda/selectie-vianu-2011/clasament | Clasament dupa rating | Cod sursa (job #322673)
Cod sursa(job #322673)
#include<stdio.h>
#define H(n) n%300149
long n,i,op,x,h,f,ll,j;
long a[300149][14];
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%ld",&n);
for(i=1;i<=n;++i)
{scanf("%ld%ld",&op,&x);
h=H(x);
if(op==1)
{f=1;
ll=0;
for(j=1;j<=a[h][0];++j)
{if(a[h][j]==x){f=0;break;}
if(a[h][j]==0)ll=j;}
if(f==1)
if(ll)a[h][ll]=x;
else a[h][++a[h][0]]=x;}
else
if(op==2)
{for(j=1;j<=a[h][0];++j)
if(a[h][j]==x){a[h][j]=0;break;}}
else
{f=0;
for(j=1;j<=a[h][0];++j)
if(a[h][j]==x){f=1;break;}
printf("%ld\n",f);}}
return 0;
}