Pagini recente » Cod sursa (job #2555919) | Cod sursa (job #1921427) | Cod sursa (job #941038) | Cod sursa (job #579998) | Cod sursa (job #1346909)
#include <fstream>
#include <vector>
#define mod 666013
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
vector <int> v[666013];
void stergere(int x)
{
int r,j;
r=x%mod;
for (j=0;j<v[r].size();j++)
if (v[r][j]==x) v[r].erase(v[r].begin()+j);
}
bool cautare(int x)
{
int r,j;
r=x%mod;
for (j=0;j<v[r].size();j++)
if (x==v[r][j]) return 1;
return 0;
}
void adaugare(int x)
{
int r;
r=x%mod;
if (cautare(x)==false)
v[r].push_back(x);
}
int n,i,c,x;
int main()
{
f>>n;
for (i=1;i<=n;i++)
{
f>>c>>x;
if (c==1) adaugare(x);
else if (c==2) stergere(x);
else g<<cautare(x)<<'\n';
}
return 0;
}