Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- ***Creare lista pana la citirea lui 0:***
- #include <iostream>
- using namespace std;
- struct nod
- {
- int info;
- nod* adr;
- };
- int n;
- void parcurgere(nod* v)
- {
- nod* c=v;
- while(c)
- {
- cout<<c->info<<" ";
- n++;
- c=c->adr;
- }
- }
- nod* creare2()
- {
- nod* prim, *ultim, *p;
- int nr;
- prim=new nod;
- ultim=prim;
- cout<<"Introduceti un numar: "; cin>>nr;
- if (nr==0)
- {
- cout<<"Lista este vida.";
- return 0;
- }
- else
- {
- prim->info=nr;
- prim->adr=NULL;
- cout<<"Introduceti un numar: "; cin>>nr;
- while(nr){
- p=new nod;
- p->info=nr;
- ultim->adr=p;
- ultim=p;
- ultim->adr=NULL;
- cout<<"Introduceti un numar: "; cin>>nr;
- };
- return prim;
- }
- }
- int main()
- {
- nod* prim;
- int k, inf;
- prim=creare2();
- parcurgere(prim);
- cout<<" numarul de noduri este "<<n;
- return 0;
- }
- ***Creare lista pana la 0 si inserare element in lista:***
- #include <iostream>
- using namespace std;
- int n;
- struct nod
- {
- int info;
- nod*leg;
- };
- nod* creare()
- {
- nod*prim,*ultim,*p;
- int nr;
- prim=new nod;
- ultim=prim;
- cout<<"Nr: ";
- cin>>nr;
- if(nr==0)
- {
- cout<<"Lista este vida";
- return 0;
- }
- else
- {
- prim->info=nr;
- prim->leg=NULL;
- cout<<"Nr: "; cin>>nr;
- while(nr)
- {
- p=new nod;
- p->info=nr;
- ultim->leg=p;
- ultim=p;
- ultim->leg=NULL;
- cout<<"Nr: "; cin>>nr;
- };
- return prim;
- }
- }
- void parcurgere(nod*prim)
- {
- nod*p;
- p=prim;
- while(p)
- {
- cout<<p->info<<" ";
- n++;
- p=p->leg;
- }
- }
- int inserare(nod* &prim, int k, int inf)
- {
- nod* q;
- if(k>n+1)
- return 0;
- else
- {
- nod* p=new nod;
- p->info=inf;
- if(k==1)
- {
- p->leg=prim;
- prim=p;
- }
- else
- if(k==n+1)
- {
- q=prim;
- while(q->leg)
- q=q->leg;
- q->leg=p;
- p->leg=NULL;
- }
- else
- {
- q=prim;
- int ct=1;
- while(ct<k-1)
- {
- q=q->leg;
- ct++;
- }
- p->leg=q->leg;
- q->leg=p;
- }
- return 1;
- }
- }
- int main()
- {
- nod* prim;
- int k,inf;
- prim=creare();
- parcurgere(prim);
- cout<<"Nr. de noduri este: "<<n;
- cout<<endl<<"Pozitia si valoarea pentru inserare: ";
- cin>>k>>inf;
- if(!inserare(prim,k,inf))
- cout<<"Pozitia introdusa nu se afla in lista!";
- else
- parcurgere(prim);
- return 0;
- }
- ***Problema grafica smiley face:***
- #include <graphics.h>
- #include <conio.h>
- #include <dos.h>
- void smiley(int x)
- {
- int r=50;
- setcolor(YELLOW);
- circle(x,200,r);
- setfillstyle(SOLID_FILL,YELLOW);
- floodfill(x,200,YELLOW);
- setcolor(BLUE);
- //ochi stanga;
- circle(x-(r/3),200-r/2,7);
- setfillstyle(SOLID_FILL,BLUE);
- floodfill(x-r/3,200-r/2,BLUE);
- //ochi dreapta
- circle(x+r/3,200-r/2,7);
- setfillstyle(SOLID_FILL,BLUE);
- floodfill(x+r/3,200-r/2,BLUE);
- //gura
- setcolor(RED);
- line(x-r/3,200+r/3,x+r/3,200+r/3);
- arc(x,200+r/3,180,360,r/3);
- setfillstyle(SOLID_FILL,RED);
- floodfill(x,200+r/3+1,RED);
- ///textr sub smiley
- outtextxy(x,200+2*r,"Smiley ");
- delay(27);
- setcolor(BLACK);
- circle(x,200,r);
- setfillstyle(SOLID_FILL,BLACK);
- floodfill(x,200,BLACK);
- //stergere ochi stanga
- circle(x-r/3,200-r/2,7);
- floodfill(x-r/3,200-r/2,BLACK);
- //stergere ochi dreapta
- circle(x+r/3,200-r/2,7);
- floodfill(x+r/3,200-r/2,BLACK);
- //stergere gura
- line(x-r/3,200+r/3,x+r/3,200+r/3);
- arc(x,200+r/3,180,360,r/3);
- setfillstyle(SOLID_FILL,BLACK);
- floodfill(x,200+r/3+1,BLACK);
- }
- using namespace std;
- int main()
- {
- initwindow(800,800);
- delay(200);
- // line(100,100,200,100);
- setcolor(YELLOW);
- int i=100;
- int j=700;
- int dir=1;
- /// bucla INFINITA
- while(i<750 && i>50)
- {
- smiley(i);
- i+=dir;
- if(i==749)
- dir=-1;
- if(i==51)
- dir=1;
- }
- /* while(i<750 && j>0)
- {
- smiley(i);
- /* setcolor(GREEN);
- rectangle(j,250,j+100,350);
- delay(10);
- setcolor(BLACK);
- circle(i,200,50);
- rectangle(j,250,j+100,350);
- i++;
- j--;
- }*/
- getch();
- closegraph();
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement