Pagini recente » Cod sursa (job #2273028) | Cod sursa (job #2250646) | Cod sursa (job #378945) | Cod sursa (job #960683) | Cod sursa (job #1542737)
#include <iostream>
#include <cstdio>
#define h 1000000
using namespace std;
#include <vector>
long long int n,j,cp,a,op,x;
vector <int> M[1000000];
void in(long long int x)
{
int c=x%h;
M[c].push_back(x);
}
int ver(long long int x)
{
int c=x%h;
int i;
int l=M[c].size();
for (i=0;i<l;i++)
{
if (M[c][i]==x) return 1;
}
return 0;
}
void elim(long long int x)
{
int c=x%h;
int l=M[c].size();
int i;
for (i=0;i<l;i++)
{
if (M[c][i]==x)
{
M[c].erase(M[c].begin()+i);
return;
}
}
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%lli",&n);
for (j=0;j<n;j++)
{
scanf("%lli %lli",&op,&x);
if (op==1) in(x);
else if (op==2) elim(x);
else cout<<ver(x)<<'\n';
}
}