Pagini recente » Cod sursa (job #2064883) | Cod sursa (job #2923145) | Cod sursa (job #1254158) | Cod sursa (job #1943363) | Cod sursa (job #2780913)
#include <bits/stdc++.h>
#define MOD 666013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector <long long> H[MOD+1];
vector <long long> ::iterator it;
long n,i,j,op,x,ind;
vector <long long > ::iterator gaseste(long x)
{
for(it=H[ind].begin();it!=H[ind].end();it++)
if(*it==x) return it;
return it;
}
void insereaza(long x)
{
if(it==H[ind].end()) H[ind].push_back(x);
}
void sterge(long x)
{
if(it!=H[ind].end()) H[ind].erase(it);
}
void scrie(long x)
{
if(it==H[ind].end()) fout<<"0";
else fout<<"1";
fout<<'\n';
}
int main()
{ fin>>n;
for(i=1;i<=n;i++)
{
fin>>op>>x;
ind=x%MOD;
gaseste(x);
if(op==1) insereaza(x);
if(op==2) sterge(x);
if(op==3) scrie(x);
}
return 0;
}