Răspuns:
#include <iostream>
using namespace std;
struct nod{int info;
nod *next;};
void pune(nod* &v,nod* &sf,int x)
{nod *c;
if(!v)
{v=new nod;
v->info=x;
v->next=0;
sf=v;}
else
{c=new nod;
sf->next=c;
c->info=x;
sf=c;
sf->next=0;}
}
void afisare(nod *v)
{nod *c;
c=v;
while(c)
{cout<<c->info<<" ";
c=c->next;}
}
int main()
{
int a,b,num;
nod *varf=0,*ultim=0;//varful si ultimul element al cozii
cin >> a >> b;
for (num=a; num<=b; ++num)
{
pune(varf,ultim,num);
}
afisare(varf);
}
Explicație:
a, b pot fi şi negative
