Pagini recente » Cod sursa (job #2035239) | Cod sursa (job #1001251) | Cod sursa (job #363047) | Cod sursa (job #2021284) | Cod sursa (job #1047553)
#include<iostream>
#include<fstream>
#include<vector>
using namespace std;
#define MOD 666013
long long n, op, x;
vector<int>v[MOD];
ifstream f("hashuri.in");
ofstream g("hashuri.out");
int gaseste(int x)
{
bool ok=0;
int j=x%MOD;
for(vector<int>::iterator it=v[j].begin();it!=v[j].end();it++)
if(*it == x)
ok=1;
return ok;
}
void adauga(int x)
{
if(gaseste(x)==0)
v[x%MOD].push_back(x);
}
void stergere(int x)
{
vector<int>::iterator it;
int j = x % MOD, ok=0;
for(it=v[j].begin();it!=v[j].end() && ok==0; it++)
if(*it == x)
{
v[j].erase(it);
ok=1;
}
}
int main()
{
long long i;
f>>n;
for(i=1;i<=n;i++)
{
f>>op>>x;
if(op==1)
adauga(x);
if(op==2)
stergere(x);
if(op==3)
{
g<<gaseste(x);
g<<"\n";
}
}
}