Pagini recente » Cod sursa (job #856699) | Cod sursa (job #849250) | Cod sursa (job #292809) | Cod sursa (job #1016471) | Cod sursa (job #529747)
Cod sursa(job #529747)
#include <fstream>
#include <vector>
#define disp 32749
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
vector<int> V[disp+2];
inline void adauga(int nr)
{
int d = nr%disp,i;
bool o = 0;
for(i=0;i<V[d].size();i++)
if(V[d][i]==nr)
o=1;
if(!o)V[d].push_back(nr);
}
inline void sterge(int nr)
{
int d = nr%disp,i;
for(i=0;i<V[d].size();i++)
if(V[d][i]==nr)
V[d].erase(V[d].begin()+i,V[d].begin()+i+1);
}
inline int exista(int nr)
{
int d = nr%disp,i;
for(i=0;i<V[d].size();i++)
if(V[d][i]==nr)
return 1;
return 0;
}
int main()
{
int N,op,x;
in>>N;
while(N--)
{
in>>op>>x;
if(op==1)
adauga(x);
if(op==2)
sterge(x);
if(op==3)
out<<exista(x)<<'\n';
}
return 0;
}