Pagini recente » Cod sursa (job #3181832) | Cod sursa (job #2403706) | Cod sursa (job #541329) | Cod sursa (job #1324266) | Cod sursa (job #2254496)
#include <bits/stdc++.h>
#define P 777013
using namespace std;
vector <int> h[P];
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int Cauta(int x)
{
int r;
r = x % P;
for(auto v : h[r])
if(v == x) return 1;
return 0;
}
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 main()
{
int i, o, n, N;
fin >> N;
for(i = 1; i <= N; i++)
{
fin >> o >> n;
if(o == 1) Adauga(n);
else if(o == 2) Sterge(n);
else if(o == 3) fout << Cauta(n) << "\n";
}
fin.close();
fout.close();
return 0;
}