1) Fie m un numr ntreg, 10 < m < 1000.

Aflai ultima
1

cifr a sumei -1 + 2 - 3 + 4 -+ m .
#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{
int m,i,x,y; float s;
scanf("%d",&m);s=0;
for(i=1;i<=m;i++)
s=s+pow((-1),i)*pow(i,i);
x=s; y=x%10;
if (y<0) y*=-1;
printf( "%d", y);
getch();}

2) Fie r un numr ntreg, 10 < r < 1000. Aflai penultima

cifr a sumei -11 + 22 - 33 + 44-+ rr.
#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{ int m,i,x,y; float s;
scanf("%d",&m);s=0;
for(i=1;i<=m;i++)
s=s+pow((-1),i)*pow(i,i);
x=s; y=x/10;
x=y%10;
if (x<0) x*=-1;
printf( "%d", x);
getch();}

pentru n intre 10 si 1000 nu merge

#include<conio.h>
#include<stdio.h>
#include<math.h>
int p(int);
main(){
int n,i,k,s1,s2;
i=1;
printf("introduceti un nr 10<n<1000,n=");
scanf("%d",&n);
s1=0;
s2=0;
for(;i<=n;i++)
{
if(i%2==0) s1=s1+p(i);
else
s2=s2+p(i);
}
if(n%2==0)
{
if(s1>s2)
k=(s1-s2)-((s1-s2)/10)*10;
else
{
s1=10000+s1;
k=(s1-s2)-((s1-s2)/10)*10;
}
}
else
{
if(s2>s1) k=(s2-s1)-((s2-s1)/10)*10;
else
{
s2=10000+s2;
k=(s2-s1)-((s2-s1)/10)*10;
}
}
printf("ultima cifra a sumei -1+2*2-3*3*3... este:%d",k);
getch();
}
int p(int i)
{

int r,
k=1;
r=1;
for(;k<=i;k++)
{
r=r*i;
r=r-r/10*10;
}
return r;
}

3) Fie un cuvnt B ce conine cel puin o vocal. Aflai care 4) Fie s un numr ntreg, 10 < s < 1000. Aflai ultimele 2
liter din alfabet urmeaz dup vocala de cod minim din
cuvntul dat.
#include<conio.h>
#include<stdio.h>
#include<string.h>
main()
{
char s[50];int i,m,a[50],min;
gets(s);
i=0; m=0;
while(s[i]!='\0'){
if((s[i]=='a')||(s[i]=='e')||(s[i]=='o')||(s[i]=='i')
||(s[i]=='u')||(s[i]=='A')||(s[i]=='E')||(s[i]=='O')||(s[i]=='I')||
(s[i]=='U'))
a[m++]=s[i]; i++;}
min=a[0];
for(i=0;i<m;i++)
if(min>a[i]) min=a[i];
printf("Vocala cu codul minim in acest cuvint este %c, dupa ea
urmeaza litera %c ",min,min+1);
getch();}

cifre ale sumei -11 + 22 - 33 + 44-+ ss.

5) Fie m un numr ntreg, 10 < m < 1000. Aflai produsul

6) Fie n mulimi de numere ntregi consecutive A1, A2,

ultimelor 2 cifre ale sumei -11 + 22 - 33 + 44-+ mm.

#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{
int m,i,x,y,ul,pen; float s;
scanf("%d",&m);s=0;
for(i=1;i<=m;i++)
s=s+pow((-1),i)*pow(i,i);
x=s;
ul=x%10;
y=x/10;
pen=y%10;
if (ul<0) ul*=-1;
if (pen<0) pen*=-1;
printf( "%d",pen*ul);
getch();}

A3, ..., An. Aflai intersecia acestor mulimi.

#include <stdio.h>
#include <conio.h>
#include <string.h>
main()
{
int i,min[130],max[30],n,in,ax;

pentru n intre 10 si 1000 nu merge

#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{
int m,i,x,y,ul,pen; float s;
scanf("%d",&m);s=0;
for(i=1;i<=m;i++)
s=s+pow((-1),i)*pow(i,i);
x=s;
ul=x%10;
y=x/10;
pen=y%10;
if (ul<0) ul*=-1;
if (pen<0) pen*=-1;
printf( "%d , %d",pen,ul);
getch();}

pentru n intre 10 si 1000 nu merge

printf ("Dati nr. de multimi intregi:",n);

