elim_prime

#include <fstream>
using namespace std;
ifstream f("elim_prime.in");
ofstream g("elim_prime.out");
struct nod{
    int info;
    nod *urm;
};
nod prim,p;
int n,x;

void adaugare(nod *&p,int x)
{
  if(p)
  {
    nod *u=p;
    while(u->urm)
      u=u->urm;
    nod *nou=new nod;
    nou->info=x;
    nou->urm=0;
    u->urm=nou;
  }
  else
  {
    p=new nod;
	p->info=x;
	p->urm=0;
  }
}

void sterge(nod * & p)
{
    nod *prim=p;
    while(p->urm->urm) // Daca elementul situat dupa elementul curent este par, il vom sterge
    {
        if(p->urm->info%2==0)
        {
            nod *t=p->urm;
            p->urm=t->urm;
            delete t;
        }
        else
            p=p->urm;
    }
    if(p->urm->info%2==0) // Analizam si ultimul element
    {
        nod *t=p->urm;
        p->urm=NULL;
        delete t;
    }
    p=prim; // retinem in p adresa primului element
    if(prim->info%2==0) // Analizam si primul element
    {
        p=prim->urm;
        delete prim;
    }
}



int main()
{
    f>>n;
    f>>x,adaugare(p,x);
    prim=p;
    for(int i=1;i<=n;++i)
        f>>x,adaugare(p,int x)
    return 0;
}