Pagini recente » Cod sursa (job #1969320) | Cod sursa (job #394222) | Cod sursa (job #3268798) | Cod sursa (job #771993) | Cod sursa (job #260583)
Cod sursa(job #260583)
#include <stdio.h>
#include <vector>
#define MOD 666013
using namespace std;
int N;
vector<int> G[MOD];
vector<int>::iterator cauta(int x)
{
int list=x%MOD;
vector<int>::iterator it;
for (it=G[list].begin();it!=G[list].end();++it)
if (*it==x)
return it;
return G[list].end();
}
void baga(int x)
{
int list=x%MOD;
if (cauta(x)==G[list].end())
G[list].push_back(x);
}
void sterge(int x)
{
int list=x%MOD;
vector<int>::iterator it=cauta(x);
if (it!=G[list].end())
G[list].erase(it);
}
int main()
{
int op, x;
freopen("hashuri.in","r",stdin);
freopen("hashuri.out","w",stdout);
scanf("%d",&N);
while (N)
{
N--;
scanf("%d %d",&op,&x);
if (op==1)
{
baga(x);
continue;
}
if (op==2)
{
sterge(x);
continue;
}
printf("%d\n", cauta(x)!=G[x%MOD].end());
}
return 0;
}