Cod sursa(job #1611492)
Utilizator | Data | 24 februarie 2016 10:31:24 | |
---|---|---|---|
Problema | Hashuri | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.25 kb |
#include<fstream>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
unsigned n,a[10000001],i,x,y,nr=1,p=0,k,j;
int main()
{
fin>>n;
for(i=1;i<=n;i++)
{
fin>>x>>y;
if(x==1)
{
p=1;
for(j=1;j<=nr;j++)
{
if(a[j]==y)
{
p=0;
break;
}
}
if(p==1)
{
nr++;
a[nr]=y;
}
}
if(x==2)
{
for(j=1;j<=nr;j++)
{
if(a[j]==y)
{
nr--;
for(k=j;k<=nr;k++)
{
a[j]=a[j+1];
}
break;
}
}
}
if(x==3)
{
p=0;
for(j=1;j<=nr;j++)
{
if(a[j]==y)
{
p=1;
break;
}
}
if(p==1)
fout<<1<<"\n";
else
fout<<0<<"\n";
}
}
return 0;
}