Programe C++

NOU!!!Probleme in C++ rezolvate!

1. /* sa se calculeze aria unui triunghi */
#include
#include
#include
void main()
{float a,b,c,p,A;printf("a=");scanf("%f",&a);
printf("b=");scanf("%f",&b);
printf("c=");scanf("%f",&c);
if((a>0)&&(b>0)&&(c>0))
{ if((a+b>c)&&(a+c>b)&&(b+c>a))
{ p=(a+b+c)/2;
A=sqrt(p*(p-a)*(p-b)*(p-c));
printf("A=%f",A); }
}
else printf("a=%.2f,b=%.2f,c=%.2f nu formeaza triunghi");
}

2.Sa se determine maximul dintre penultima si antepenultima cifra a unui numar.
#include
#include
void main()
{long n,x,y,max;
printf("n=");scanf("%li",&n);
x=n%100/10;
y=n%1000/100;
if(x>y) max=x;
else max=y;
printf("max=%li",max);getch();
}

3.Media aritmetica a elementelor din MATRICE care sunt pare si se gasesc sub diagonala principala.
#include
#include
void main()
{unsigned int a[10][10],m,n,i,j,ma,s,nr;
printf("introduceti nr de linii n=");
scanf("%u",&n);
printf("introduceti nr de coloane m=");
scanf("%u",&m);for(i=1;i<=n;i++)
{ for(j=1;j<=m;j++)
{ printf("A(%u,%u)=",i,j);
scanf("%u",&a[i][j]);
}
}
for(i=1;i<=n;i++) { for(j=1;j<=m;j++)
{ printf("\t %u",a[i][j]);
}
printf("\n"); }s=0;
nr=0;for(i=1;i<=n;i++)
{ for(j=1;j<=m;j++)
{ if((i>j)&&(a[i][j]%2==0))
{ s=s+a[i][j]; nr=nr+1;
ma=s/nr;
}
}
}
printf("media aritmetica este ma=%u",ma);
}

4.Media aritmetica a elementelor din sir gasite pe pozitii impare si divizibile cu 5.
#include
#include
void main()
{clrscr();
unsigned int a[100],n,nr,med,i,s;printf("\n n=");
scanf("%u",&n);
for(i=1;i<=n;i++)
{ printf("a(%u)=",i);
scanf("%u",&a[i]);
}
s=0;nr=0;
for(i=1;i<=n;i=i+2)
{ if(a[i]%5==0)
{ s=s+a[i];
nr=nr+1;
med=s/nr;
}
}
printf("med=%u",med);getch();
}

5.Nr. elementelor din SIR care sunt impare si sunt mai mari decat 15 .
#include
#include
void main()
{unsigned int a[100],n,i,nr;
printf("\n n=");scanf("%u",&n);
for(i=1;i<=n;i++)
{ printf("a(%u)=",i);
scanf("%u",&a[i]); }
nr=0;
for(i=1;i<=n;i++)
{ if((a[i]%2!=0)&&(a[i]>15)) nr=nr+1;
}
printf("numarul de elemente este nr=%u",nr);
}

6.Numarul elementelor din SIR care sunt pozitive .
#include
#include
void main()
{float a[100],i,n,nr;
printf("\n n=");
scanf("%f",&n);
for(i=1;i<=n;i++)
{ printf("a(%f)=",i);
scanf("%f",&a[i]);
}
nr=0;
for(i=1;i<=n;i++)
{ if(a[i]>0) nr=nr+1;
}
printf("numarul elementelor este nr=%f",nr);
}

7.Calculati p=1*2*3*...*n .
#include
#include
void main()
{int p,n,i;printf("n=");scanf("%i",&n);
p=1;
for(i=1;i<=n;i++) p=p*i;printf("p=%i",p);
}

8. Calculati q=1*(1+2)*(1+2+3)*...*(1+2+3+...+n)
#include
#include
void main()
{int s,n,i,q;
printf("n=");scanf("%i",&n);
q=1;
s=0;
for(i=1;i<=n;i++)
{ s=s+i; q=q*s;
}
printf("q=%i",q);
}

9.Suma elementelor unui vector de rang impar.
#include
void main()
{float a[100];
unsigned int n,i;
float s;
printf("n=");scanf("%u",&n);
for(i=1;i<=n;i++)
{printf("a(%u)=",i);
scanf("%f",&a[i]);
}
s=0;
for(i=1;i<=n;i=i+2)s=s+a[i];
printf("s=%f",s);
}

