Pagini recente » Cod sursa (job #1575938) | Cod sursa (job #267791) | Cod sursa (job #1838009) | Cod sursa (job #1067527) | Cod sursa (job #2709990)
#include <bits/stdc++.h>
#define MOD 666013
#define ll long long int
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector<ll>g[MOD];
ll n;
ll op,x;
ll i;
void add(ll x)
{
ll rez=x%MOD;
vector<ll>::iterator it;
for(it=g[rez].begin();it!=g[rez].end() && (*it)!=x;it++ );
if(it== g[rez].end() )
g[rez].push_back(x);
}
void rem(ll x)
{
ll rez=x%MOD;
vector<ll>::iterator it;
for(it=g[rez].begin();it!=g[rez].end() && (*it)!=x;it++ );
if(it!= g[rez].end() )
g[rez].erase(it);
}
void chk(ll x)
{
ll rez=x%MOD;
vector<ll>::iterator it;
for(it=g[rez].begin();it!=g[rez].end() && (*it)!=x;it++ );
if(it!= g[rez].end() )
fout<<1<<"\n";
else
fout<<"0\n";
}
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>op>>x;
if(op==1)
add(x);
if(op==2)
rem(x);
if(op==3)
chk(x);
}
return 0;
}