Cod sursa(job #2206101)
Utilizator | Data | 21 mai 2018 09:37:54 | |
---|---|---|---|
Problema | Hashuri | Scor | 30 |
Compilator | cpp | Status | done |
Runda | Arhiva educationala | Marime | 1.44 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("hashuri.in");
ofstream fout("hashuri.out");
int n,q,v[1000005],nr,x,ok,i,j,k,aux;
int main()
{
fin>>n;
nr=0;
for(i=1;i<=n;i++)
{
fin>>q;
if(q==1)
{
fin>>x;
ok=0;
for(j=1;j<=nr;j++)
{
if(v[j]==x)
{
ok=1;
break;
}
}
if(ok==0)
{
nr++;
v[nr]=x;
}
}
if(q==2)
{
fin>>x;
ok=0;
for(j=1;j<=nr;j++)
{
if(v[j]==x)
{
for(k=j;k<=nr-1;k++)
{
v[k]=v[k+1];
}
nr--;
}
}
}
if(q==3)
{
fin>>x;
ok=0;
for(j=1;j<=nr;j++)
{
if(v[j]==x)
{
ok=1;
break;
}
}
if(ok==0)
{
fout<<0<<"\n";
}
else
{
fout<<1<<"\n";
}
}
}
fin.close();
fout.close();
return 0;
}