scanf("%d",&n);
for (i=0;i<n;i++)
{
printf("\nValorile %d multimi:\n",i+1);
printf("min:");
scanf("%d",&min[i]);
printf("max:");
scanf("%d",&max[i]);
if (max[i]<min[i]) {printf ("Multime imposibila\n"); i--;}
}
in=min[0];
ax=max[0];
for (i=0;i<n;i++){
if (in<min[i]) in=min[i];
if (ax>max[i]) ax=max[i];

}
if (in>ax) printf("Intesectia multimilor este multimea vida");
else
{
printf("\nIntesectia multimelor este:");
for (i=in;i<ax;i++)
printf("%d",i);
}
getch();
}

7) Fie n mulimi de numere ntregi consecutive A1, A2, A3, 8) Fie n mulimi de numere ntregi consecutive A1, A2,
..., An. Aflai reuniunea acestor mulimi.
#include <stdio.h>
#include <conio.h>
#include <string.h>
main()
{
int i,min[130],max[30],n,in,ax,j,re[100],re2[100],z,l,k;

A3, ..., An. Verificai dac aceste mulimi sunt incluse una
n alta, adic A1 A2 A3 ... An.

printf ("Dati nr. de multimi intregi:",n);

scanf("%d",&n);
for (i=0;i<n;i++)
{
printf("\nValorile %d multimi:\n",i+1);
printf("min:");
scanf("%d",&min[i]);
printf("max:");
scanf("%d",&max[i]);
if (max[i]<min[i]) {printf ("Multime imposibila\n"); i--;}
}
in=min[0];
ax=max[0];
for (i=0;i<n;i++)
{
if (in>min[i]) in=min[i];
if (ax<max[i]) ax=max[i];
}
if (in>ax) printf("Intesectia multimilor este multimea vida");
else
{
printf("\nIntesectia multimelor este:");
for (i=in;i<=ax;i++)
printf("%d",i);
}
getch();
}

9) Fie n mulimi de numere ntregi consecutive A1, A2, A3, 10) Fie o matrice m*m. Aflai produsul scalar al
..., An. Aranjai aceste mulimi n ordinea cresctoare dup
numrul de elemente.
#include <stdio.h>
#include <conio.h>
#include <string.h>

diagonalei principale cu prima coloan.

#include<conio.h>
#include<string.h>
#include<stdio.h>
main()
{ int m,i,j, v[50][50],ps=0;

main()
{
int i,min[30],max[30],n,in,ax,j,k,s[20],p[20],temp,c,g;
printf ("Dati nr. de multimi intregi:",n);
scanf("%d",&n);
for (i=0;i<n;i++)
{
printf("\nValorile %d multimi:\n",i+1);
printf("min:");
scanf("%d",&min[i]);
printf("max:");
scanf("%d",&max[i]);
if (max[i]<min[i]) {printf ("Multime imposibila\n"); i--;}
}
for (i=0;i<n;i++)
{ k=0;
for (j=min[i];j<=max[i];j++)
k++;
s[i]=k;
}

printf("Dati m:");
scanf("%d",&m);
for(i=0;i<m;i++)
for(j=0;j<m;j++)
{ printf("v[%d][%d]=",i,j);
scanf("%d",&v[i][j]); }
printf("Matricea:\n");
for(i=0;i<m;i++)
{ for(j=0;j<m;j++)
printf("%d ",v[i][j]);
printf("\n"); }
for(i=0;i<m;i++)
ps+=v[i][i]*v[i][0];
printf("\nProdusul scalar este: %d",ps);
getch(); }

for (i=0;i<n-1;i++)
for (j=i+1;j<n;j++)
if (s[i]>s[j])
{
temp=s[i];
s[i]=s[j];
s[j]=temp;
}
for (c=0;c<n;c++)
{
for (i=0;i<n;i++)
{ k=0;
for (j=min[i];j<=max[i];j++)
k++;
if (s[c]==k)
{printf ("\n");for (g=min[i];g<=max[i];g++)
printf("%d",g);
}
}
}
printf ("\n");
for (i=0;i<n;i++)
printf ("%d,",s[i]);
getch();
}

11) Fie o matrice y*y. Aflai produsul scalar al primei linii 12) Fie o matrice d*d. Aflai produsul scalar al primei
cu diagonala principal.
#include<conio.h>
#include<string.h>
#include<stdio.h>
main()

coloane cu ultima coloan.

#include<conio.h>
#include<string.h>
#include<stdio.h>
main()

