Pagini recente » Cod sursa (job #1781435) | Cod sursa (job #1471768) | Cod sursa (job #845879) | Cod sursa (job #1761730) | Cod sursa (job #711540)
Cod sursa(job #711540)
#include<fstream>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
double long a[10000000];
long n;
int main ()
{
int i,j,q,f,op,m=0,z,aux;
in>>n;
for(i=1;i<=n;i++)
{ in>>op>>f;
if(op==1)
{ for(j=1;j<=m;j++)
if(a[j]==f)
{ q=1;
j=m+1;
}
if(q==0)
a[++m]=f;
}
q=0;
if(op==2)
for(j=1;j<=m;j++)
{ if(a[j]==f)
{ q=1;
z=i;
j=m+1;
}
if(q==1)
{ aux=a[z];
a[z]=a[m];
a[m]=aux;
m--;
}
}
q=0;
if(op==3)
{ for(j=1;j<=m;j++)
if(a[j]==f)
{ q=1;
j=m+1;
}
out<<q<<endl;
}
}
}