Pagini recente » Cod sursa (job #2327469) | Cod sursa (job #2850733) | Cod sursa (job #2191891) | Cod sursa (job #1708874) | Cod sursa (job #2593285)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
const int MOD=666013;
int n,x,operatie;
vector<int> v[1000002];
int main()
{
fin>>n;
for(int i=0; i<n; i++)
{
fin>>operatie>>x;
if(operatie==1)
{
int cheie=x%MOD;
int cod=x/MOD;
bool check=false;
for(int j=0; j<v[cheie].size(); j++)
{
if(v[cheie][j]==cod) check=true;
}
if(check==false)
{
v[cheie].push_back(cod);
}
}
else if(operatie==2)
{
int cheie=x%MOD;
int cod=x/MOD;
for(int j=0; j<v[cheie].size(); j++)
{
if(v[cheie][j]==cod)
{
v[cheie][j]=-1;
break;
}
}
}
else
{
int cheie=x%MOD;
int cod=x/MOD;
bool check=false;
for(int j=0; j<v[cheie].size(); j++)
{
if(v[cheie][j]==cod) check=true;
}
if(check==true) fout<<1<<"\n";
else fout<<0<<"\n";
}
}
return 0;
}