{ int m,i,j, v[50][50],ps=0;

printf("Dati m:");
scanf("%d",&m);
for(i=0;i<m;i++)
for(j=0;j<m;j++)
{ printf("v[%d][%d]=",i,j);
scanf("%d",&v[i][j]); }
printf("Matricea:\n");
for(i=0;i<m;i++)
{ for(j=0;j<m;j++)
printf("%d ",v[i][j]);
printf("\n"); }
for(i=0;i<m;i++)
ps+=v[i][i]*v[0][i];
printf("\nProdusul scalar este: %d",ps);
getch(); }

{ int m,i,j, v[50][50],ps=0;

printf("Dati m:");
scanf("%d",&m);
for(i=0;i<m;i++)
for(j=0;j<m;j++)
{ printf("v[%d][%d]=",i,j);
scanf("%d",&v[i][j]); }
printf("Matricea:\n");
for(i=0;i<m;i++)
{ for(j=0;j<m;j++)
printf("%d ",v[i][j]);
printf("\n"); }
for(i=0;i<m;i++)
ps+=v[i][m-1]*v[i][0];
printf("\nProdusul scalar este: %d",ps);
getch(); }

13) Fie o matrice s*s. Aflai produsul scalar al liniei 2 cu

14)Fie x un vector coloan i y un vector linie cu acelai

linia 3.
#include<conio.h>
#include<string.h>
#include<stdio.h>
main()
{ int m,i,j, v[50][50],ps=0;
printf("Dati m:");
scanf("%d",&m);
while(1)
{ if(m<3)
{ printf("Produsul scalar a liniei 2 cu 3 nu poate fi calculat,
matricea trebuie sa aiba\ncel putin 3*3:\n");
scanf("%d",&m);}
else
break; }
for(i=0;i<m;i++)
for(j=0;j<m;j++)
{ printf("v[%d][%d]=",i,j);
scanf("%d",&v[i][j]); }
printf("Matricea:\n");
for(i=0;i<m;i++)
{ for(j=0;j<m;j++)
printf("%d ",v[i][j]);
printf("\n"); }
for(i=0;i<m;i++)
ps+=v[1][i]*v[2][i];
printf("\nProdusul scalar este: %d",ps);
getch(); }

numr de elemente. Aflai matricea A = y * x.

#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{int x[50][1],y[1][50],i,n; long A;
printf("n=");
scanf("%d",&n);
printf("dati elementele vectorului coloana x");
for (i=0;i<n;i++)
scanf("%d",&x[i][0]);
printf("dati elementele vectorului linie y");
for (i=0;i<n;i++)
scanf("%d",&y[0][i]);
A=0;
for (i=0;i<n;i++)
A=A+x[i][0]*y[0][i];
printf( "A=y*x=%ld", A);
getch();}

15) Fie un vector Z. Aflai dac elementele lui formeaz o 16) Fie un vector Q. Aflai dac elementele lui formeaz
progresie aritmetic.
#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{int Z[50],a,i,k,n;
printf("n=");
scanf("%d",&n);
printf("dati elementele vectorului Z");
for (i=0;i<n;i++)
scanf("%d",&Z[i]);
a=Z[1]-Z[0];

o progresie geometric.
#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{int i,k,n;float Q[30],a;
printf("n=");
scanf("%d",&n);
printf("dati elementele vectorului Q");
for (i=0;i<n;i++)
scanf("%f",&Q[i]);
a=Q[1]/Q[0];

k=2;
for (i=1;i<n;i++)
if ((Z[i]+a)==Z[i+1]) k++;
if (k==n)
printf( "Elementele vectorului Z formeaza o progresie
aritmetica");
else printf( "Elementele vectorului Z nu formeaza o progresie
aritmetica");
getch();}

k=2;
for (i=1;i<n;i++)
if ((Q[i]*a)==Q[i+1]) k++;
if (k==n)
printf( "Elementele vectorului Q formeaza o progresie
geometrica");
else printf( "Elementele vectorului Q nu formeaza o progresie
geometrica");
getch();}

17) Fie un vector R. Aflai dac elementele lui formeaz

18) Fie un vector R. Aflai suma tuturor elementelor care

un ir strict scresctor.
#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{
int i,j,k,n,R[30],a;
printf("n=");
scanf("%d",&n);
printf("dati elementele vectorului R:");
for (i=0;i<n;i++)
scanf("%d",&R[i]);
k=0;
for (i=1;i<n;i++)
if (R[i]>R[i-1]) k++;
if (k==n-1)
printf( "Elementele vectorului R formeaza un sir strict
crescator");
else printf( "Elementele vectorului R nu formeaza un sir strict
crescator");
getch(); }

nu se mpart la 37

19) Fie un vector V. Aflai produsul tuturor elementelor

