#include <iostream>

using namespace std;

int prim (int numar)

{
int i;
if(numar<2)
{
return 0;
}
for (i=2; i<numar; i++)
{
if (numar%i==0)
return 0;
}
return 1;
}

int main()
{int n, mx=0, uc;
cin>>n;
while (n>0)
{
uc=n%10;
if(uc>mx&&prim(uc)==1)
{
mx=uc;
}
n=n/10;
}
cout<<mx;

#include <iostream>

using namespace std;

int ridicareLaPutere(int numar, int putere)

{
int copie=numar, i;
for(i=2; i<=putere; i++)
{
numar=numar*copie;
}
return numar;
}

int palindrom(int numar)

{
int nou=0;
int copie=numar;
while (copie>0)
{
int uc=copie%10;
nou=nou*10+uc;
 copie=copie/10;
}
if(nou==numar)
{
return 1;
}
else
{
return 0;
}
}

int Fibonacci(int numar)

{
int i, n, f0=1, f1=1, f2=1;
for(i=2; i<numar; i++)
{
f2=f1+f0;
f0=f1;
f1=f2;
}
return f2;
}

int contineCifra(int numar, int cifra)

{
while(numar>0)
{
int uc=numar%10;
if(uc==cifra)
{
return 1;
}
else
{
numar=numar/10;
}
}
return 0;
}

int main()
{
/// int numar;
/// cout<<ridicareLaPutere(2, 13);
/// cin>>numar;
/// cout<<palindrom(numar);
///int n;
///cin>>n;
///cout<<Fibonacci(n);
/**
int sir[100], n, i, aparitii=0, pozitieULT, pozitiePEN;
cin>>n;
for(i=1; i<=n; i++)
{
cin>>sir[i];
}
for(i=n; i>=1; i--)
{
 if(palindrom(sir[i])==1&&aparitii<2)
{
aparitii++;
if(aparitii==1)
{
pozitieULT=i;
}
else
{
pozitiePEN=i;

}
}
}
cout<<pozitiePEN<<" "<<pozitieULT;
*/
/**
int n, k, sir[100], i;
cin>>n>>k;
for(i=1; i<=n; i++)
{
cin>>sir[i];
}
for(i=1; i<=n; i++)
{
if(contineCifra(sir[i],k)==1){
cout<<sir[i]<<" ";
}
}

cout<<endl;
*/
int n, sir[100], i;
cin>>n;
for(i=1; i<=n; i++)
{
cin>>sir[i];
}
int ok=1;
for(i=1; i<=n; i++)
{
if(sir[i]>sir[i+1])
{
ok=0;
}
}
if(ok==1)
{
cout<<"sirul este crescator";
}
else
{
cout<<"sirul nu este crescator";
}

return 0;
}
 return 0;
}
___________________________________________________________________________________
_____________-
4.

