Sub.

1
#include<iostream>
#include<fstream>
using namespace std;
void nrcifre(short a[30],short n)
{short i,j,x;
for(i=1;i<=n;++i)
{j=0;x=a[i];
while(x)
{++j;x=x/10;}
cout<<j<<' ';}}
int main()
{short a[30],n,i,min,max,r;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>n;
for(i=1;i<=n;++i)
{f>>a[i];
if(a[i]%2!=0)
cout<<a[i]<<' ';}
cout<<endl;
nrcifre(a,n);
min=max=a[1];
for(i=2;i<=n;++i)
{if(a[i]<min) min=a[i];
if(a[i]>max) max=a[i];}
while(min)
{r=max%min;
max=min;
min=r;}
g<<max;
}
Sub. 2
#include<iostream>
#include<fstream>
using namespace std;
void nrmax(short a[30],short n)
{short i,j=0,max=a[1];
for(i=2;i<=n;++i)
if(a[i]>max) max=a[i];
for(i=1;i<=n;++i)
if(a[i]==max) ++j;
cout<<endl<<j;}
short prim(short x)
{if(x<2) return 0;
if(x==2)return 1;
if(x%2==0) return 0;
for(short i=3;i<=sqrtf(x);i=i+2)
if(x%i==0) return 0;
return 1;}
int main()
{short a[30],n,i,ok=0;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>n;
for(i=1;i<=n;++i)
{f>>a[i];
if(a[i]%10>5)
cout<<a[i]<<' ';}

nrmax(a,n);
for(i=1;i<=n;++i)
if(prim(a[i]))
{ok=1;
g<<a[i]<<' ';}
if(!ok) g<<"NU EXISTA NUMERE PRIME";
}
Sub. 3
#include<fstream>
#include<iostream>
using namespace std;
void interv(int v[30],int n,int a,int b)
{int i,s=0;
for(i=1;i<=n;++i)
s=s+v[i];
if(s>=a&&s<=b) cout<<"DA";
else
cout<<"NU";}
int main()
{int n,i,j,v[30],ok,k=0,a,b;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>n;
for(i=1;i<=n;++i)
{f>>v[i];
if(v[i]<=99)
cout<<v[i]<<' ';}
cout<<endl;
cin>>a>>b;
interv(v,n,a,b);
for(i=2;i<=n;++i)
{ok=0;
for(j=1;j<i;++j)
if(v[i]>v[j]) ok=1;
if(ok)
{g<<v[i]<<endl;
k=1;}}
if(!k) g<<"NU EXISTA ASTFEL DE NUMERE";
}
Sub. 4
#include<fstream>
#include<iostream>
using namespace std;
void sortez(int n,int a[30])
{int i,j,ok;
do
{ok=0;
for(i=1;i<n;++i)
if(a[i]<a[i+1])
{j=a[i];a[i]=a[i+1];
a[i+1]=j;ok=1;}}
while(ok==1);
for(i=1;i<=n;++i)
cout<<a[i]<<' ';
}
int main()
{int n,i,j,a[30],ok=0,s;
ifstream f("atestat.in");
ofstream g("atestat.out");

f>>n;
for(i=1;i<=n;++i)
{f>>a[i];
if(a[i]%2==0)
cout<<a[i]<<' ';}
cout<<endl;
sortez(n,a);
for(i=1;i<=n;++i)
{s=1;
for(j=2;j<=a[i]/2;++j)
if(a[i]%j==0)s=s+j;
if(a[i]==s)
{g<<s<<' ';
ok=1;}}
if(!ok) g<<"NU EXISTA NUMERE PERFECTE";
}
Sub. 5
#include<fstream>
#include<iostream>
using namespace std;
void inters(int n,int a[30],int k)
{int i,x=a[k];
a[k]=a[k+1];
a[k+1]=x;
for(i=1;i<=n;++i)
cout<<a[i]<<' ';}
int main()
{int n,i,j,k,a[30],ok=0,s;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>n;
for(i=1;i<=n;++i)
{f>>a[i];
if(a[i]/10%2!=0)
cout<<a[i]<<' ';}
cout<<endl;
f>>k;
inters(n,a,k);
for(i=1;i<=n;++i)
{s=1;
for(j=2;j<=a[i]/2;++j)
if(a[i]%j==0)s=s+j;
if(a[i]<s)
{g<<a[i]<<' ';
ok=1;}}
if(!ok)
g<<"NU EXISTA NUMERE SUPRAPERFECTE";
}
Sub. 6
#include<iomanip>
#include<fstream>
#include<iostream>
using namespace std;
void sortez(double a[30],int n)
{int i,ok;double x;
do
{ok=0;
for(i=1;i<n;++i)

if(a[i]>a[i+1])
{x=a[i];a[i]=a[i+1];
a[i+1]=x;ok=1;}}
while(ok==1);
for(i=1;i<=n;++i)
cout<<a[i]<<' ';
}
int main()
{int n,i,j=0;
double a[30],s=0;
ifstream f("atestat.in");
ofstream g("atestat.out");
cout<<fixed<<setprecision(2);
f>>n;
for(i=1;i<=n;++i)
{f>>a[i];
if(a[i]>0)
cout<<a[i]<<' ';}
cout<<endl;
sortez(a,n);
for(i=1;i<=n;++i)
if(a[i]<0)
{s=s+a[i];
++j;}
if(j==0) g<<"NU EXISTA NUMERE NEGATIVE";
else g<<fixed<<setprecision(2)<<s/j;
}
Sub. 7
#include<fstream>
#include<iostream>
using namespace std;
void maimari(int a[30],int n,int k)
{int i,j=0;
for(i=1;i<=n;++i)
if(a[i]>a[k])
++j;
if(j==0)
cout<<"NU EXISTA STRICT MAI MARI";
else cout<<j;}
int main()
{ifstream f("atestat.in");
ofstream g("atestat.out");
int n,i,a[30],k,s=0;
f>>n;
for(i=1;i<=n;i++)
{f>>a[i];
if(a[i]%7==0)
cout<<a[i]<<' ';}
f>>k;cout<<endl;
maimari(a,n,k);
for(i=1;i<=n;i++)
s=s+a[i]%10;
g<<s;
}
Sub. 8
#include<fstream>
#include<iostream>
using namespace std;

