Orar semigroup #2

Orar semigroup #2

5/9

Se citesc nr dintr-un fisier. Sa se creeze doua stive, una cu nr pare, alta cu nr impare. Sa se afiseze stivele. Sa se afiseze nr de elemente din fiecare stiva. Sa se adauge stiva elementelor pare la sfarsitul stivei celor impare.

#include<iostream>
#include<fstream>
using namespace std;
struct nod{
    int info;
    nod *urm;};
  
void afisare(nod* vf)
{if(vf==NULL)
    cout<<"Stiva goala";
while(vf!=NULL){
    cout<<vf->info<<" ";
    vf=vf->urm;}
}

int nr_el(nod* vf)
{int i=0;
while(vf!=NULL)
{i++;
vf=vf->urm;}
return i;
}

void concat(nod* vf1, nod* vf2)
{nod*p=vf1;
    while(p->urm != NULL)
        p=p->urm;
    p->urm=vf2;
}

void adaug(int x, nod* &vf)
{nod* p;
p=new nod;
p->info=x;
p->urm=vf;
vf=p;}

int main()
{nod *par=NULL,*impar=NULL;
ifstream f("date");
int x;
while(f>>x)
    if(x%2==0)
        adaug(x,par);
    else adaug(x,impar);
  
afisare(par);
cout<<endl<<nr_el(par)<<" elemente";
cout<<endl<<endl;
afisare(impar);
cout<<endl<<nr_el(impar)<<" elemente";
cout<<endl<<endl;
concat(impar,par);
afisare(impar);
}
2 copii dau cu zarul. Aruncarile fiecaruia se memoreaza in cate o stiva. Fiecare da cu zarul pana arunca 6. Cel care are mai multe puncte castiga. Afisati:
a) stiva fiecaruia

b) numarul de aruncari ale fiecaruia

c) castigatorul si punctele lui

#include<iostream>
#include<fstream>
using namespace std;
struct nod{
    int info;
    nod *urm;};
   
void afisare(nod* vf)
{if(vf==NULL)
    cout<<"Stiva goala";
while(vf!=NULL){
    cout<<vf->info<<" ";
    vf=vf->urm;}
}

int suma(nod* vf)
{int i=0;
while(vf!=NULL)
{i+=vf->info;
vf=vf->urm;}
return i;
}

void adaug(int x, nod* &vf)
{nod* p;
p=new nod;
p->info=x;
p->urm=vf;
vf=p;}

int main()
{nod *vf1=NULL,*vf2=NULL;
ifstream f("date");
int x;
f>>x;
while(x!=6)
{    adaug(x,vf1);
f>>x;}
f>>x;
while(x!=6)
{adaug(x,vf2);
f>>x;}
   
afisare(vf1);
cout<<endl<<suma(vf1)<<" puncte";
cout<<endl<<endl;
afisare(vf2);
cout<<endl<<suma(vf2)<<" puncte";
cout<<endl<<endl;
if(suma(vf1)>suma(vf2))
    cout<<"Copilul 1 cu "<<suma(vf1);
else if(suma(vf2)>suma(vf1))
    cout<<"Copilul 2 cu "<<suma(vf2);
else cout<<"=";
}

marți, 8 mai 2012 by DlMuresan
Categories: | Leave a comment

5/7

Scrieti o functie care concateneaza doua stive in prima stiva. (adresele varfurilor vor fi param. in functie)

#include<iostream>
#include<fstream>
using namespace std;
struct nod{
    int info;
    nod *urm;};
   
void afisare(nod* vf)
{while(vf!=NULL){
    cout<<vf->info<<" ";
    vf=vf->urm;}
}

void adaug(int x, nod* &vf)
{nod* p;
p=new nod;
p->info=x;
p->urm=vf;
vf=p;}

void creare(nod* &vf, char n[])
{ifstream f(n);
int x;
while(f>>x)
    adaug(x,vf);
}

void concat(nod* vf1, nod* vf2)
{nod*p=vf1;
    while(p->urm != NULL)
        p=p->urm;
    p->urm=vf2;
}

int main()
{nod *vf1=NULL,*vf2=NULL,*p;
creare (vf1,"date");
creare (vf2,"date2");
afisare(vf1);
cout<<endl;
afisare(vf2);
cout<<endl;
concat(vf1,vf2);
cout<<endl;
afisare(vf1);
}

Un fisier text contine mai multe linii de forma: POP x sau PUSH y, reprezentand operatii care trebuie executate asupra unei stive:
POP x => se scot din stiva x numere

PUSH y => se pune in stiva numarul y.

