Pagini recente » Cod sursa (job #1370904) | Cod sursa (job #2527107) | Cod sursa (job #1677357) | Cod sursa (job #2926929) | Cod sursa (job #1518774)
#include <iostream>
#include<fstream>
using namespace std;
void adaugare(int v[100000],int &n,int x)
{
n++;
v[n]=x;
}
void stergere(int v[100000],int &n,int x)
{
int i,j,poz,aux;
for(i=1;i<=n;i++){
if(v[i]==x){
poz=i;
aux=v[poz];
for(j=poz;j<=n-1;j++)
v[j]=v[j+1];
n--;
}
}
}
int verificare(int v[100000],int n,int x)
{
int i;
for(i=1;i<=n;i++)
if(v[i]==x){
return 1;
}
return 0;
}
int main()
{
int i,x,y,n,N,v[100000];
ifstream f("hashuri.in");
ofstream g("hashuri.out");
f>>N;
n=0;
for(i=1;i<=N;i++){
f>>x>>y;
if(x==1)
adaugare(v,n,y);
else if(x==2)stergere(v,n,y);
else if(x==3)g<<verificare(v,n,y)<<endl;
}
}