void apare(int a[30],int n,int k)

{int i,ok=0;
for(i=1;i<=n;++i)
if(a[i]==k)
ok=1;
if(ok==0) cout<<"\nNU";
else
cout<<"\nDA";
}
int main()
{ifstream f("atestat.in");
ofstream g("atestat.out");
int n,i,a[30],k,s;
f>>n;
for(i=1;i<=n;i++)
{f>>a[i];
if(a[i]%2!=0)
cout<<a[i]<<' ';}
f>>k;
apare(a,n,k);
for(i=1;i<=n;i++)
{k=a[i];
do
{s=0;
while(k)
{s=s+k%10;
k=k/10;}
k=s;}
while(s>9);
g<<s<<' ';}
}
Sub. 9
#include<fstream>
#include<iostream>
using namespace std;
void cmmdc(int a[30],int n)
{int i,d=a[1],r,b;
for(i=2;i<=n;++i)
{b=a[i];
while(b)
{r=d%b;
d=b;b=r;}}
cout<<endl<<d;}
int main()
{ifstream f("atestat.in");
ofstream g("atestat.out");
int n,i,a[30],max,j;
f>>n;
for(i=1;i<=n;i++)
{f>>a[i];
if(a[i]%11==0)
cout<<a[i]<<' ';}
cmmdc(a,n);
max=a[1];j=1;
for(i=2;i<=n;i++)
if(a[i]>=max)
{j=i;
max=a[i];}
g<<max<<' '<<j;
}

