Pagini recente » Cod sursa (job #523904) | Cod sursa (job #2855472) | Cod sursa (job #362551) | Cod sursa (job #117357) | Cod sursa (job #912579)
Cod sursa(job #912579)
#include <cstdio>
#include <vector>
using namespace std;
vector <int>a[1000000];
int n,caz,x,prim;
int caut(int y,int x)
{
int nr=a[prim].size();
for(int i=0;i<nr;i++)
if(a[prim][i]==x)
return i;
return -1;
}
void adaug(int x)
{
if(caut(prim,x)==-1)
a[prim].push_back(x);
}
void elimin(int x)
{
if(caut(prim,x)!=-1)
a[prim].erase(a[prim].begin()+caut(prim,x));
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d %d",&caz,&x);
prim=x%99997;
if(caz==1)
{
adaug(x);
}
else if(caz==2)
{
elimin(x);
}
else
{
if(caut(1,x)!=-1)
printf("1\n");
else
printf("0\n");
}
}
return 0;
}