Pagini recente » Cod sursa (job #1184681) | Cod sursa (job #2308590) | Cod sursa (job #5033) | Cod sursa (job #3270631) | Cod sursa (job #971428)
Cod sursa(job #971428)
#include <cstdio>
#include <vector>
#define MOD 666013
using namespace std;
int i,n,tip,x;
vector <int> H[MOD];
vector <int> ::iterator it;
int search(int x)
{
int ok=0;
for (it=H[x%MOD].begin();it!=H[x%MOD].end();it++) if (*it==x) ok=1;
return ok;
}
void add(int x)
{
if (!search(x)) H[x%MOD].push_back(x);
}
void erase(int x)
{
for (it=H[x%MOD].begin();it!=H[x%MOD].end();it++) if (*it==x) {H[x%MOD].erase(it);break;}
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&n);
for (i=1;i<=n;i++)
{
scanf("%d%d",&tip,&x);
if (tip==1) add(x);
if (tip==2) erase(x);
if (tip==3) printf("%d\n",search(x));
}
return 0;
}