Pagini recente » Cod sursa (job #790886) | Cod sursa (job #2504625) | Cod sursa (job #3000623) | Cod sursa (job #3257374) | Cod sursa (job #984053)
Cod sursa(job #984053)
using namespace std;
#include<fstream>
ifstream eu("hashuri.in");
ofstream tu("hashuri.out");
# define Mod 666013
#include<vector>
vector <int> G[Mod];
int N,x,op;
vector <int>:: iterator look_for(int val)
{
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();
}
void Add(int val)
{
int list=x%Mod;
if(look_for(x)==G[list].end())
G[list].push_back(x);
}
void Del(int val)
{
int list=x%Mod;
vector<int>:: iterator it;
it=look_for(x);
if(look_for(x)!=G[list].end())
G[list].erase(it);
}
int main()
{
eu>>N;
while(N--)
{
eu>>op>>x;
int list=x&Mod;
if(op==1)
Add(x);
else
if(op==2)
Del(x);
else
{
if(look_for(x)!=G[list].end())
tu<<"1\n";
else
tu<<"0\n";
}
}
return 0;
}