tema info 20.05

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

using namespace std;

ifstream f("date.in");

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

nod *prim;


void creare()
{
   nod *p,*nou;
   int x;
   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)
{
    nod *q=p;
    while (q)
    {
        cout<<q->info<<" ";
        q=q->urm;
    }
}

void afisare_pare(nod *p)
{
    nod *q=p;
    while (q)
    {
        if (q->info%2==0)
        cout<<q->info<<" ";
        q=q->urm;
    }
}

int nr_prim(int x)
{
  int i,ok=0;
  if (x==0 || x==1)
        return 0; // nu e prim
  for (i=2;i<=sqrt(x);i++)
    if (x%i==0)
    ok=1;

  if (ok==1)
    return 0;// nu e prim
  return 1;// e prim
}

void inserare_prim(nod *prim)
{
    nod *p=prim,*nou;
    int x=2020;
    while (nr_prim(p->info)==0)
        p=p->urm;

    nou=new nod;
    nou->info=x;
    nou->urm=p->urm;
    p->urm=nou;

}

void stergere_primul_par()
{
    nod *p=prim,*q,*r;
     if (p->info%2==0)
        {
        prim=prim->urm;
        delete p;
        }
        else
        {
            while (p->urm->info%2!=0 && p->urm!=NULL)
                p=p->urm;
            q=p->urm;
            r=p->urm->urm;
            p->urm=r;
            delete q;
        }
}

void stergere_ultimul_par()
{
    nod *p=prim,*q,*r;
    while (p->urm->urm)
    {
        p=p->urm;
    }
   if(p->urm->info%2==0)
   {
       q=p->urm;
       delete q;
       p->urm=NULL;
   }
   else
   {
       // NU STIU
   }
}

void inserare_val_cons()
{
    nod *nou,*p=prim;
    while (p->urm)
    {
        if (p->info==p->urm->info)
        {
            nou=new nod;
            nou->info=p->info*2;
            nou->urm=p->urm;
            p->urm=nou;

        }

            p=p->urm;
    }
}

int fv[9];

int cifre_distincte(int x)
{
    int i,ok=0;
    while (x)
    {
        fv[x%10]++;
        x=x/10;
    }

for (i=0;i<=9;i++)
    if (fv[i]>1)
    ok=1;

        if (ok==0)
        return 0;// are doar cifre disticnte
return 1; // nu are doar cifre distincte


}

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

if (cifre_distincte(p->info)==0)
{
    prim=prim->urm;
    delete p;
}

p=prim;

    while (p->urm)
    {
        if (cifre_distincte(p->urm->info)==0)
        {
            q=p->urm;
            r=p->urm->urm;
            p->urm=r;
            delete q;
        }
        p=p->urm;
    }

}

int main()
{
creare();
stergere_distincte();
afisare(prim);




    return 0;
}