Pagini recente » Cod sursa (job #1768646) | Cod sursa (job #1204864) | Cod sursa (job #2178306) | Cod sursa (job #73575) | Cod sursa (job #255428)
Cod sursa(job #255428)
#include<stdio.h>
#define N 156601
int ha[N][5],hb[N][45,b,p;
int a,c,i,j,m,n;
FILE *g=fopen("hashuri.out","w");
void add(int x) {
p=x%N;
for(j=0;j<5;j++)
if(ha[p][j]==0)
{ha[p][j]=x;
return ;}
else
if(hb[p][j]==0)
{hb[p][j]=x;
return ;}
}
void del(int x){
p=x%N;
for(j=0;j<5;j++)
if(ha[p][j]==x)
{ha[p][j]=0;
return ;
}
else
if(hb[p][j]==x)
{hb[p][j]=0;
return ;}
}
void querry(int x){
p=x%N;
for(j=0;j<5;j++)
if(ha[p][j]==x||hb[p][j]==x)
{fprintf(g,"%d\n",1);return ;}
fprintf(g,"%d\n",0);
}
int main(){
FILE *f=fopen("hashuri.in","r");
fscanf(f,"%d",&n);
for(i=1;i<=n;i++)
{fscanf(f,"%d%d",&a,&b);
if(a==1)
add(b);
else
if(a==2)
del(b);
else
querry(b);
}
fclose(f);
fclose(g);
return 0;}