problema sterge ultimu

creati o lista simplu inlantuita cu cele n valori date din fisier
a) afisati continutul listei dupa ce a sters primul nr prim
b) dupa ultimul nr par din lista inserati jum. lui si afisati lista





#include <iostream>
#include <cmath>
#include <fstream>

using namespace std;

ifstream f("date.in");

struct nod
{
    int info;
    nod *urm;
};

nod *prim;

void creare()
{
    int x;
    nod *p,*nou;
    while (f>>x)
    {
        if (prim==NULL)
        {
            prim=new nod;
            prim->info=x;
            p=prim;
        }
        else
        {
            nou=new nod;
            nou->info=x;
            p->urm=nou;
            p=nou;
        }
        p->urm=NULL;
    }

}

void afisare()
{
    nod *p=prim;
    while (p)
    {
        cout<<p->info<<" ";
        p=p->urm;
    }
}

int nrprim(int x)
{
    int i;

    for (i=2;i<=sqrt(x);i++)
    if (x%i==0)
            return 0;// nu e prim

        return 1;// e prim

}

void stergere()
{
    nod *p=prim,*r,*q;

    while (nrprim(p->urm->info)!=1 && p->urm)
    p=p->urm;

    q=p->urm;
    r=q->urm;
    p->urm=r;
    delete q;
}

void inserare()
{
    nod *p=prim,*pp,*nou;
    while (p)
    {
        if (p->info%2==0)
            p=p->urm;
    }

    nou=new nod;
    nou->info=pp->info/2;
    nou->urm=pp->urm;
    pp->urm=nou;
}

int main()
{

    creare();
    inserare();
    afisare();


    return 0;
}


//varianta 2


#include <iostream>
#include <cmath>
#include <fstream>

using namespace std;

ifstream f("date.in");

struct nod
{
    int info;
    nod *urm;
};

nod *prim;

void creare()
{
    int x;
    nod *p,*nou;
    while (f>>x)
    {
        if (prim==NULL)
        {
            prim=new nod;
            prim->info=x;
            p=prim;
        }
        else
        {
            nou=new nod;
            nou->info=x;
            p->urm=nou;
            p=nou;
        }
        p->urm=NULL;
    }

}

void afisare()
{
    nod *p=prim;
    while (p)
    {
        cout<<p->info<<" ";
        p=p->urm;
    }
}

int nrprim(int x)
{
    int i;

    for (i=2;i<=sqrt(x);i++)
    if (x%i==0)
            return 0;// nu e prim

        return 1;// e prim

}

void stergere()
{
    nod *p=prim,*r,*q;

    while (nrprim(p->urm->info)!=1 && p->urm)
    p=p->urm;

    q=p->urm;
    r=q->urm;
    p->urm=r;
    delete q;
}

void inserare()
{
    nod *p=prim,*pp,*nou;
    while (p)
    {
        if (p->info%2==0)
            p=p->urm;
    }

    nou=new nod;
    nou->info=pp->info/2;
    nou->urm=pp->urm;
    pp->urm=nou;
}

int main()
{

    creare();
    inserare();
    afisare();


    return 0;
}