Pagini recente » Cod sursa (job #2864385) | Cod sursa (job #3218338) | Cod sursa (job #715323) | Cod sursa (job #738810) | Cod sursa (job #2741908)
#include <iostream>
#include <fstream>
#include <vector>
#define prim 1000007
using namespace std;
int i,n,operatie,x;
vector<int>v[1000013];
void adauga(int x)
{
int k=x%prim;
for(unsigned int i=0;i<v[k].size();i++)
if(v[k][i]==x)
return;
v[k].push_back(x);
}
void sterge(int x)
{
int k=x%prim;
for(unsigned int i=0;i<v[k].size();i++)
if(v[k][i]==x)
{
v[k].erase(v[k].begin()+i);
return;
}
}
int verifica(int x)
{
int k=x%prim;
for(unsigned int i=0;i<v[k].size();i++)
if(v[k][i]==x)
return 1;
return 0;
}
int main()
{
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f>>n;
for (i=0;i<n;i++)
{
f>>operatie>>x;
if (operatie==1)
adauga(x);
else if (operatie==2)
sterge(x);
else g<<verifica(x)<<endl;
}
f.close();
g.close();
return 0;
}