Pagini recente » Cod sursa (job #332272) | Cod sursa (job #2255489) | Cod sursa (job #307212) | Cod sursa (job #2694906) | Cod sursa (job #1443558)
#include<fstream>
using namespace std;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
const int N = 1000001, M = 666019;
int lst[M];
int val[N];
int urm[N];
int nr=0;
void adauga(int x)
{
int r=x%M;
nr++;
val[nr]=x;
urm[nr]=lst[r];
lst[r]=nr;
}
bool cauta(int x)
{
int p=lst[x%M];
while(p!=0)
{
if(val[p]==x)
return true;
p=urm[p];
}
return false;
}
void sterge(int x)
{
int r=x%M,p;
p=lst[r];
if(x==val[p])
{
lst[r]=urm[p];
return;
}
while(urm[p]!=0)
{
if(val[urm[p]]==x)
urm[p]=urm[urm[p]];
else
p=urm[p];
}
}
int main()
{
int n,x,o,i;
f>>n;
for(i=1;i<=n;i++)
{
f>>o>>x;
if(o==1)
adauga(x);
if(o==2)
sterge(x);
if(o==3)
g<<cauta(x)<<"\n";
}
return 0;
}