s

#include <iostream>
#include <fstream>

using namespace std;
ifstream f("lista3.txt");

struct nod{int info;
            nod *urm;};
int n,x;
void adauga_nod(nod *&prim, nod*&ultim)
{
    prim= new nod;
    ultim=prim;
    prim->info=n;
    prim->urm=NULL;
}

void adauga_ultim(nod *&ultim)
{
    nod *p=new nod;
    p->info=n;
    p->urm=NULL;
    ultim->urm=p;
    ultim= p;
}

nod *cauta(nod *p)
{
    while(p->urm!=NULL && p->urm->info!=x)
        p=p->urm;
    return p;
}

void elimina_prim(nod *&prim)
{
    nod *q=prim; prim=prim->urm; delete q;
}

void elimina_urm(nod *p)
{
    nod *q=p->urm; p->urm=p->urm->urm; delete q;
}

void afisare(nod *prim)
{
    for(nod *p=prim; p!=NULL; p=p->urm)
        cout<<p->info<<" ";
    cout<<endl;
}

int main()
{nod *prim, *ultim, *p; cout<<"x= "; cin>>x;
f>>n; adauga_nod(prim, ultim);
while(f>>n)
    adauga_ultim(ultim);
f.close();
if(prim->info==x) elimina_prim(prim);
else {p=cauta(prim);
    if(p->urm!=NULL) elimina_urm(p);}
    afisare(prim);
    return 0;