Pagini recente » Cod sursa (job #1606276) | Cod sursa (job #1338198) | Cod sursa (job #1405269) | Cod sursa (job #472150) | Cod sursa (job #1919977)
#include <bits/stdc++.h>
#define p 123457
using namespace std;
ifstream fin ("hashuri.in");
ofstream fout ("hashuri.out");
vector <int> a[p];
int n;
void Adauga(int x)
{
int r;
r=x%p;
a[r].push_back(x);
}
void Sterge(int x)
{
int r, i, lung;
r=x%p;
lung=a[r].size();
for (i=0; i<lung; i++)
if (a[r][i]==x)
{
a[r][i]=a[r].back();
a[r].pop_back();
return;
}
}
int Cauta(int x)
{
int i, lung, r;
r=x%p;
lung=a[r].size();
for (i=0; i<lung; i++)
if (a[r][i]==x)
return 1;
return 0;
}
void Citire()
{
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 fout << Cauta(x) << "\n";
}
}
int main()
{
Citire();
fin.close();
fout.close();
return 0;
}