Pagini recente » Cod sursa (job #2823368) | Cod sursa (job #410123) | Cod sursa (job #1313853) | Cod sursa (job #2790093) | Cod sursa (job #711259)
Cod sursa(job #711259)
#include<fstream>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
long n;
double long a[1000000];
int main ()
{
int op,f,q,i,j,aux,m=1;
in>>n;
for(j=1;j<=n;j++)
{
in>>op>>f;
q=0;
if(op==1)
{ a[m]=f;
m++;
}
else
if(op==2)
{ for(i=1;i<=m;i++)
if(f==a[i])
{ aux=a[m];
a[m]=a[i] ;
a[i]=aux;
}
i=m+1;
m--;
}
else
if(op==3)
{ for(i=1;i<=m;i++)
if(f==a[i])
{ q=1;
i=m+1;
}
out<<q<<'\n';
}
}
}