Pagini recente » Cod sursa (job #107851) | Cod sursa (job #106819) | Cod sursa (job #2571931) | Cod sursa (job #1474794) | Cod sursa (job #2448861)
#include <bits/stdc++.h>
using namespace std;
#define MOD 666013
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector<int> H[MOD];
int look(int x)
{
int l=x%MOD;
vector<int>::iterator it=find(H[l].begin(), H[l].end(), x);
if(it!=H[l].end())
return it-H[l].begin();
else
return -1;
}
void add(int x)
{
if(look(x)==-1)
H[x%MOD].push_back(x);
}
void del(int x)
{
int l=x%MOD, p=look(x);
if(p!=-1)
H[l].erase(H[l].begin()+p);
}
int main()
{ int n, x, c;
f>>n;
for(int i=1;i<=n;i++)
{
f>>c>>x;
if(c==1)
add(x);
else if(c==2)
del(x);
else if(look(x)!=-1) g<<1<<'\n';
else g<<0<<'\n';
}
f.close();
g.close();
return 0;
}