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