Teza 12.1.2011

/*Randu2.Sa se citeasca de la tastatura un vector cu n nr. int.,sa se numere toate valorile aflate
pe pozitii impare si care contin cifre nule.Scrie o functie ce citese,ce afiseaza si una ce verifica
daca nr contine 0*/
#include
void citire(int x[20],int d)
{int i;
for(i=1;i<=d;i++)
{cout<<"x["< cin>>x[i];
}
}
void afisare(int x[20],int d)
{int i;
for(i=1;i<=d;i++)
{cout< cout< }
}
int zero(int nr)
{int k=0,ok=0;
while(nr!=0)
{nr=nr%10;
nr=nr/10;
if(nr%10==0)
k++;
}
if(k!=0)
ok=1;
return ok;
}
int main()
{int a[20],i,n,k=0;
cout<<"n=";cin>>n;
citire(a,n);
afisare(a,n);
for(i=1;i<=n;i++)
if(zero(a[i])==1&&i%2==1)
k++;
cout<<"in vector s-au gasit "< return 0;
}

07.12.2010

#include
#include
int m,n;
ofstream f("numere.txt");
void citire(int x[20][20])
{int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{cout<<"x["< cin>>x[i][j];}
}
void afisare(int x[20][20])
{int i,j;
for(i=1;i<=n;i++)
{for(j=1;j<=m;j++)
cout< cout< }
}
int verific(int ok)
{int i,j,x[20][20];
ok=1;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(i%2==1&&j%2==0)
ok=0;
return ok;
}
int main()
{int i,j,a[20][20];
cout<<"n=";cin>>n;
cout<<"m=";cin>>m;
citire(a);
afisare(a);
for(i=1;i<=n;i++)
{for(j=1;j<=m;j++)
if(verific(a[i][j]==1))
f<f.close();
return 0;
}

06.12.2010 CMMDC

/*Se citeste o matrice patratica n dimensionala.Sa se calculeze suma elementelor de pe prima si
ultima linie si sa se afiseze cmmdc dintre acestea*/
#include
void citire(int x[20][20],int d)
{int i,j;
for(i=1;i<=d;i++)
for(j=1;j<=d;j++)
{cout<<"x["< cin>>x[i][j];}
}
void afisare(int x[20][20],int d)
{int i,j;
for(i=1;i<=d;i++)
{for(j=1;j<=d;j++)
cout< cout< }
}
int cmmdc(int x,int y)
{while(x!=y)
if(x>y)
x=x-y;
else
y=y-x;
return x;
}
int main()
{int a[20][20],i,j,n,s1=0,s2=0;
cin>>n;
citire(a,n);
afisare(a,n);
for(j=1;j<=n;j++)
s1=s1+a[1][j];
for(j=1;j<=n;j++)
s2=s2+a[n][j];
cout<return 0;
}

30.11.2010 Fibonacii

#include
int fibonaci(int x)
{int i,p=1,ap=1,f;
if(x==1||x==2)
return 1;
else
for(i=3;i<=x;i++)
{f=p+ap;
ap=p;
p=f;}
return f;
}
int main()
{int k,j;
cin>>k;
for(j=1;j<=k;j++)
cout< return 0;
}

29.11.2010 Afisarea Nu merge

#include
#include
int x[20][20],m;
void citire(int a[20][20],int n)
{int i,j;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{cout<<"a["< cin>>a[i][j];
}
}
int verific(char c)
{if(c>='a'&&c<='z'||c>='A'&&c<='z')
{if(c=='a'||c=='e'||c=='o'||c=='i'||c=='u')
return 1;
else
return 0;}
else
cout<<"nu s-au citit litere";
}
int main()
{int i,j,c2=0,c1=0;;
ofstream f("caractere.txt");
cin>>m;
citire(x,m);
for(i=1;i<=m;i++)
for(j=1;j<=m;j++)
if(i+j<=m)
if(verific(x[i][j])==0)
c2++;
if(i+j if(verific(x[i][j])==1)
c1++;
f< f.close();
return 0;
}

23.11.2010

#include
int invers(int x)
{int inv=0;
while(x!=0)
{inv=inv*10+x%10;
x=x/10;}
return inv;
}
int main()
{int a[20],i,n;
cin>>n;
for(i=1;i<=n;i++)
{cout<<"a["< cin>>a[i];}
for(i=1;i<=n;i++)
cout<return 0;
}

23.11.2010

#include< iostream.h >
int verificare ( int x )
{int c[10],i,j,ok,k;
j=0;
while(x!=0)
{j++;
c[j]=x%10;
x=x/10;
}
ok=0;
for(i=1;i<=j;i++)
for(j=1;j<=k;j++)
if(c[i]==c[k]&&j!=k)
ok=1;
return ok;
}
int main()
{int a[20],i,n,l;
cin>>n;
for(i=1;i<=n;i++)
{cout<<"a["<cin>>a[i];}
for(i=1;i<=n;i++)
if(verificare(a[i])==0)
l++;
cout<<"in vector sunt "<return 0;
}

22.11.2010 prime

/*Scrie un program in care sa verifici cate nr prime exista intr-un tablou unidimensional.
Folositi o functie pt citirea tabloului, una pt afisare si una pt verificare.*/
#include
void citire(int x[20], int d)
{int i;
for(i=1;i<=d;i++)
{cout< <"x["< cout<}
int prime(int nr)
{int ok=1,f;
for(f=2;f<=nr/2;f++)
if(nr%f==0)
ok=0;
return ok;
}
int main()
{int a[20],n,i,k=0;
cout< <"n=";cin> >n;
citire(a,n);
afisare(a,n);
for(i=1;i<=n;i++)
if(prime(a[i])==1)
k++;
cout< <"In vector sunt "< return 0;
}

16.11.2010 PALINDROAME

/*Verificati valorile vectorului si afisati daca sunt palindroame sau nu.*/
#include
void citire(int x[20],int d)
{int i;
for(i=1;i<=d;i++)
{cout<<"val "<cin>>x[i];}
}
void afisare(int x[20],int d)
{int i;
for(i=1;i<=d;i++)
cout<int palindroame(int nr)
{int inv,y,c;
y=nr;
inv=0;
while(y!=0)
{c=y%10;
inv=inv*10+c;
y=y/10;}
if(nr==inv)
return 1;
else
return 0;
}
int main()
{int a[20],i,n;
cin>>n;
citire(a,n);
for(i=1;i<=n;i++)
if(palindroame(a[i])==0)
cout< else
cout<return 0;
}

15.11.2010

/*Sa se citeasca si sa se afiseze un vezctor,sa se nr cate val din vector contin cifra 0.Scrie o funcite
citire,afisare si o functie prin care sa aflam daca un nr. contine o,daca nu sa faca produsul si o
functie ce calculeaza suma cifrelor impare pt val pare.*/
#include
void citire(int x[20],int d)
{int i;
for(i=1;i<=d;i++)
{cout<<"val "<cin>>x[i];}
}
void afisare(int x[20],int d)
{int i;
for(i=1;i<=d;i++)
cout<}
int verificare(int y)
{int p=1;
while(y!=0)
{p=p*y%10;
y=y/10;}
return p;
}
int suma(int y)
{int s=0;
while(x!=0)
if(x%10%2==1)
{s=s+x%10;
x=x/10;}
return s;
}
int main()
{int a[20],i,n,k=0;
cin>>n;
citire(a,n);
for(i=1;i<=n;i++)
if(verificare(a[i])==0)
k++;
for(i=1;i<=n;i++)
if(a[i]%2==0)
cout<<"In vector sunt "<return 0;

15.11.2010

*Sa se citeasca si sa se afiseze un vezctor,sa se nr cate val din vector contin cifra 0.Scrie o funcite
citire,afisare si o functie prin care sa aflam daca un nr. contine o,daca nu sa faca produsul.*/
#include
void citire(int x[20],int d)
{int i;
for(i=1;i<=d;i++)
{cout<<"val "<cin>>x[i];}
}
void afisare(int x[20],int d)
{int i;
for(i=1;i<=d;i++)
cout<}
int verificare(int y)
{int p=1;
while(y!=0)
{p=p*y%10;
y=y/10;}
return p;
}
int main()
{int a[20],i,n,k=0;
cin>>n;
citire(a,n);
for(i=1;i<=n;i++)
if(verificare(a[i])==0)
k++;
cout<<"In vector sunt "<return 0;
}

9.11.2010

/*Din fisierul numere.txt se citesc n val.Pt fiecare nr citit din acest fisier sa se scrie in
rezultat.out nr citit, spatiu si cifra cea mai mare din nr.Folosim o functie care sa afiseze
cifra cea mai mare a nr.*/
#include
#include
int maxc(int x)
{int max=0;
while(x!=0)
{if(max max=x%10;
x=x/10;
}
return max;
}
int main()
{int nr,n,i;
ifstream f("numere.txt");
ofstream g("rezultat.out");
f>>n;
for(i=1;i<=n;i++)
{f>>nr;
g< }
f.close();
g.close();
return 0;
}

cmmdc 9.11.2010

/*Scrie un program care citeste 2 nr int si calculeaza c.m.m.d.c al lor.Se va folosi un subprogram ce
primeste prin intermediul a 2 parametrii 2 val int si calculeaza c.m.m.d.c. Functia returneaza c.m.m.d.c.*/
#include
int cmmdc(int x,int y)
{while(x!=y)
if(x>y)
x=x-y;
else
y=y-x;
return x;
}
int main()
{int a,b;
cout<<"a=";cin>>a;
cout<<"b=";cin>>b;
cout<return 0;
}

Functii 8.11.2010

#include
int prime(int nr)
{int ok=1,d;
for(d=2;d if(nr%d==0)
ok=0;
return ok;
}
int main()
{int a[20],i,n,k=0;
cout<<"n=";cin>>n;
for(i=1;i<=n;i++)
{cout<<"a["< cin>>a[i];
}
for(i=1;i<=n;i++)
if(prime(a[i])==1)
k++;
cout<<"In vector sunt "<return 0;
}

01.11.2010 Ordonarea matricei pe lini si coloane

#include< iostream.h >
#include< fstream.h >
int main()
{int a[30][30],i,j,n,l,p,k,aux;
ifstream f("matrice.txt");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
cout<<"k=";cin>>k;
for(l=1;l<=n-1;l++)
for(p=l+1;p<=n;p++)
if(a[k][l]>a[k][p])
{aux=a[k][l];
a[k][l]=a[k][p];
a[k][p]=aux;}
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
cout< cout< }
return 0;
}

/*Din fisierul matrice.txt, de pe primul rand se citeste o val n iar de pe urm. randuri , val int
ale unei matrici patratice. Afisati toate nr. prime aflate pe diag principala.,daca nu sunt nr prime
afisati nu.*/
#include< fstream.h >
#include< iostream.h >
int main()
{int a[50][50],i,j,n,ok,d,k;
ifstream f("matrice.txt");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
if(i==j)
{ok=1;
for(d=2;d<=a[i][j];d++)
if(a[i][j]%2==0)
ok=0;
if(ok==1)
{k++;
cout< }
}
if(k==0)
cout<<"Nu sunt nr prime pe diag princ";
return 0;
}

/*Din fisierul matrice.txt, de pe primul rand se citeste o val n iar de pe urm randuri , val int
ale unei matrici patratice. Afisati triunghiurile laterale ce se form intre cele 2 diagoale*/
#include< fstream.h >
#include< iostream.h >
int main()
{int a[50][20],i,j,n;
ifstream f("matrice.txt");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>>a[i][j];
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
if(in+1||i>j&&i+j<=n)
cout< else
cout<<" ";
cout< }
return 0;
}

24.10.2010

/*Dine fisierul matrice.txt citim de pe primul rand o val n, de pe urm n linni si n coloane val
int. Sa se form matricea patratica si sa se verifice daca linia p este ordonata cresc.*/
#include< iostream.h >
#include< fstream.h >
int main()
{int a[50][40],n,i,j,p,ok;
ifstream f("matrice.txt");
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
f>> a[i][j];
cout << "p=";cin >> p;
ok=1;
for(j=1;j<=n;j++)
{if(a[p][j] > a[p][j+1])
ok=0;}
if(ok==0)
cout << "Elementele de pe linia p sunt ordonate cresc";
else
cout << "Elementele de pe lina p nu sunt ordonate cresc";
return 0;
}

19.10.2010 defect

/*Din fisierul mat.in se citeste un tablou bidimensional a, cu n linii si m coloane, cu slemente int,
astfel; de pe rima linie n si m dupa aceea... .Sa se determine primul element par din tabel.*/
#include< iostream.h >
#include< math.h >
#include< fstream.h >
int main()
{int a[20][20],i,n,m,j,f,p,ok;
ifstream f("mat.in")
f>>m;
f>>n;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
f>>a[i][j];
f>>a[p][j];
p=3;
j=m;
ok=0;
while(j>=1&&!ok)
{if(a[i][j]%2==1)
{cout< ok=1;}
j--;
}
if(j<1)
cout< <"nu exista numere impare";
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
if(a[i][j]%2==0)
cout< else
cout< <"nu exista numere pare";

return 0;
}

19.10.2010

/*Fie un tablou bidimensional x cu n linii si m coloane cu elemente int.sa se determine.nur elementelor subunitare
si media aritmetica a elementelor inpare.*/
#include< iostream.h >
#include< math.h >
int main()
{int x[20][20],i,n,m,j,nr,ma,s,c;
cout<<"n=";cin>>n;
cout<<"m=";cin>>m;
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
{cout< <"x< cout< <"nr elementelor subunitare este:"< return 0;
}