1 #include <fstream>

using namespace std;

ifstream f("numere.in");
ofstream g("numere.out");
int n,a[1001],c,b[1001],k,maxi;
void citire()
{ f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
}
int cifpar(int x)
{ while(x!=0)
{c=x%10;
if(c%2==1) return 0;
x=x/10;
}
return 1;
}
int main()
{ citire();
for (int i=1;i<=n;i++)
if(cifpar(a[i])) {g<<a[i]<<" ";
b[k++]=a[i];}
for(int i=1;i<=k;i++)
if(b[i]>=maxi) maxi=b[i];
g<<'\n';
g<<maxi;
f.close();
g.close();
return 0;
}
2 #include <fstream>
using namespace std;
ifstream f("atestat.in");
ofstream g("atestat.out");
long n,nr;
void afisare(int n)
{n/=10;
while(n!=0)
{ int c=n%10;
g<<c<<" ";
n=n/100;
}
}
long numar(long n,long nr)
{int p=1;nr=0;
while(n!=0)
{ int c=n%10;
nr=nr+p*c;
p=p*10;
n=n/10;
}
nr=nr*10+n;
return nr;
}
int main()
{f>>n;
afisare(n);
g<<numar(n,nr);
f.close();
g.close();
return 0;
}

3 #include <fstream>
using namespace std;
ifstream f("date.in");
ofstream g("date.out");
int n,mini=99999999,ok,poz,r,aux;
long a[100001];
void citire()
{f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
}
void numarmic(int n,long a[100001],int &mini)
{for(int i=1;i<=n;i++)
if(a[i]%2!=0 && a[i]<mini){poz=i;mini=a[i];ok=1;}
if(ok==0) g<<"NU EXISTA";
}
int cmmdc(int x,int y)
{if(x<y) {aux=x;x=y;y=aux;}
while(r) {r=x%y;x=y;y=r;}
return x;
}
int main()
{citire();
numarmic(n,a,mini);
g<<mini<<' '<<poz<<endl;
g<<cmmdc(a[1],a[2]);
f.close();
g.close();
return 0;
}
4 #include <fstream>
using namespace std;
ifstream f("date1.in");
ofstream g("date1.out");
int n,nr,a[51],k,maxi,mini=9999999;
void citire()
{while(f>>n)
a[++k]=n;
}
void divizori(int k,int a[51])
{for(int i=1;i<=k;i++)
{g<<a[i]<<" ";
for(int d=2;d<=a[i]/2;d++)
if(a[i]%d==0) g<<d<<' ';
g<<'\n';
}
}
int nrdiv(int x)
{int d;
for(int d=2;d<=x/2;d++)
if(x%d==0) nr++;
return nr;
}
void numere(int k,int a[51])
{for(int i=1;i<=k;i++)
if(maxi<nrdiv(a[i])) maxi=nrdiv(a[i]);
for(int i=1;i<=k;i++)
if(mini>a[i]) mini=a[i];
g<<maxi;
}
int main()
{citire();
divizori(k,a);
numere(k,a);
f.close();
g.close();
return 0;
}
5 #include <fstream>
using namespace std;
ifstream f("Numere.in");
ofstream g("Numere.out");
ofstream h("Rezultate.out");
int n,a[1001],k,nr,ok;
void citire()
{while(f>>n)
a[++k]=n;
}
void numarprim(int k,int a[1001])
{ for(int i=1;i<=k;i++)
{ok=0;
for(int d=2;d<=a[i]/2;d++)
if(a[i]%d==0) ok=1;
if(ok==0){g<<a[i];break; }
}
}
void factorip(int a[1001])
{int d=2,p;
while(a[1]>1)
{p=0;
while(a[1]%d==0)
{++p;
a[1]/=d;
}
if(p!=0) h<<d<<" "<<p<<'\n';
d++;
if(a[1]>1&& d*d>a[1]) d=a[1];
}
}
int main()
{citire();
numarprim(k,a);
factorip(a);
f.close();
g.close();
h.close();
return 0;
}
6 #include <fstream>
using namespace std;
ifstream f("numere2.in");
ofstream g("numere2.out");
int n,a[1001],k,aux,maxi,b[1001],k1;
void citire()
{while(f>>n)
a[++k]=n;
}
int palindrom(int x)
{int c,inv=0;
aux=x;
while(x!=0)
{c=x%10;
inv=inv*10+c;
x=x/10;
}
if(inv==aux) return 1;
else return 0;
}
int main()
{ citire();
for(int i=1;i<=k;i++)
if(palindrom(a[i])!=0) b[k1++]=a[i];
for(int j=0;j<k1;j++)
if(maxi<b[j]) maxi=b[j];
g<<maxi<<endl;
g<<b[0]<<' '<<b[k1-1];
f.close();
g.close();
return 0;
}

