Pagini recente » Cod sursa (job #2024530) | Cod sursa (job #2023760) | Cod sursa (job #1373798) | Cod sursa (job #1357528) | Cod sursa (job #711533)
Cod sursa(job #711533)
#include<fstream>
using namespace std;
ifstream in("hashuri.in");
ofstream out("hashuri.out");
long n,m=1;
double long a[1000000];
int main()
{
int q,n,i,j,nr1,nr2,k;
in>>n;k=1;
for(i=1;i<=n;i++)
{in>>nr1;
in>>nr2;
if(nr1==1)
{q=0;
for(j=1;j<k;j++)
{if(a[j]==nr2)
q==1;
if(q==1)
break;
}
if(q==0)
{a[k]=nr2;
k++;}
}
if(nr1==2)
{for(j=1;j<k;j++)
if(a[k]==nr2)
{
q=1;
break;
}
for(j=q;j<k-1;j++)
a[j]=a[j+1];
j--;
}
q=0;
if(nr1==3)
{for(j=1;j<k;j++)
if(a[j]==nr2)
{ q=1;
j=k;}
out<<q<<endl;}
}
}