Sa se creeze o stiva asupra careia sa se efectueze toate operatiile specificate.

Sa se verifice daca la sfarsit stiva ramane vida. Obs. Daca nu se poate efectua operatia POP, programul se termina si se afiseaza EROARE.

#include<iostream>
#include<fstream>
using namespace std;
struct nod{
    int info;
    nod *urm;};

void adaug(int x, nod* &vf)
{nod* p;
p=new nod;
p->info=x;
p->urm=vf;
vf=p;}

void afisare(nod* vf)
{if(vf==NULL)
    cout<<"Stiva vida";
while(vf!=NULL){
    cout<<vf->info<<" ";
    vf=vf->urm;}
}

void POP(int x, nod* &vf)
{int i=0;
nod*p;
while(i<x)
{p=vf;
vf=vf->urm;
i++;
delete p;}
}

int main()
{nod *vf=NULL,*p,*vf2=NULL;
int x,i=0,nr=0;
char s[100];
ifstream f("date");
while(f>>s>>x)
    {if(strcmp(s,"POP")==0)
        if(x>=nr)
            {cout<<"EROARE";return 0;}
        else POP(x,vf);
    else
        if(strcmp(s,"PUSH")==0)
            adaug(x,vf);nr++;
    }
afisare(vf);
}
Fisier
PUSH 1
PUSH 1
PUSH 1
PUSH 1
PUSH 1
POP 1
PUSH 6
POP 3
PUSH 1
POP 3
Se citesc dintr-un fisier text linii de forma: elev clasa numar_absente
a) Creati 4 stive cu elevii si absentele lor, pentru fiecare nivel. (9,10,11,12)

b) Afisati numarul de absente pe nivele

c) Afisati numarul de elevi de pe fiecare nivel

Obs: clasa poate fi: 9A,9B, …12D

#include<iostream>
#include<fstream>
using namespace std;
struct nod{
    char n[20],c[4];
    int na;
    nod *urm;};

void adaug(char n[], char c[], int na, nod* &vf)
{nod* p;
p=new nod;
strcpy(p->n,n);
strcpy(p->c,c);
p->na=na;
p->urm=vf;
vf=p;}

void afisare(nod* vf)
{if(vf==NULL)
    cout<<"Stiva vida";
while(vf!=NULL){
    cout<<vf->n<<" "<<vf->c<<" "<<vf->na<<" ";
    vf=vf->urm;
cout<<endl;}
}

int nr_abs(nod* vf)
{int i=0;
    while(vf!=NULL)
{i+=vf->na;
    vf=vf->urm;}
return i;
}

int nr_el(nod* vf)
{int i=0;
while(vf!=NULL)
{i++;
vf=vf->urm;}
return i;
}

int main()
{nod *vf=NULL,*p,*vf2=NULL;
int na;
char n[20],pr[20],c[4];
nod *vf9=NULL,*vf10=NULL,*vf11=NULL,*vf12=NULL;
ifstream f("date");
while(f>>n)
{f>>c>>na;
if(strncmp(c,"9",1)==0)
    adaug(n,c,na,vf9);
else if(strncmp(c,"10",2)==0)
    adaug(n,c,na,vf10);
else if(strncmp(c,"11",2)==0)
    adaug(n,c,na,vf11);
else if(strncmp(c,"11",2)==0)
    adaug(n,c,na,vf12);
}
cout<<"Clasa 9"<<endl;
afisare(vf9);
cout<<nr_abs(vf9)<<" absente"<<endl;
cout<<nr_el(vf9)<<" elevi"<<endl;
cout<<endl;
cout<<"Clasa 10"<<endl;
afisare(vf10);
cout<<nr_abs(vf10)<<" absente"<<endl;
cout<<nr_el(vf10)<<" elevi"<<endl;
cout<<endl;
cout<<"Clasa 11"<<endl;
afisare(vf11);
cout<<nr_abs(vf11)<<" absente"<<endl;
cout<<nr_el(vf11)<<" elevi"<<endl;
cout<<endl;
cout<<"Clasa 12"<<endl;
afisare(vf12);
cout<<nr_abs(vf12)<<" absente"<<endl;
cout<<nr_el(vf12)<<" elevi"<<endl;
cout<<endl;
}

duminică, 6 mai 2012 by DlMuresan
Categories: | Leave a comment

5/4

Sa se verifice daca 2 stive sunt identice. Stivele se creeaza introducand numere pana la 0, in fiecare.

#include<iostream>
using namespace std;
struct nod{
    int info;
    nod *urm;};