20) Fie un vector H. Aflai suma resturilor ce se obin la

care au restul 3 cnd sunt mprite la 4.

#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{
int i,n,V[30],p;
printf("n=");
scanf("%d",&n);
printf("dati elementele vectorului V:");
for (i=0;i<n;i++)
scanf("%d",&V[i]);
p=1;
for (i=0;i<n;i++)
if (V[i]%4==3) p*=V[i];
printf("p= %d",p);
getch();
}

mprirea elementelor lui H la 11.

#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{
int i,n,H[30],s;
printf("n=");
scanf("%d",&n);
printf("dati elementele vectorului H:");
for (i=0;i<n;i++)
scanf("%d",&H[i]);
s=0;
for (i=0;i<n;i++)
s+=(H[i]%11);
printf("s = %d",s);
getch();
}

21) Fie un vector Q. Aflai cte resturi diferite se vor

22) Fie un cuvnt S ncepe cu o consoan i conine cel

obine la mprirea elementelor lui Q la 11.

#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{

puin o vocal. Aflai care litera din alfabet preced vocala

de cod minim din cuvntul dat.
#include<conio.h>
#include<stdio.h>
#include<string.h>
main()

#include<conio.h>
#include<stdio.h>
#include<math.h>
main()
{
int i,n,R[30],s;
printf("n=");
scanf("%d",&n);
printf("dati elementele vectorului R:");
for (i=0;i<n;i++)
scanf("%d",&R[i]);
s=0;
for (i=0;i<n;i++)
if (R[i]%37) s+=R[i];
printf("s= %d",s);
getch();
}

int i,n,Q[30],H[30],k,j;
printf("n=");
scanf("%d",&n);
printf("dati elementele vectorului Q:");
for (i=0;i<n;i++)
scanf("%d",&Q[i]);
for (j=0;j<11;j++)
H[j]=0;
for (i=0;i<n;i++)
for (j=1;j<11;j++)
if ((Q[i]%11)==j) H[j]=j;
k=0;
for (j=0;j<11;j++)
if (H[j]>0) k++;
for (i=0;i<n;i++)
if ((Q[i]%11)==0){k++;break;}
printf("k = %d",k);
getch();
}

{char s[50];int i,m,a[50],min;

gets(s);
i=0;
m=0;
while(s[i]!='\0'){
if((s[i]=='a')||(s[i]=='e')||(s[i]=='o')||(s[i]=='i')
||(s[i]=='u')||(s[i]=='A')||(s[i]=='E')||(s[i]=='O')||(s[i]=='I')||
(s[i]=='U'))
a[m++]=s[i];
i++;}
min=a[0];
for(i=0;i<m;i++)
if(min>a[i]) min=a[i];
if((min==65)||(min==97))
printf("litera care preceda vocala %c nu exista ",min);
else
printf("Vocala cu codul minim in acest cuvint este %c,
inaintea ei este litera %c ",min,min-1);
getch(); }

23) Fie un cuvnt S, adic un ir de caractere. Aflai cte

24) Fie un cuvnt Q, adic un ir de caractere. Aflai cte

vocale diferite conine cuvntul S.

#include<conio.h>
#include<stdio.h>
#include<string.h>
main()
{char s[50], a[50]; int i,m,min,j,k=0,k2;
gets(s);
i=0;
m=0;
while(s[i]!='\0'){
if((s[i]=='a')||(s[i]=='e')||(s[i]=='o')||(s[i]=='i')
||(s[i]=='u')||(s[i]=='A')||(s[i]=='E')||(s[i]=='O')||(s[i]=='I')||
(s[i]=='U'))
if(i==0)
{
a[m++]=s[i];
k++;
}
else
{
k2=0;
for(j=0;j<m;j++)
if(s[i]!=a[j])
k2++;
if(k2==m)
{
a[m++]=s[i];
k++;
}
}
i++;
}
printf("Cuvintul are %d vocale diferite ",k);
getch();
}

consoane diferite conine cuvntul Q.

