Cod sursa(job #2647342)

Utilizator MihaiG09Gheorghe Mihai MihaiG09 Data 3 septembrie 2020 23:50:40
Problema BFS - Parcurgere in latime Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.97 kb
#include <iostream>

using namespace std;

struct nod{
    int info;
    nod *urm;

}*p, *u;

void MakeList()
{
    nod *c;
    c = new(nod);
    cin>>c->info;
    if(!p)
    {
        p = c;
        c->urm = 0;
        u = c;
    }
    else
    {
        u->urm = c;
        u = c;
        u->urm = 0;
    }
}

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

}


int euclid(int a, int b)
{
    int r;
    while(b)
    {
        r = a%b;
        a = b;
        b = r;
    }
    return a;
}

void sterge(nod * q)
{
    if(p == q)
    {
    	p = p -> urm;
        delete q;
    }
    else
    {
        while(p -> urm != q)
        	p = p -> urm;
        p -> urm = q -> urm;
   		delete q;
    }
}
int main()
{
    int n;
    cin>>n;
    int x;
    for(int i = 1; i<=n; i++)
        MakeList();
    cin>>x;
    numarare();
    afisare();
    return 0;
}