10.Calculati s=1+2+3+...+n.
#include
#include
void main()
{int i,n,s;
printf("n=");
scanf("%i",&n);
s=0;
for(i=1;i<=n;i++) s=s+i;
printf("s=%i",s);
}

11.Suma elementelor unui vector.
#include
#include
void main()
{float s,a[100];
unsigned int n,i;
printf("n=");
scanf("%u",&n);
for(i=1;i<=n;i++)
{ printf("a(%u)= ",i);
scanf("%f",&a[i]);
}
s=0;
for(i=1;i<=n;i++) s=s+a[i];
printf("s=%f",s);
}

12.Calculati s=1+3+5+...+2n-1.
#include
#include
void main()
{int s,n,i;
printf("n=");
scanf("%i",&n);
s=0;
for(i=1;i<=2*n-1;i=i+2) s=s+i;
printf("s=%i",s);
}

13.Calculati 1^+4^+7^+...+(3n-2)^
#include
#include
#include
void main()
{float n,s,i;
printf("n=");
scanf("%f",&n);
s=0;
for(i=1;i<=n;i++)s=s+(3*i-2)*(3*i-2);
printf("s=%f",s) ;
}

14. Suma elementelor dintr-un sir care sunt pozitive si divizibile cu 5.
#include
#include
void main()
{clrscr();
unsigned int a[100],n,i,s,nr;
printf("n=");
scanf("%u",&n);
for(i=1;i<=n;i++)
{ printf("a(%u)=",i);
scanf("%u",&a[i]);
}
s=0;nr=0;
for(i=1;i<=n;i++)
{ if((a[i]>0)&&(a[i]%5==0))
{ s=s+a[i]; nr=nr+1;
}
}
printf("s=%u",s);getch();
}

15. Se citeste un numar natural n de la tastatura. Daca valoarea citita are cifra unitatilor egala cu cifra zecilor se vor afisa primele doua numere naturale mai mari ca n. Altfel se va afisa cifra maxima dintre cifra zecilor si cifra unitatilor

#include
#include
void main()
{
int n,x,y,t,z;
printf("n=");scanf("%i",&n);
x=n%10;
y=n%100/10;
if(x==y)
{
z=n+1;
t=n+2;
printf("z=%i",z);
printf("t=%i",t);
}
else
if(x>y) printf("x=%i",x);
else printf("y=%i",y);
}

16. Realizati un algoritm care verifica daca un nr este impar
si aflati suma dintre cifra unitatilor si cifra zecilor.

#include
#include
void main()
{
int n,s,x,y;
printf("n=");scanf("%i",&n);
if(n%2!=0)
{
x=n%10;
y=n%100/10;
s=x+y;
printf("s=%i",s);
}
else
printf("numarul nu este impar");
}

17. Afisarea cifrelor unui nr citit de la tastatura incepand cu ultima cifra.


#include
#include
void main()
{
int n,i;
printf("n=");
scanf("%i",&n);
while(n!=0)
{
i=n%10;
n=n/10;
printf("i=%i",i);
}
getch();
}

18. /* Sortarea prin interschimbare(bubble sort) */

#include
#include
void main()
{
float aux,a[100];
unsigned int n,i,test;
printf("n=");
scanf("%u",&n);
for(i=1;i<=n;i++)
{
printf("a(%u)=",i);
scanf("%f",&a[i]);
}
do
{
test=0;
for(i=1;i<=n-1;i++)
{
if(a[i]>a[i+1])
{
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
test=1;
}
}
}
while(test!=0);
printf("\n sirul ordonat este: ");
for(i=1;i<=n;i++)
printf("\n a(%u)=%f",i,a[i]);
}

19. Nr. elementelor din SIR care sunt impare si sunt mai mari decat 15.

#include
#include
void main()
{
unsigned int a[100],n,i,nr;
printf("\n n=");
scanf("%u",&n);
for(i=1;i<=n;i++)
{
printf("a(%u)=",i);
scanf("%u",&a[i]);
}
nr=0;
for(i=1;i<=n;i++)
{
if((a[i]%2!=0)&&(a[i]>15))
nr=nr+1;
}
printf("numarul de elemente este nr=%u",nr);
}

20. Programul care determina max si min elementelor unei matrici.


