Pagini recente » Cod sursa (job #2999261) | Cod sursa (job #2875449) | Cod sursa (job #3290242) | Cod sursa (job #1298958) | Cod sursa (job #2259164)
#include <fstream>
#include<bits/stdc++.h>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
#define MOD 666013
vector <int> G[MOD];
inline vector<int>::iterator find_value(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();
}
inline void insert_value(int x)
{
int list=x%MOD;
if(find_value(x)==G[list].end())G[list].push_back(x);
}
inline void erase_value(int x)
{
int list=x%MOD;
vector<int>::iterator it=find_value(x);
if(it!=G[list].end())G[list].erase(it);
}
int main()
{
int n,op,x;
fin>>n;
while(n--)
{
fin>>op>>x;
if(op==1)insert_value(x);
else if(op==2)erase_value(x);
else fout<<(find_value(x)!=G[x%MOD].end())<<'\n';
}
return 0;
}