Pagini recente » Cod sursa (job #750715) | Cod sursa (job #1940293) | Cod sursa (job #1295625) | Cod sursa (job #2600130) | Cod sursa (job #1518770)
#include <iostream>
#include <fstream>
using namespace std;
long a[1000000];
long n;
void adaugare (int x)
{
n++;
a[n]=x;
}
int verificare (int x)
{
int i;
for(i=1; i<=n; i++)
if(a[i]==x)
return 1;
return 0;
}
void stergere (int x)
{
int i,poz,j;
for(i=1; i<=n; i++)
if(a[i]==x)
{
poz=i;
for(j=poz; j<=n-1; j++)
a[j]=a[j+1];
n--;
i--;
}
}
int main()
{
int n,op,x,i;
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f>>n;
for(i=1; i<=n; i++)
{
f>>op>>x;
if(op==1)
adaugare(x);
if(op==2)
stergere (x);
if(op==3)
g<<verificare(x)<<endl;
}
return 0;
}