Pagini recente » Cod sursa (job #1819813) | Cod sursa (job #721265) | Cod sursa (job #408202) | Borderou de evaluare (job #1569119) | Cod sursa (job #711699)
Cod sursa(job #711699)
#include<fstream>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
double long a[1000000];
long n,m=0;
int z;
int cautare(int f)
{
int i,q=0;
for(i=1;i<=m;i++)
if(a[i]==f)
{ q=1;
z=i;
i=m+1;
}
return q;
}
void inserare (int f)
{
if(cautare(f)==0)
a[++m]=f;
}
void sterge(int f)
{
int aux;
if(cautare(f)==1)
{ aux=a[z];
a[z]=a[m];
a[m]=aux;
m--;
}
}
int main()
{
int j,op,f;
in>>n;
for(j=1;j<=n;j++)
{ in>>op>>f;
if(op==1)
inserare(f);
else
if(op==2)
sterge(f);
else
if(op==3)
out<<cautare(f)<<'\n';
}
}