#include<conio.h>
#include<stdio.h>
#include<string.h>
main()
{char s[50], a[50]; int i,m,min,j,k=0,k2;
gets(s);
i=0;
m=0;
while(s[i]!='\0'){
if((s[i]=='b')||(s[i]=='c')||(s[i]=='d')||(s[i]=='f')
||(s[i]=='g')||(s[i]=='h')||(s[i]=='j')||(s[i]=='l')||(s[i]=='k')||
(s[i]=='m')
||(s[i]=='n')||(s[i]=='p')||(s[i]=='q')||(s[i]=='r')||(s[i]=='s')||
(s[i]=='t')
||(s[i]=='v')||(s[i]=='x')||(s[i]=='w')||(s[i]=='y')||(s[i]=='z')||
(s[i]=='B')
||(s[i]=='C')||(s[i]=='D')||(s[i]=='F')||(s[i]=='G')||(s[i]=='H')||
(s[i]=='J')
||(s[i]=='L')||(s[i]=='M')||(s[i]=='N')||(s[i]=='P')||(s[i]=='Q')||
(s[i]=='R')
||(s[i]=='S')||(s[i]=='T')||(s[i]=='V')||(s[i]=='X')||(s[i]=='W')||
(s[i]=='Y')||(s[i]=='Z'))
if(i==0)
{
a[m++]=s[i];
k++;
}
else
{
k2=0;
for(j=0;j<m;j++)
if(s[i]!=a[j])
k2++;
if(k2==m)
{
a[m++]=s[i];
k++;
}

}
i++;
}
printf("Cuvintul are %d consoane diferite ",k);
getch();
}

25) Fie un cuvnt W, adic un ir de caractere. Aflai cte 26) Fie un cuvnt M, adic un ir de caractere. Aflai
caractere din cuvntul W au codul divizibil cu 5.
#include<conio.h>
#include<stdio.h>
#include<string.h>
main()
{char W[50]; int a[50],i,m,k;
gets(W);
i=0;
while(W[i]!='\0'){
a[i]=W[i];
i++;}
m=i-1; k=0;
for (i=0;i<m;i++){printf("%d",a[i]);
if (a[i]%5==0) k++; }
printf("k = %d",k);
getch(); }

cte litere diferite conine cuvntul M.

#include<conio.h>
#include<stdio.h>
#include<string.h>
main()
{char s[50], a[50]; int i,m,min,j,k=0,k2;
gets(s);
i=0;
m=0;
while(s[i]!='\0'){
if((s[i]=='b')||(s[i]=='c')||(s[i]=='d')||(s[i]=='f')
||(s[i]=='g')||(s[i]=='h')||(s[i]=='j')||(s[i]=='l')||(s[i]=='k')||
(s[i]=='m')
||(s[i]=='n')||(s[i]=='p')||(s[i]=='q')||(s[i]=='r')||(s[i]=='s')||
(s[i]=='t')
||(s[i]=='v')||(s[i]=='x')||(s[i]=='w')||(s[i]=='y')||(s[i]=='z')||
(s[i]=='B')
||(s[i]=='C')||(s[i]=='D')||(s[i]=='F')||(s[i]=='G')||(s[i]=='H')||
(s[i]=='J')
||(s[i]=='L')||(s[i]=='M')||(s[i]=='N')||(s[i]=='P')||(s[i]=='Q')||
(s[i]=='R')
||(s[i]=='S')||(s[i]=='T')||(s[i]=='V')||(s[i]=='X')||(s[i]=='W')||
(s[i]=='Y')
||(s[i]=='Y')||(s[i]=='a')||(s[i]=='e')||(s[i]=='o')||(s[i]=='i')
||(s[i]=='u')||(s[i]=='A')||(s[i]=='E')||(s[i]=='O')||(s[i]=='I')||
(s[i]=='U')
)
if(i==0)
{
a[m++]=s[i];
k++;
}
else
{
k2=0;
for(j=0;j<m;j++)
if(s[i]!=a[j])
k2++;
if(k2==m)
{
a[m++]=s[i];
k++;
}
}
i++;
}
printf("Cuvintul are %d litere diferite ",k);
getch();
}

27) Fie o matrice m * n de caractere. Aflai primul

28) Fie o matrice n * m de caractere. Aflai numrul de

caracter de cod maxim.

caractere diferite ce au codul par.

main()
{
char b[20][20];
int m,n,i,j,max;
scanf("%d",&m);
scanf("%d",&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
printf("b[%d][%d]=",i,j);
b[i][j]=getch();
printf("%c\n",b[i][j]);
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
printf("%c ",b[i][j]);
printf("\n");
}
max=(int)b[0][0];
for(i=0;i<m;i++)
for(j=0;j<n;j++)
if((int)b[i][j]>max) max=(int)b[i][j];
printf("\nCaracterul de cod maxim este:%c",max);
getch();
}

