Pagini recente » Cod sursa (job #1447963) | Cod sursa (job #2590927) | Cod sursa (job #6636) | Cod sursa (job #2686247) | Cod sursa (job #711682)
Cod sursa(job #711682)
#include<fstream>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
long a[10000000],n;
int main ()
{
int i,j,op,f,q,aux,m=0,z;
in>>n;
for(i=1;i<=n;i++)
{ in>>op>>f;
if(op==1)
{ q=0;
for(j=1;j<=m;j++)
if(f==a[j])
{ q=1;
j=m+1;
}
if(q==0)
a[++m]=f;
}
else
if(op==2)
{ q=0;
for(j=1;j<=m;j++)
if(a[j]==f)
{ q=1;
z=j;
j=m+1;
}
if(q==1)
{ aux=a[m];
a[m]=a[z];
a[z]=aux;
m--;
}
}
else
if(op==3)
{ q=0;
for(j=1;j<=m;j++)
if(a[j]==f)
q=1;
out<<q<<'\n';
}
}
}