7 #include <fstream>
using namespace std;
ifstream f("numere7.in");
ofstream g("numere7.out");
int n,a[1001],d,mini=9999,maxi;
void citire()
{ f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
}
int numar(int x)
{int nr=0;
while(x!=0)
{nr++;
x/=10;
}
return nr;
}
void numarimp(int n,int a[1001])
{for(int i=1;i<=n;i++)
if(a[i]%2!=0)g<<numar(a[i])<<' ';
g<<endl;
}
int cmmdc(int a,int b)
{int r,aux;
if(a<b){aux=a;a=b;b=aux;}
r=a%b;
while(r)
{a=b;
b=r;
r=a%b;
}
return b;
}
void div(int n,int a[1001])
{for(int i=1;i<=n;i++)
if(maxi<a[i]) maxi=a[i];
for(int i=1;i<=n;i++)
if(mini>a[i]) mini=a[i];
g<<cmmdc(mini,maxi);
}
int main()
{citire();
numarimp(n,a);
div(n,a);
f.close();
g.close();
return 0;
}
8#include <fstream>
using namespace std;
ifstream f("cmmdc3.in");
ofstream g("cmmdc3.out");
int a,b,c;
long long n;
void citire()
{f>>n;}
void formare(long long n)
{if(n!=0)
{a=n%1000;
n=n/1000;
b=n%1000;
n/=1000;
c=n%1000;
}
g<<c<<' '<<b<<' '<<a;
g<<endl;
}
int cmmdc(int a,int b)
{int r,aux;
if(a<b){aux=a;a=b;b=aux;}
r=a%b;
while(r)
{a=b;
b=r;
r=a%b;
}
return b;
}

void cmmdc3(int a,int b,int c)

{int nr=cmmdc(a,b);
g<<cmmdc(nr,c);
}
int main()
{citire();
formare(n);
cmmdc3(a,b,c);
f.close();
g.close();
return 0;
}
9 #include <fstream>
using namespace std;
ifstream f("tip1.in");
ofstream g("tip1.out");
long long n;
int k;
void citire()
{f>>n>>k;
}
void numar(long long n,int k)
{int y=0,p=1,c=0;
while(n!=0)
{c=n%10;
if(c!=k){y=y+p*c; p=p*10;}
n/=10;
}
g<<y<<endl;
}
void putere(int k,long long n)
{int p=k;
while(p<n)
{p=p*k;
}
g<<p/k;
}
int main()
{citire();
numar(n,k);
putere(k,n);
f.close();
g.close();
return 0;
}
10 #include <fstream>
using namespace std;
ifstream f("numere.in");
ofstream g("numere.out");
int n,a[1001],b[1001],k;
void citire()
{f>>n;
for(int i=1;i<=n;i++)
f>>a[i];
}
int palindrom(int x)
{int inv=0,aux=x;
while(x)
{inv=inv*10+x%10;
x/=10;
}
if(inv==aux)return 1;
else return 0;
}
int numar(int x)
{int nr=0;
while(x)
{nr++;
x/=10;
}
if(nr%2!=0) return 1;
else return 0;
}
void vector1(int n,int a[1001])
{for(int i=1;i<=n;i++)
if(palindrom(a[i])) b[++k]=a[i];
for(int i=1;i<=k;i++)
g<<b[i]<<' ';
g<<endl;
for(int i=1;i<=k;i++)
if(numar(b[i])) g<<b[i]<<' ';
}
int main()
{citire();
vector1(n,a);
return 0;
}