Pagini recente » Cod sursa (job #3179786) | Cod sursa (job #3234111) | Cod sursa (job #3212123) | Cod sursa (job #2863203) | Cod sursa (job #966876)
Cod sursa(job #966876)
#include <cstdio>
#include <vector>
#define MOD 666013
using namespace std;
vector <int> H[MOD];
int n;
vector <int> :: iterator find_value(int x)
{
vector<int> ::iterator it;
int list=x%MOD;
for(it=H[list].begin();it!=H[list].end();++it)
if(*it==x)
return it;
return H[list].end();
}
void insert_value(int x)
{
int list=x%MOD;
if(find_value(x)==H[list].end())
H[list].push_back(x);
}
void erase_value(int x)
{
int list=x%MOD;
vector <int> :: iterator it=find_value(x);
if(it!=H[list].end())
H[list].erase(it);
}
int main()
{
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
int op,x;
for(scanf("%d",&n);n;n--)
{
scanf("%d %d",&op,&x);
if(op==1)
{
insert_value(x);
continue;
}
if(op==2)
{
erase_value(x);
continue;
}
printf("%d\n",H[x%MOD].end()!=find_value(x));
}
return 0;
}