Pagini recente » Cod sursa (job #2400028) | Cod sursa (job #723616) | Cod sursa (job #2563424) | Cod sursa (job #2582937) | Cod sursa (job #2254497)
#include <bits/stdc++.h>
#define P 123457
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
vector <int> h[P];
int n;
void Adauga (int x)
{
int r;
r = x % P;
for (auto w : h[r])
if (w == x) return;
h[r].push_back(x);
}
void Sterge (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 w : h[r])
if (w == x) return 1;
return 0;
}
int main()
{
int i, op, x;
fin >> n;
for (i = 1; i <= n; i++)
{
fin >> op >> x;
if (op == 1)
Adauga(x);
else if (op == 2)
Sterge(x);
else
if (Cauta(x))
fout << "1\n";
else
fout << "0\n";
}
return 0;
}