#include
#include
void main()
{
unsigned int a[10][10],m,n,i,j,min,max;
printf("introduceti numarul de linii n=");
scanf("%u",&n);
printf("introduceti numarul de coloane m=");
scanf("%u",&m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("A(%u,%u)=",i,j);
scanf("%u",&a[i][j]);
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("\t %u",a[i][j]);
}
printf("\n");
}
min=a[1][1];
max=a[1][1];
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(a[i][j]>max)
max=a[i][j];
if(a[i][j]< min)
min=a[i][j];
}
}
printf("\n minimul este min=%u",min);
printf("\n maximul este max=%u",max);
getch();
}

21. Produsul elementelor din matrice care se termina in 3 si se gasesc sub diagonala principala

#include
#include
void main ()
{
unsigned int a[10][10],m,n,i,j,p;
printf("introduceti nr de linii n=");
scanf("%u",&n);
printf("introduceti nr de coloane m=");
scanf("%u",&m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("A(%u,%u)=",i,j);
scanf("%u",&a[i][j]);
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("\t %u",a[i][j]);
}
printf("\n");
}
p=1;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if((i>j)&&(a[i][j]%10==3))
p=p*a[i][j];
}
}
printf("produsul este p=%u",p);
}

22. Media aritmetica a elementelor din sir care sunt pozitive si pare

#include
#include
void main()
{
unsigned int med,s,i,nr,n,a[100];
printf("n=");
scanf("%u",&n);
for(i=1;i<=n;i++)
{
printf("a(%u)=",i);
scanf("%u",&a[i]);
}
s=0;
nr=0;
for(i=1;i<=n;i++)
{
if((a[i]%2==0)&&(a[i]>0))
{
s=s+a[i];
nr=nr+1;
med=s/nr;
}
}
printf("med=%u",med);
getch();
}

23. Suma elementelor pare ale unei matrice.

#include
#include
void main()
{
unsigned int a[10][10],n,m,i,j,s;
printf("introduceti nr de linii n=");
scanf("%u",&n);
printf("introduceti nr de coloane m=");
scanf("%u",&m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("A(%u,%u)=",i,j);
scanf("%u",&a[i][j]);
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("\t %u",a[i][j]);
}
printf("\n");
}
s=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(a[i][j]%2==0)
s=s+a[i][j];
}
}
printf("suma este s=%u",s);
getch();
}

24. Suma elementelor unei matrici.
#include
#include
void main()
{
unsigned int a[10][10],s,m,n,i,j;
printf("introduceti numarul de linii n=");
scanf("%u",&n);
printf("introduceti numarul de coloane m=");
scanf("%u",&m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("A(%u,%u)=",i,j);
scanf("%u",&a[i][j]);
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("\t %u",a[i][j]);
}
printf("\n");
}
s=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
s=s+a[i][j];
}
printf("suma este s=%u",s);
getch();
}

25. Media aritmetica a elementelor din MATRICE care se afla in intervalul [-1,9] si pe coloane pare

#include
#include
void main()
{
int a[10][10],m,n,i,j,s,ma,nr;
printf("introduceti nr de linii n=");
scanf("%i",&n);
printf("introduceti nr de coloane m=");
scanf("%i",&m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("A(%i,%i)=",i,j);
scanf("%i",&a[i][j]);
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("\t %i",a[i][j]);
}
printf("\n");
}
s=0;
nr=0;
for(i=1;i<=n;i++)
{
for(j=2;j<=m;j=j+2)
{
if((a[i][j]>=-1)&&(a[i][j]<=9))
{
s=s+a[i][j];
nr=nr+1;
ma=s/nr;
}
}
}
printf("media aritmetica este ma=%i",ma);
}

26. Media aritmetica a elementelor din SIR care sunt impare si divizibile cu 3

#include
#include
void main()
{
unsigned int a[100],n,i,s,nr,ma;
printf("n=");
scanf("%u",&n);
for(i=1;i<=n;i++)
{
printf("a(%u)=",i);
scanf("%u",&a[i]);
}
s=0;
nr=0;
for(i=1;i<=n;i++)
{
if((a[i]%2!=0)&&(a[i]%3==0))
{
s=s+a[i];
nr=nr+1;
ma=s/nr;
}
}
printf("media aritmetica este ma=%u",ma);
}

27. Media aritmetica a elementelor din SIR care se gasesc pe pozitii pare si dau la impartirea cu 5 restul 3.

