Pagini recente » Cod sursa (job #153230) | Cod sursa (job #2878679) | Cod sursa (job #2278616) | Cod sursa (job #1455673) | Cod sursa (job #2744217)
#include<vector>
#include<fstream>
using namespace std;
#define prim 999983
vector<int> v[prim];
void op1 (int x)
{ int poz=x%prim;
for(unsigned int i=0;i<v[poz].size();i++ )
if(v[poz][i]==x)
return;
v[poz].push_back(x);
}
void op2(int x)
{
int poz=x%prim;
for(unsigned int i=0;i<v[poz].size();i++)
if(v[poz][i]==x)
{
swap(v[poz][i],v[poz].back());
v[poz].pop_back();
return;
}
}
int op3(int x)
{
int poz=x%prim;
for(unsigned int i=0;i<v[poz].size();i++ )
if(v[poz][i]==x)
return 1;
return 0;
}
int main()
{ ifstream f("hashuri.in");
ofstream g("hashuri.out");
int n,nr,operatie;
f>>n;
for(int i=0;i<n;i++)
{
f>>operatie;
f>>nr;
if(operatie==1)
op1(nr);
else
if(operatie==2)
op2(nr);
else
g<<op3(nr)<<endl;
}
return 0;
}