Pagini recente » Cod sursa (job #90760) | Cod sursa (job #467792) | Cod sursa (job #1852863) | Cod sursa (job #590595) | Cod sursa (job #2741675)
#include <iostream>
#include <fstream>
#include <vector>
#define prim 666013
using namespace std;
int i,n,operatie,x;
vector<int>v[666013];
void adauga(int x)
{
int y=x%prim;
for(unsigned int i=0;i<v[y].size();i++)
if(v[y][i]==x)
return;
v[y].push_back(x);
}
void sterge(int x)
{
int y=x%prim;
int index=-1;
for(unsigned int i=0;i<v[y].size();i++)
if(v[y][i]==x)
{
index = i;
break;
}
if (index==-1)
return;
v[y].erase(v[y].begin()+index);
}
int verifica(int x)
{
int y=x%prim;
for(unsigned int i=0;i<v[y].size();i++)
if(v[y][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);
if (operatie==2)
sterge(x);
if (operatie==3)
g<<verifica(x)<<endl;
}
f.close();
g.close();
return 0;
}