Pagini recente » Cod sursa (job #1276997) | Cod sursa (job #2965847) | Cod sursa (job #1783068) | Cod sursa (job #1388002) | Cod sursa (job #2036804)
#include <cstdio>
#include <vector>
#include <algorithm>
using namespace std;
const int m=666013;
int h(int key)
{
return key%m;
}
vector<int>v[m+5];
vector<int>::iterator it;
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
int n,i,op,x,key;
scanf("%d",&n);
for(i=1;i<=n;++i)
{
scanf("%d%d",&op,&x);
key=h(x);
if(op==1)
v[key].push_back(x);
else
if(op==2)
{
it=find(v[key].begin(),v[key].end(),x);
if(it!=v[key].end())
v[key].erase(it);
}
else
{
it=find(v[key].begin(),v[key].end(),x);
if(it!=v[key].end())
printf("1\n");
else
printf("0\n");
}
}
return 0;
}