Pagini recente » Cod sursa (job #2493943) | Cod sursa (job #2291480) | Cod sursa (job #2419139) | Cod sursa (job #2324448) | Cod sursa (job #2254506)
#include <bits/stdc++.h>
#define P 777013
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector <int> h[P];
int N, op, x;
void Adauga(int x)
{
int r;
r = x % P;
for(auto w : h[r])
if(w == r) return;
h[r].push_back(x);
}
void Stergere(int x)
{
int r, L, i;
r = x % P;
L = h[r].size();
for(i = 0; i < L; i++)
if(x == h[r][i])
{
h[r][i] = h[r][L - 1];
h[r].pop_back();
return;
}
}
int Cauta(int x)
{
int r;
r = x % P;
for(auto v: h[r])
if(v == x) return 1;
return 0;
}
int main()
{
int i;
fin >> N;
for(i = 0; i < N; i++)
{
fin >> op >> x;
if(op == 1) Adauga(x);
else if(op == 2) Stergere(x);
else fout << Cauta(x) << "\n";
}
fin.close();
fout.close();
return 0;
}