int main()
{int n, sir[100], i;
cin>>n;
for (i=1; i<=n; i++){
cin>>sir[i];
}
for(i=1; i<=n; i++){
cout<<sir[i]<<" ";
}
cout<<endl;
int p=1;
for(i=1; i<=n; i++)
{
if (sir[i]%2==1)
{
p=p*sir[i];
}
}
cout<<p;

return 0;
___________________________________________________________________________________
__________
se da intervalul [1;n]. calculati cmmdc ul acestui interval

#include <iostream>

using namespace std;

int cmmdc(int a, int b)

{
int r;
r=a%b;
while(r>0)
{
a=b;
b=r;
r=a%b;
}
return b;

int main()
{
int i,n, sir[100];
cin>>n;
for (i=1; i<=n; i++)
{
 cin>>sir[i];

}
for (i=1; i<=n; i++)
{
cout<<sir[i]<<" ";
}
cout<<endl;
int cmdc=cmmdc(sir[1], sir[2]);
for(i=2; i<=n; i++)
{
cmdc=cmmdc(sir[i], cmdc);
}
cout<<cmdc;

return 0;
}
___________________________________________________________________
8.
int primaCifra(int numar){
while (numar>9){
numar=numar/10;
}
return numar;
}

int main()
{
int n, sir[100],i;
cin>>n;
for (i=1; i<=n; i++)
{
cin>>sir[i];
}
for (i=1; i<=n; i++)
{
cout<<sir[i]<<" ";
}
cout<<endl;
for (i=1; i<=n; i++){
if(sir[i]%10==primaCifra(sir[i])){
cout<<sir[i]<<" ";
}
}
return 0;
_____________________________________________________________
#include <iostream>

using namespace std;

void suma(int a, int b, int &c)

{
c=a+b;
}
void afisare(int n, int sir[])
{
int i;
for(i=1; i<=n; i++)
{
cout<<sir[i]<<" ";
}
cout<<endl;
}

void sortare(int n, int sir[])

{
int i, j;
for(i=1; i<n; i++)
{
for(j=i+1; j<=n; j++)
{
if(sir[i]>sir[j])
{
int aux=sir[j];
sir[j]=sir[i];
sir[i]=aux;
}

}
}

int prim(int numar)

{
int i;
if(numar<2)
{
return 0;
}
for(i=2; i<numar; i++)
{
if(numar%i==0)
{
return 0;
}
}
return 1;
}
int main()
{
int n, i, sir[100], sirNOU[100], nNOU=0, j;
cin>>n;
for(i=1; i<=n; i++)
{
cin>>sir[i];
}
afisare(n,sir);
for(i=1; i<=n; i++)
 {
if(1==prim(sir[i]))
{
nNOU=nNOU+1;
sirNOU[nNOU]=sir[i];
}
}
cout<<"Noul sir este:";
afisare(nNOU, sirNOU);
sortare(n, sir);
cout<<"sirul sortat este:";
afisare(n, sir);
int a=1,b=2,c=0;
suma(a,b,c);
cout<<c;
return 0;
}

void inserare(int sir[], int &n, int pozitie, int element)

{
int i;
for(i=n; i>=pozitie; i--)
{
sir[i+1]=sir[i];
}
sir[pozitie]=element;
n=n+1;
}

void sterge(int sir[], int &n, int pozitie)

{
int i;
for(i=pozitie;i<n;i++)
{
sir[i]=sir[i+1];
}
n=n-1;
}

int prim(int numar)

{
int i;
if(numar<2)
{
return 0;
}
for(i=2;i<numar;i++)
{
if(numar%i==0)
{
return 0;
}
}
return 1;
}
int main()
{
/** int n, sir[100],i;
cin>>n;
for(i=1; i<=n; i++)
{
cin>>sir[i];
}
for(i=1; i<=n; i++)
{
cout<<sir[i]<<" ";
}
int ok=1;
int j;
for(i=1; i<n; i++)
{
for(j=i+1;j<=n;j++)
{
if(sir[i]==sir[j])
{
ok=0;
}
}

}
if(ok==0)
{
cout<<"sirul contine dubluri";
}
else
{
cout<<"sirul are doar el unice";
}*/
/// 1, 2, 3, 4
/// 1, 0, 2, 0
/** int n, sir[100], i;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>sir[i];
}
for(i=1;i<=n;i++)
{
cout<<sir[i]<<" ";
}
cout<<endl;
int nou[100]={0}, j=1;
for(i=1;i<=n/2;i++)
{
nou[j]=sir[i];
j=j+2;
}
j=n;
for(i=n/2+1;i<=n;i++)
{
nou[j]=sir[i];
j=j-2;
 }
for(i=1;i<=n;i++)
{
cout<<nou[i]<<" ";
}
*/
/** int n, i, sir[100], pozitie, element;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>sir[i];
}
cin>>pozitie>>element;
inserare(sir,n,pozitie,element);
for(i=1;i<=n;i++)
{
cout<<sir[i]<<" ";
}
*/
/** int n, i, sir[100], pozitie;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>sir[i];
}
cin>>pozitie;
sterge(sir, n, pozitie);
for(i=1;i<=n;i++)
{
cout<<sir[i]<<" ";
}*/
///se dau n nr nat. sa se stearga toate el prime

/** int n, i, sir[100];

cin>>n;
for(i=1;i<=n;i++)
{
cin>>sir[i];
}
for(i=1;i<=n;i++)
{
if(prim(sir[i])==1)
{
sterge(sir, n, i);
i=i-1;
}
}
for(i=1;i<=n;i++)
{
cout<<sir[i]<<" ";
}
*/
///sa se insereze intr un sir dupa fiecare el par dublul sau
int n, i, sir[100];
cin>>n;
for(i=1;i<=n;i++)
{
cin>>sir[i];
}
 for(i=1;i<=n;i++)
{
if(sir[i]%2==0)
{
inserare(sir,n,i+1,sir[i]*2);
i=i+1;
}
}
for(i=1;i<=n;i++)
{
cout<<sir[i]<<" ";
}

int nrParDeCifre(int numar)

{
int sir[100], nr=0;
while(numar>0)
{
nr=nr+1;
numar=numar/10;
}
if(nr%2==0)
{
return 1;
}
else
{
return 0;
}

int cifreDistincte(int numar)

{ int sir[100], z=0;

while(numar>0)
{
int uc=numar%10;
z=z+1;
sir[z]=uc;
numar=numar/10;
}
int i, j;
for(i=1;i<=z;i++)
{
for(j=i+1;j<=z;j++)
{
if(sir[i]==sir[j])
{
return 0;
}
}
 }
return 1;

int main()
{
/// Se dă un şir cu n elemente, numere naturale.
/// Să se verifice dacă toate elementele şirului au toate cifrele distincte.
/** int n, i, sir[100], ok;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>sir[i];
}
for(i=1;i<=n;i++)
{
cout<<sir[i]<<" ";
}
ok=1;
for(i=1;i<=n;i++)
{
if(cifreDistincte(sir[i])==0)
{
ok=0;
}
}
if(ok==1)
{
cout<<"toate numerele din sir au cifre distincte";
}
else
{
cout<<"nu toate numerele din sir au cifre distincte";
}

*/
/// Se dă un şir cu n elemente, numere naturale.
///Să se verifice dacă toate elementele şirului au număr par de cifre.

/** int n, sir[100],i, ok;

cin>>n;
for(i=1;i<=n;i++)
{
cin>>sir[i];
}
ok=1;
for(i=1;i<=n;i++)
{
if(nrParDeCifre(sir[i])==0)
{
ok=0;
}
}
if(ok==1)
{
cout<<"toate nr au un nr par de cifre";
 }
else
{
cout<<"nu toate nr au un nr par de cifre";
}
*/

/// Se da un sir cu n el nr nat.

/// Sa se verifice daca exista in sir el care sa aiba ambii vecini de aceeasi
paritate cu el

int i, n, sir[100],ok=0;
cin>>n;
for(i=1;i<=n;i++)
{
cin>>sir[i];
}
for(i=2;i<=n-1;i++)
{
if(sir[i-1]%2==0 && sir[i]%2==0 && sir[i+1]%2==0)
{
ok=1;
}
if (sir[i-1]%2==1 && sir[i]%2==1 && sir[i+1]%2==1)
{
ok=1;
}
}
if(ok==1)
{
cout<<"da";
}
else
{
cout<<"nu";
}

return 0;
}

Elementenou=0;
cin>>n;
for(i=1; i<=n; i++)
{
cin>>sir[i];
}
for(i=1;i<=n;i++)
{
if(prim(sir[i])==1)
{
nrElementenou++;
nou[nrElementenou]=sir[i];
}
}
 for(i=1;i<=nrElementenou;i++)
{
for(j=1;j<=n;j++)
{
if(nou[i]>nou[i+1])
{
nou[i]=nou[i+1];
nou[i+1]=nou[i];
}
}
}
for(i=1; i<=nrElementenou; i++)
{
cout<<nou[i]<<" ";
}