Pagini recente » Cod sursa (job #2298124) | Cod sursa (job #1622818) | Cod sursa (job #2480189) | Borderou de evaluare (job #2441569) | Cod sursa (job #331870)
Cod sursa(job #331870)
#include<stdio.h>
#include<list>
#define N 500009
using namespace std;
int n,x,X,op;
list <int> H[N];
void read(),solve();
int main()
{
read();
solve();
return 0;
}
void read()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
}
void solve()
{
list<int>::iterator it,b,e;
for(;n;n--)
{
scanf("%d%d",&op,&x);X=x%N;b=H[X].begin();e=H[X].end();
if(op==1)
{
for(it=b;it!=e;it++)
if(*it==x)break;
if(it==e)
H[X].push_back(x);
continue;
}
if(op==2)
{
for(it=b;it!=e;it++)
if(*it==x)break;
if(it!=e)H[X].erase(it);
continue;
}
for(it=b;it!=e;it++)
if(*it==x)break;
if(it==e)printf("0\n");
else printf("1\n");
}
}