void adaug(int x, nod* &vf)
{nod* p;
p=new nod;
p->info=x;
p->urm=vf;
vf=p;}

void afisare(nod* vf)
{while(vf!=NULL){
    cout<<vf->info<<" ";
    vf=vf->urm;}
}

int main()
{nod *vf1=NULL,*p,*vf2=NULL;
int x,s=0,i=0;

cin>>x;
while(x)
{adaug(x,vf1);
cin>>x;}
cin>>x;
while(x)
{adaug(x,vf2);
cin>>x;}

while(vf1!=NULL){
    if(vf1->info != vf2->info)
    {cout<<"NU"; return 0;}
    else
    vf1=vf1->urm;
    vf2=vf2->urm;}
cout<<"DA";
}

joi, 3 mai 2012 by DlMuresan
Categories: | Leave a comment

5/3

Se citesc numere din fişier într-o stivă. Să se afişeze stiva. Să se împartă stiva în două stive cu nr. egal de elemente. Dacă e nr. impar, să se şteargă elementul din mijloc.

#include<iostream>
#include<fstream>
using namespace std;
struct nod{
    int info;
    nod *urm;};

void adaug(int x, nod* &vf)
{nod* p;
p=new nod;
p->info=x;
p->urm=vf;
vf=p;}

void afisare(nod* vf)
{while(vf!=NULL){
    cout<<vf->info<<" ";
    vf=vf->urm;}
}

void separare(nod* vf, nod* &vf1)
{nod*p=vf;
int nr=0;
while(p)
{nr++;
p=p->urm;}
if(nr%2==0)
{p=vf;
for(int i=1;i<nr/2;i++)
    p=p->urm;
vf1=p->urm;
p->urm=NULL;}
else {p=vf;
for(int i=1;i<nr/2;i++)
    p=p->urm;
vf1=p->urm->urm;
nod*q=p->urm;
delete q;
p->urm=NULL;}
}

int main()
{nod *q,*vf=NULL,*p,*vf1;
int x,s=0,i=0;
ifstream f("date");
while(f>>x)
    adaug(x,vf);
//afisare(vf);

separare(vf,vf1);
afisare(vf);
cout<<endl;
afisare(vf1);
}

by DlMuresan
Categories: | Leave a comment

5/2 - Problema alocarea dinamica a memoriei

Doua variabile dinamice memoreaza DOB a doua persoane. Sa se afiseze persoana mai tanara.

#include<iostream>
using namespace std;
struct DOB{
    int a,l,z;
};

int main()
{DOB *p,*q;
p=new DOB;
q=new DOB;
cin>>(*p).a>>p->l>>p->z;
cin>>q->a>>q->l>>q->z;
if(p->a>q->a)
    cout<<"a doua persoana";
else if(p->a<q->a)
    cout<<"a doua persoana";
else if(p->l>q->l)
    cout<<"a doua persoana";
else if(p->l<q->l)
    cout<<"a doua persoana";
else if(p->z>q->z)
    cout<<"a doua persoana";
else if(p->z<q->z)
    cout<<"a doua persoana";
else cout<<"=";
delete p,q;
}
Se citesc nr de la tastatura pana la 0. Sa se creeze o stiva cu nr. Sa se afiseze stiva. Sa se afiseze suma el. Sa se afisee nr de el ale stivei. Sa se afiseze primele doua el din stiva. Sa se stearga stiva.
#include<iostream>
using namespace std;
struct nod{
    int info;
    nod *urm;};

void adaug(int x, nod* &vf)
{nod* p;
p=new nod;
p->info=x;
p->urm=vf;
vf=p;}

void afisare(nod* vf)
{while(vf!=NULL){
    cout<<vf->info<<" ";
    vf=vf->urm;}
}

int main()
{nod *vf=NULL,*p;
int x,s=0,i=0;
cin>>x;
while(x)
{adaug(x,vf);
cin>>x;}
afisare(vf);
p=vf;
while(vf!=NULL){
    s+=vf->info;
    vf=vf->urm;}
cout<<endl<<"Suma "<<s<<endl;
vf=p;
while(vf!=NULL){
    i++;
    vf=vf->urm;}
cout<<i<<" elemente in stiva"<<endl;
vf=p;
cout<<"Primele doua elemente din stiva ";
while(vf!=NULL){
    i--;
    if(i==1 || i==0)
        cout<<vf->info<<" ";
    vf=vf->urm;}
vf=p;
while(vf!=NULL)
{p=vf;
delete p;
vf=vf->urm;}
}

marți, 1 mai 2012 by DlMuresan
Categories: , , | Leave a comment