Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- using namespace std;
- struct nod{int info;
- nod *urm;};
- nod *prim, *ultim;
- void creare_adaugare(nod *&prim, nod*& ultim)
- {
- nod *q=new nod;
- q->urm=NULL;
- cin>>q->info;
- if(prim==NULL)
- {
- prim=q;
- ultim=q;
- }
- else
- {
- ultim->urm=q;
- ultim=q;
- }
- }
- void listare()
- {
- nod *c;
- c=prim;
- while(c!=0)
- {
- cout<<c->info<<" ";
- c=c->urm;
- }
- cout<<endl;
- }
- int main()
- {
- int i,n,k=0;
- cin>>n;
- for(i=0;i<n;i++)
- creare_adaugare(prim,ultim);
- nod *c,*a;
- c=prim;
- while(c!=NULL)
- {
- if(c->info%2==1)
- {k++;
- break;}
- c=c->urm;
- }
- if(k==1)
- {a=new nod;
- a->info=4;
- a->urm=c->urm;
- c->urm=a;
- if(c==ultim)
- ultim=a;
- listare();}
- else cout<<"nu exista";
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement