Pagini recente » Cod sursa (job #436887) | Cod sursa (job #2967835) | Cod sursa (job #2744227) | Cod sursa (job #2970171) | Cod sursa (job #2745843)
#include <iostream>
#include<bits/stdc++.h>
#include<fstream>
#include<vector>
using namespace std;
#define nr_prim 666013
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector<int> v[nr_prim];
int cauta(int x)
{
int nr = x % nr_prim;
int lg = v[nr].size();
for(int i =0;i<lg;i++)
if(v[nr][i] == x)
return i;
return -1;
}
void adauga(int x)
{
int nr = x % nr_prim;
if(cauta(x)==-1)
v[nr].push_back(x);
}
void sterge(int x)
{
int nr = x % nr_prim;
int lg = v[nr].size();
int i = cauta(x);
if(i != -1)
{
v[nr][i] = v[nr][lg-1];
v[nr].pop_back();
}
}
int main()
{
int n,k,nr;
f>>n;
for(int i=0;i<n;i++)
{
f>>k;
f>>nr;
if(k == 1)
adauga(nr);
else if(k==2)
sterge(nr);
else
{
if(cauta(nr)!= -1)
g<<1<<endl;
else
g<<0<<endl;
}
}
return 0;
}