Pagini recente » Cod sursa (job #723583) | Cod sursa (job #501530) | Cod sursa (job #1285059) | Cod sursa (job #2539618) | Cod sursa (job #1497543)
#include <cstdio>
using namespace std;
const int prim=103,mod=2000000;
int v[mod];
int main()
{
freopen("hashuri.in","r",stdin);
freopen("haschuri.out","w",stdout);
int n,x,y,a;
scanf("%d",&n);
for(int i=1;i<=n;i++)
{
scanf("%d%d",&x,&y);
if(x==1) {a=(1LL*y*prim)%mod;
while(1==1)
{
if(v[a]==y) break;
if(v[a]==0 or v[a]==-1) {v[a]=y;break;}
else a++;
if(a==mod) a=0;
}
}
if(x==2) {a=(1LL*y*prim)%mod;
while(1==1)
{
if(v[a]==y) {v[a]=-1;break;}
else if(v[a]==0) break;
else a++;
if(a==mod) a=0;
}
}
if(x==3) {a=(1LL*y*prim)%mod;
while(1==1)
{
if(v[a]==y) {printf("1\n");break;}
if(v[a]==0) {printf("0\n");break;}
a++;
if(a==mod) a=0;
}
}
}
return 0;
}