Pagini recente » Cod sursa (job #1057846) | Istoria paginii runda/concurs_9_17 | Cod sursa (job #311218) | Istoria paginii runda/o-n_logan | Cod sursa (job #1796906)
#include <bits/stdc++.h>
#define p 1000003
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
vector<int>h[p];
int n;
void Inserare(int x)
{
int i,k,r;
r=x%p;
k=h[r].size();
for(i=0;i<k;i++)
if(h[r][i]==x)
return;
h[r].push_back(x);
}
void Stergere(int x)
{
int i,k,r;
r=x%p;
k=h[r].size();
for(i=0;i<k;i++)
if(h[r][i]==x)
{
swap(h[r][k-1],h[r][i]);
h[r].pop_back();
return;
}
}
int Gasire(int x)
{
int i,k,r;
r=x%p;
k=h[r].size();
for(i=0;i<k;i++)
if(h[r][i]==x)
return 1;
return 0;
}
int main()
{
int i,op,x,y;
fin>>n;
for(i=1;i<=n;i++)
{
fin>>op>>x;
if(op==1)
Inserare(x);
else if(op==2)
Stergere(x);
else
{
y=Gasire(x);
fout<<y<<"\n";
}
}
return 0;
}