main()
{
char b[20][20],a[100];
int m,n,i,j,max,m1=0,k=0,k2,h;
scanf("%d",&m);
scanf("%d",&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{
printf("b[%d][%d]=",i,j);
b[i][j]=getch();
printf("%c\n",b[i][j]);
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
printf("%c ",b[i][j]);
printf("\n");
}
for(i=0;i<m;i++)
for(j=0;j<n;j++)
if ((i==0)&&(j==0))
{
if((int)b[i][j]%2==0)
{
a[m1++]=b[i][j];
k++;
}
}
else
{
k2=0;
for(h=0;h<m1;h++)
if((int)b[i][j]%2==0)
{
if(b[i][j]!=a[h])
k2++;
}
if(k2==m1)
{
a[m1++]=b[i][j];
k++;
}
}
printf("\nCarcatre cu cod par diferite:%d",k);
getch();
}

29) Fie o matrice a * b de caractere. Aflai suma primelor 30) Fie o matrice v * w de caractere. Aflai cea mai mic
2 caractere de cod impar

diferen a codurilor vocalelor din matrice.

main()
{
char b[20][20],a[5],k=0;
int m,n,i,j;
scanf("%d",&m);
scanf("%d",&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)

main()
{
char b[20][20],a[20],aux;
int m,n,i,j,k=0;
scanf("%d",&m);
scanf("%d",&n);
for(i=0;i<m;i++)
for(j=0;j<n;j++)
{

{
printf("b[%d][%d]=",i,j);
b[i][j]=getch();
printf("%c\n",b[i][j]);
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
printf("%c ",b[i][j]);
printf("\n");
}
for(i=0;i<m;i++)
for(j=0;j<n;j++)
if (k<=2)
if (b[i][j]%2) a[k++]=b[i][j];
else break;
printf("\nSuma primelor 2 carcatere de cod impar:%d",
a[0]+a[1]);
getch();
}

31)

Fie un cuvnt A. Aflai dac literele lui au coduri

ce formeaz un ir cresctor

#include<conio.h>
#include<stdio.h>
#include<string.h>
main()
{char s[50], a[50]; int i,m,min,j,k=0;
gets(s);
i=0;
m=0;
while(s[i]!='\0')
{
a[m++]=s[i];
i++;
}
k=0;
for (i=1;i<m;i++)
if (a[i]>a[i-1]) k++;
if (k==m-1)
printf( "Literele cuvintului A formeaza un sir crescator");
else printf( "Literele cuvintului A nu formeaza un sir
crescator");
getch();
}

printf("b[%d][%d]=",i,j);
b[i][j]=getch();
printf("%c\n",b[i][j]);
}
for(i=0;i<m;i++)
{
for(j=0;j<n;j++)
printf("%c ",b[i][j]);
printf("\n");
}
for(i=0;i<m;i++)
for(j=0;j<n;j++)
if((b[i][j]=='a')||(b[i][j]=='e')||(b[i][j]=='o')||(b[i][j]=='i')
||(b[i][j]=='u')||(b[i][j]=='A')||(b[i][j]=='E')||(b[i][j]=='O')||(b[i]
[j]=='I')||(b[i][j]=='U'))
a[k++]=b[i][j];
for(i=0;i<k-1;i++)
for(j=i+1;j<k;j++)
if((int)a[i]>(int)a[j])
{
aux=a[i];
a[i]=a[j];
a[j]=aux;
}
printf("Vocalele: ");
for(i=0;i<k;i++)
printf("%c, ",a[i]);
printf("\nCea mai mica diferenta de cod a vocalelor este:
%d",a[0]-a[k-1]);
getch();
}

32)

Fie un cuvnt C. Aflai dac paritatea codurilor

literelor lui altereaz, adic literele au codurile
cu paritatea: par, impar, par, impar, par, .... sau
invers.

#include<conio.h>
#include<stdio.h>
#include<string.h>
main()
{
char s[50], a[50]; int i,m,min,j,k=0;
gets(s);
i=0;
m=0;
while(s[i]!='\0')
{
a[m++]=s[i];
i++;
}
k=0;
for(i=0;i<m;i++)
if ((!(a[i+1]%2)&&(a[i]%2))||((a[i+1]%2)&&!(a[i]%2)))
k++;
printf("%d\n",k);
if (k==m-1)
printf( "Codurile literelelor cuvintului C altereaza");
else printf( "Codurile literelelor cuvintului C nu
altereaza");

getch();
}