#include
#include
void main()
{
unsigned int a[100],n,i,ma,nr,s;
printf("n=");
scanf("%u",&n);
for(i=1;i<=n;i++)
{
printf("a(%u)=",i);
scanf("%u",&a[i]);
}
s=0;
nr=0;
for(i=2;i<=n;i=i+2)
{
if(a[i]%5==3)
{
s=s+a[i];
nr=nr+1;
ma=s/nr;
}
}
printf("media aritmetica este ma=%u",ma);
}

28. Numarul elementelor care sunt impare si se gasesc deasupra diagonalei principale.

#include
#include
void main()
{
unsigned int a[10][10],nr,m,n,i,j;
printf("introduceti numarul de linii n=");
scanf("%u",&n);
printf("introduceti numarul de coloane m=");
scanf("%u",&m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("A(%u,%u)=",i,j);
scanf("%u",&a[i][j]);
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("\t %u",a[i][j]);
}
printf("\n");
}
nr=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if((i< j)&&(a[i][j]%2!=0))
nr=nr+1;
}
}
printf("numarul elementelor este nr=%u",nr);
getch();
}

29. Numarul elementelor din SIR care sunt negative.
#include
#include
void main()
{
float a[100],i,n,nr;
printf("\n n=");
scanf("%f",&n);
for(i=1;i<=n;i++)
{
printf("a(%f)=",i);
scanf("%f",&a[i]);
}
nr=0;
for(i=1;i<=n;i++)
{
if(a[i]<0)
nr=nr+1;
}
printf("numarul elementelor este nr=%f",nr);
}

30. Nr. elementelor din SIR care se gasesc pe pozitii pare si sunt div. cu 5.

#include
#include
void main()
{
unsigned int a[100],n,i,nr;
printf("\n n=");
scanf("%u",&n);
for(i=1;i<=n;i++)
{
printf("a(%u)=",i);
scanf("%u",&a[i]);
}
nr=0;
for(i=2;i<=n;i=i+2)
{
if(a[i]%5==0)
nr=nr+1;
}
printf("numarul de elemente este nr=%u",nr);
}

31. Se considera un numar natural n citit de la tastatura. Sa se formeze doua noi numere,
unul format din cifrele pare ale lui n iar celalalt format din cifrele impare.

#include
#include
void main()
{
int n,x,y,c;
printf("n=");scanf("%i",&n);
x=0;
y=0;
while(n!=0)
{
c=n%10;
if(c%2==0)
x=x*10+c;
else
y=y*10+c;
n=n/10;
}
printf("x=%i",x);
printf("y=%i",y);
}

32. Sa se determine numarul elementelor pozitive si pare dintr-o MATRICE.

#include
#include
void main ()
{
int a[10][10],m,n,i,j,nr;
printf("introduceti nr de linii n=");
scanf("%i",&n);
printf("introduceti nr de coloane m=");
scanf("%i",&m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("A(%i,%i)=",i,j);
scanf("%i",&a[i][j]);
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("\t %i",a[i][j]);
}
printf("\n");
}
nr=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if((a[i][j]>0)&&(a[i][j]%2==0))
nr=nr+1;
}
}
printf("numarul de elemente pozitive si pare este nr=%i",nr);
}

33. Ordonarea elementelor pare pare ale unui vector folosind metoda interschimbarii.

#include
#include
void main()
{
unsigned int n,i,test,aux,a[100];
printf("n=");scanf("%u",&n);
for(i=1;i<=n;i++)
{
printf("a(%u)=",i);
scanf("%u",&a[i]);
}
do
{
test=0;
for(i=1;i<=n-1;i++)
if(a[i]%2==0)
{
if(a[i]>a[i+1])
{
aux=a[i];
a[i]=a[i+1];
a[i+1]=aux;
test=1;
}
}
}
while(test!=0);
printf("sirul ordonat este: ");
for(i=1;i<=n;i++)
printf("\n a(%u)=%u",i,a[i]);
}

34. Suma elementelor ridicate la putere.


#include
#include
#include
void main()
{
float s,n,i;
printf("n=");scanf("%f",&n);
s=0;
for(i=1;i<=n;i++)
s=s+((-1)*pow(i-1,1))*2*i;
printf("s=%f",s);
}

