Pagini recente » Cod sursa (job #1850702) | Cod sursa (job #2898402) | Cod sursa (job #2461170) | Cod sursa (job #2884626) | Cod sursa (job #2417308)
#include <iostream>
#include <fstream>
#include <vector>
#define MOD 666013
using namespace std;
int n,o,a;
vector<int> v[MOD];
int cauta(int nr){
int aj=nr%MOD;
for(int i=0;i<v[aj].size();i++)
if(v[aj][i]==nr)return i;
return -1;
}
void adauga(int nr){
int aj=nr%MOD;
if(cauta(nr)==-1)
v[aj].push_back(nr);
}
void sterge(int nr){
int aj=nr%MOD,iv=cauta(nr);
if(iv!=-1)
v[aj].erase(v[aj].begin()+iv);
}
int main()
{
ifstream f ("hashuri.in");
ofstream g ("hashuri.out");
f>>n;
while(n--){
f>>o>>a;
if(o==1)adauga(a);
if(o==2)sterge(a);
if(o==3)g<<(cauta(a)!=-1)<<'\n';
}
f.close ();
g.close ();
return 0;
}