Pagini recente » Cod sursa (job #244642) | Cod sursa (job #2586815) | Cod sursa (job #1971627) | Cod sursa (job #3262216) | Cod sursa (job #309762)
Cod sursa(job #309762)
#include<iostream>
#include<stdio.h>
#include<list>
#include<algorithm>
#define MOD 101137
using namespace std;
list <int> a[MOD];
list <int> ::iterator it;
int n,op,i,x,Mod;
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for(i=0;i<n;i++)
{
scanf("%d%d",&op,&x);Mod=x%MOD;
if(op==1)
a[Mod].push_back(x);
if(op==2)
{
it=find(a[Mod].begin(),a[Mod].end(),x);
if(it!=a[Mod].end())
a[Mod].erase(it);
}
if(op==3)
printf("%d\n",find(a[Mod].begin(),a[Mod].end(),x)==a[Mod].end()?0:1);
}
return 0;
}