Sub. 10
#include<iomanip>
#include<fstream>
#include<iostream>
using namespace std;
void sortez(float a[30],int n)
{int i,ok;float x;
do
{ok=0;
for(i=1;i<n;++i)
if(a[i]<a[i+1])
{x=a[i];a[i]=a[i+1];
a[i+1]=x;ok=1;}}
while(ok==1);
for(i=1;i<=n;++i)
cout<<a[i]<<' ';
}
int main()
{int n,i,j;
float a[30];
ifstream f("atestat.in");
ofstream g("atestat.out");
cout<<fixed<<setprecision(2);
f>>n;
for(i=1;i<=n;++i)
{f>>a[i];
if(a[i]<0)
cout<<a[i]<<' ';}
cout<<endl;
sortez(a,n);
j=n;
while(a[j-1]==a[j])
--j;
g<<fixed<<setprecision(2);
g<<a[j]<<' '<<j;
}
Sub. 11
#include<fstream>
#include<iostream>
using namespace std;
void suma(int a[20][20],int m,int n)
{int i,j,s=0;
for(i=1;i<=m;++i)
for(j=1;j<=n;++j)
if(a[i][j]%2==0)
s=s+a[i][j];
cout<<endl<<s<<endl;}
int main()
{int m,n,i,j,A[20][20],k,ok=1;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>m>>n;
for(i=1;i<=m;++i)
{for(j=1;j<=n;++j)
{f>>A[i][j];
cout<<A[i][j]<<' ';}
cout<<endl;}
suma(A,m,n);
cin>>k;

for(i=1;i<=m;++i)
if(A[i][k]!=0)
ok=0;
if(ok)g<<"DA";
else g<<"NU";
}
Sub. 12
#include<fstream>
#include<iostream>
using namespace std;
void prod(int a[20][20],int m,int n)
{int i,j,p=1;
for(i=1;i<=m;++i)
for(j=1;j<=n;++j)
if(a[i][j]%5==0)
p=p*a[i][j];
cout<<p;}
int main()
{int m,n,i,j,A[20][20],x,inv,ok=0;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>m>>n;
for(i=1;i<=m;++i)
{for(j=1;j<=n;++j)
{f>>A[i][j];
cout<<A[i][j]<<' ';}
cout<<endl;}
prod(A,m,n);
for(i=1;i<=m;++i)
for(j=1;j<=n;++j)
{x=A[i][j];inv=0;
while(x!=0)
{inv=inv*10+x%10;
x=x/10;}
if(inv==A[i][j])
{g<<inv<<' ';
ok=1;}}
if(!ok)g<<"NU EXISTA NUMERE
PALINDROM";
}
Sub. 13
#include<fstream>
#include<iostream>
using namespace std;
void nrneg(int a[20][20],int m,int n)
{int i,j,k=0;
for(i=1;i<=m;++i)
for(j=1;j<=n;++j)
if(a[i][j]<0)
++k;
cout<<k<<endl;}
int main()
{int m,n,i,j,A[20][20],s=0,k;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>m>>n;
for(i=1;i<=m;++i)
{for(j=1;j<=n;++j)

{f>>A[i][j];
cout<<A[i][j]<<' ';}
cout<<endl;}
nrneg(A,m,n);
cin>>k;
for(i=1;i<=m;++i)
s=s+A[i][k];
if(s%2!=0)g<<"DA";
else
g<<"NU";
}
Sub. 14
#include<fstream>
#include<iostream>
using namespace std;
void nrpoz(int a[20][20],int m,int n)
{int i,j,k=0;
for(i=1;i<=m;++i)
for(j=1;j<=n;++j)
if(a[i][j]>0)
++k;
cout<<endl<<k;}
int main()
{int m,n,i,j,A[20][20],s=0;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>m>>n;
for(i=1;i<=m;++i)
for(j=1;j<=n;++j)
{f>>A[i][j];
if(j==n) cout<<A[i][j]<<' ';}
nrpoz(A,m,n);
for(i=1;i<=m;++i)
for(j=1;j<=n;++j)
s=s+abs(A[i][j])%10;
g<<s;
}
Sub. 15
#include<iomanip>
#include<fstream>
#include<iostream>
using namespace std;
void ma(float a[20][20],int m,int n)
{int i,j;float s=0;
for(i=1;i<=m;++i)
for(j=1;j<=n;++j)
s=s+a[i][j];
cout<<fixed<<setprecision(2);
cout<<s/m/n;}
int main()
{int m,n,i,j;
float A[20][20],max,min;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>m>>n;
for(i=1;i<=m;++i)
{for(j=1;j<=n;++j)
{f>>A[i][j];
cout<<A[i][j]<<' ';}

cout<<endl;}
ma(A,m,n);
max=min=A[1][1];
for(i=1;i<=m;++i)
for(j=1;j<=n;++j)
{if(max<A[i][j])
max=A[i][j];
if(min>A[i][j])
min=A[i][j];}
g<<int(max)+int(min);
}
Sub. 16
#include<fstream>
#include<iostream>
using namespace std;
void diag(int a[20][20],int n)
{int i,j;
for(i=2;i<=n;++i)
for(j=n-i+2;j<=n;++j)
cout<<a[i][j]<<' ';}
int main()
{int n,i,j,A[20][20],s=0,ok=0;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>n;
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
f>>A[i][j];
for(i=1;i<=n;++i)
s=s+A[i][i];
cout<<s<<endl;
diag(A,n);
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
{float x=sqrtf(A[i][j]);
if(int(x)==x)
{g<<A[i][j]<<' ';
ok=1;}
if(!ok)
g<<NU EXISTA NUMERE PATRATE
PERFECTE;
}
Sub. 17
#include<fstream>
#include<iostream>
using namespace std;
void diag(int a[20][20],int n)
{int i,j,k=0;
for(i=2;i<=n;++i)
for(j=1;j<i;++j)
if(a[i][j]%2!=0)
++k;
cout<<endl<<k;}
int main()
{int n,i,j,A[20][20],s=0,ok=0;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>n;

for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
f>>A[i][j];
for(i=1;i<=n;++i)
cout<<A[i][n-i+1]<<' ';
diag(A,n);
for(i=1;i<=n;++i)
for(j=1;j<=n;++j)
{float x=cbrt(A[i][j]);
if(int(x)==x)
{g<<A[i][j]<<' ';
ok=1;}}
if(!ok)
g<<"NU EXISTA NUMERE CUBURI
PERFECTE";
}
Sub. 18
#include<fstream>
#include<iostream>
using namespace std;
void apare(char s[71])
{int i,j=1,n=strlen(s);
for(i=1;i<n;++i)
if(s[i]==s[0])
++j;
cout<<endl<<j;}
int main()
{int n,i,ok=0;
char s[71];
ifstream f("atestat.in");
ofstream g("atestat.out");
f.get(s,71);n=strlen(s);
for(i=0;i<n;++i)
if(s[i]>='a'&&s[i]<='z')
cout<<char(s[i]-'a'+'A');
else if(s[i]!=' ')
cout<<char(s[i]-'A'+'a');
else cout<<' ';
apare(s);
f.close();
ifstream h("atestat.in");
while(h>>s)
if(s[0]<='Z')
{g<<s<<' ';
ok=1;}
if(!ok)
g<<"NU EXISTA ASTFEL DE CUVINTE";
}
Sub. 19
#include<fstream>
#include<iostream>
using namespace std;
void apare(char s[71])
{int i,j=0,n=strlen(s);
for(i=0;i<n;++i)
if(s[i]==s[n-1])
++j;
cout<<endl<<j;}

int main()
{int n,i,ok=0;
char s[71],v[6]="aeiou";
ifstream f("atestat.in");
ofstream g("atestat.out");
f.get(s,71);n=strlen(s);
for(i=0;i<n;++i)
if(strchr(v,s[i]))
cout<<char(s[i]-'a'+'A');
else cout<<s[i];
apare(s);
f.close();
ifstream h("atestat.in");
while(h>>s)
if(!strchr(v,s[strlen(s)-1]))
{g<<s<<' ';
ok=1;}
if(!ok)
g<<"NU EXISTA ASTFEL DE CUVINTE";
}
Sub. 20
#include<fstream>
#include<iostream>
using namespace std;
void nrcuv(char s[71])
{int i,j=1,n=strlen(s);
for(i=0;i<n;++i)
if(s[i]==' ')
++j;
cout<<endl<<j;}
int main()
{int n,i,ok=0;
char s[71],v[6]="aeiou";
ifstream f("atestat.in");
ofstream g("atestat.out");
f.get(s,71);n=strlen(s);
cout<<char(s[0]-'a'+'A');
for(i=1;i<n;++i)
if(s[i-1]==' ')
cout<<char(s[i]-'a'+'A');
else cout<<s[i];
nrcuv(s);
f.close();
ifstream h("atestat.in");
while(h>>s)
if(strchr(v,s[0]))
{g<<s<<' ';
ok=1;}
if(!ok)
g<<"NU EXISTA ASTFEL DE CUVINTE";
}
Sub. 21
#include<fstream>
#include<iostream>
using namespace std;
void sterg(char s[71])
{int i,j=0,n=strlen(s);
cout<<endl;

for(i=0;i<n;++i)
if(s[i]<'0'||s[i]>'9')
cout<<s[i];}
int main()
{int n,i,ok=0;
char s[71],v[6]="AEIOU";
ifstream f("atestat.in");
ofstream g("atestat.out");
f.get(s,71);n=strlen(s);
for(i=0;i<n;++i)
if(strchr(v,s[i]))
cout<<char(s[i]-'A'+'a');
else cout<<s[i];
sterg(s);
f.close();
ifstream h("atestat.in");
while(h>>s)
if(s[0]=='C')
{g<<s<<' ';
ok=1;}
if(!ok)
g<<"NU EXISTA ASTFEL DE CUVINTE";
}
Sub. 22
#include<fstream>
#include<iostream>
using namespace std;
void inloc(char s[71])
{int i,n=strlen(s);
cout<<endl;
for(i=0;i<n;++i)
if(s[i]==' ')
cout<<'_';
else
cout<<s[i];}
int main()
{int n,i,ok=0;
char s[71];
ifstream f("atestat.in");
ofstream g("atestat.out");
f.get(s,71);n=strlen(s);
for(i=0;i<n-1;++i)
if(s[i+1]==' ')
cout<<char(s[i]-'a'+'A');
else cout<<s[i];
cout<<char(s[n-1]-'a'+'A');
inloc(s);
f.close();
ifstream h("atestat.in");
while(h>>s)
if(strlen(s)>6)
{g<<s<<' ';
ok=1;}
if(!ok)
g<<"NU EXISTA ASTFEL DE CUVINTE";
}
Sub. 23
#include<fstream>

#include<iostream>
using namespace std;
struct interval
{int x,y;}a[10];
void interv(int n)
{int i,j=0;
for(i=0;i<n;++i)
if(a[i].x%2==0&&a[i].y%2==0)
++j;
cout<<j;}
int main()
{int n,i,min,max;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>n;
for(i=1;i<=n;++i)
{f>>a[i].x>>a[i].y;
cout<<'['<<a[i].x<<','<<a[i].y<<"]\n";}
interv(n);
max=a[1].x;min=a[1].y;
for(i=2;i<=n;++i)
{if(a[i].x>max)
max=a[i].x;
if(a[i].y<min)
min=a[i].y;}
if(max>min)
g<<"NU EXISTA INTERVAL DE INTERSECTIE";
else
g<<max<<' '<<min;
}
Sub. 24
#include<fstream>
#include<iostream>
using namespace std;
struct obiect
{int c,p;}a[10];
void interv(int n)
{int i,s=0;
for(i=1;i<=n;++i)
s=s+a[i].p;
cout<<endl<<s;}
int main()
{int n,i,min;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>n;
for(i=1;i<=n;++i)
{f>>a[i].c>>a[i].p;
cout<<'('<<a[i].c<<','<<a[i].p<<") ";}
interv(n);
min=a[1].p;
for(i=2;i<=n;++i)
if(a[i].p<min)
min=a[i].p;
for(i=2;i<=n;++i)
if(a[i].p==min)
g<<a[i].c<<endl;
}

Sub. 25
#include<fstream>
#include<iostream>
using namespace std;
struct punct
{int x,y;}a[10];
void interv(int n)
{int i,s=0;
for(i=1;i<=n;++i)
if(a[i].x%2==0)
cout<<'('<<a[i].x<<','<<a[i].y<<") ";}
int main()
{int n,i,j=0;
ifstream f("atestat.in");
ofstream g("atestat.out");
f>>n;
for(i=1;i<=n;++i)
{f>>a[i].x>>a[i].y;
cout<<'('<<a[i].x<<','<<a[i].y<<")\n";}
interv(n);
for(i=1;i<=n;++i)
if(a[i].x==a[i].y)
++j;
g<<j;
}