Pagini recente » Cod sursa (job #1791754) | Cod sursa (job #1565211) | Cod sursa (job #2851517) | Cod sursa (job #2835766) | Cod sursa (job #1852766)
#include <cstdio>
#include <vector>
#define mod 666013
using namespace std;
vector <int> h[mod];
vector <int> :: iterator it;
int i,n,op,x,ind;
vector <int> :: iterator gasire(int x)
{
for( it=h[ind].begin() ; it!=h[ind].end() ; it++ )
if(*it==x)
return it;
return it;
}
void inserare(int x)
{
if( it==h[ind].end() )
h[ind].push_back(x);
}
void stergere (int x)
{
if( it!=h[ind].end() )
h[ind].erase(it);
}
void scriere (int x)
{
if( it==h[ind].end() ) printf("0\n");
else printf("1\n");
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d\n",&n);
for(i=1; i<=n; i++)
{
scanf("%d %d\n",&op,&x);
ind= x % mod;
it=gasire(x);
if(op==1) inserare(x);
else if(op==2)stergere(x);
else if(op==3) scriere(x);
}
return 0;
}