35. Calculati r=(1+3+5+...+(2*n-1)/(2*4*6*...*2*n) .

#include
#include
void main()
{
float s,p,r,n,i;
printf("n=");scanf("%f",&n);
s=0;
p=1;
for(i=1;i<=n;i++)
{
s=s+(2*i-1);
p=p*2*i;
r=s/p;
}
printf("r=%f",r);
}

36. Raport:
#include
#include
void main ()
{
float n,i,s,p,r;
printf("n=");scanf("%f",&n);
s=0;
p=1;
for(i=1;i<=n;i++)
{
p=p*2*i;
s=s+(2*i-1);
r=p/s;
}
printf("r=%f",r);
}

37. Suma elementelor din matrice care sunt mai mici decat 24
si se gasesc deasupra diagonalei principale pe linii pare.

#include
#include
void main()
{
unsigned int a[10][10],m,n,i,j,s;
printf("introduceti nr de linii n=");
scanf("%u",&n);
printf("introduceti nr de coloane m=");
scanf("%u",&m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("A(%u,%u)=",i,j);
scanf("%u",&a[i][j]);
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("\t %u",a[i][j]);
}
printf("\n");
}
s=0;
for(i=2;i<=n;i=i+2)
{
for(j=i;j<=n;j++)
{
if(i < j)
{
if(a[i][j]<24)
s=s+a[i][j];
}
}
}
printf("suma este s=%u",s);
}

38. Suma elementelor din MATRICE care sunt impare si se gasesc sub diagonala principala.

#include
#include
void main()
{
unsigned int a[10][10],i,j,m,n,s;
printf("introduceti numarul de linii n=");
scanf("%u",&n);
printf("introduceti numarul de coloane m=");
scanf("%u",&m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("A(%u,%u)=",i,j);
scanf("%u",&a[i][j]);
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
printf("\t %u",a[i][j]);
}
printf("\n");
}
s=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
if(i>j)
{
if(a[i][j]%2!=0)
s=s+a[i][j];
} }
printf("suma este s=%u",s);
getch();
}

39. Suma elementelor pare ale unui vector.

#include
void main()
{
unsigned int a[100],s,n,i;
printf("n=");scanf("%u",&n);
for(i=1;i<=n;i++)
{
printf("a(%u)=",i);
scanf("%u",&a[i]);
}
s=0;
for(i=1;i<=n;i++)
if(a[i]%2==0)
{
s=s+a[i];
}
printf("s=%u",s);
}

40. Sortarea unui vector prin selectie.

#include
void main()
{
float temp,a[100];
unsigned int n,i,j;
printf("n=");
scanf("%u",&n);
for(i=1;i<=n;i++)
{
printf("a(%u)=",i);
scanf("%f",&a[i]);
}
for(i=1;i<=n-1;i++)
{
for(j=i+1;j<=n;j++)
{
if(a[i]>a[j])
{
temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
}
printf("\n sirul ordonat este: ");
for(i=1;i<=n;i++)
printf("\n a(%u)=%f",i,a[i]);
}

41. Calculati s=1/1*2+1/2*3+1/3*4+...1/n*(n+1).

#include
#include
void main()
{
float s,n,i;
printf("n=");scanf("%f",&n);
s=0;
for(i=1;i<=n;i++)
s=s+1/i*(i+1);
printf("s=%f",s);
}

42. Calculati q=1+1*2+1*2*3+...+1*2*3*...*n.

#include
#include
void main()
{
float n,p,i,q;
q=0;
p=1;
printf("n=");scanf("%f",&n);
for(i=1;i<=n;i++)
{
p=p*i;
q=q+p;
}
printf("q=%f",q);
}

43. Suma raportului.

#include
#include
void main()
{
float s,n,i;
printf("n=");scanf("%f",&n);
s=0;
for(i=1;i<=n;i++)
s=s+1/i;
printf("s=%f",s);
}

44. Suma elementelor a 2 vectori.

#include
#include
void main()
{
unsigned int a[100],b[100],i,n,s,j;
printf("n=");
scanf("%u",&n);
for(i=1;i<=n;i++)
{
printf("a(%u)=",i);
scanf("%u",&a[i]);
}
for(j=1;j<=n;j++)
{
printf("b(%u)=",j);
scanf("%u",&b[j]);
}
s=0;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
{
s=a[i]+b[j];
printf("s=%u",s);
}
getch();
}

45.Calculati s=1+3+5+...+2n-1 .

#include
#include
void main()
{
int s,n,i;
printf("n=");scanf("%i",&n);
s=0;
for(i=1;i<=n;i=i+1)
s=s+2*i-1;
printf("s=%i",s);
}




#include
#include
void main()
{
int s,n,i;
printf("n=");scanf("%i",&n);
s=0;
for(i=1;i<=2*n-1;i=i+2)
s=s+i;
printf("s=%i",s);
}