Pagini recente » Cod sursa (job #936041) | Cod sursa (job #2349827) | Cod sursa (job #2536611) | Cod sursa (job #1027847) | Cod sursa (job #1573013)
#include <bits/stdc++.h>
#define P 123457
using namespace std;
vector <int> h[P];
int n;
void inserare(int x)
{
int r, i, L;
r = x % P;
L = h[r].size();
for(i = 0; i < L; i++)
if(h[r][i] == 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(h[r][i] == x)
{
h[r][i] = h[r][L - 1];
h[r].pop_back();
}
}
bool verifica(int x)
{
int r, L, i;
r = x % P;
L = h[r].size();
for(i = 0; i < L; i++)
if(h[r][i] == x)
return true;
return false;
}
int main()
{
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int i, x, q;
fin >> n;
for(i = 1; i <= n; i++)
{
fin >> q >> x;
if(q == 1) inserare(x);
else if(q == 2) sterge(x);
else fout << verifica(x) <<"\n";
}
fin.close();
fout.close();
return 0;
}