1.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n,i,a,b;
Lista l1[50];
int cmmdc(int a,int b)
{
while (a!=b)
if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n;
for (i=0;i<=n-1;i++)
cin>>l1[i];
a=l1[0];
for (i=1;i<=n-1;i++)
{
b=l1[i];
a=cmmdc(a,b);
}
cout<<a;
return 0;
}

2.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,a,b,n2;
Lista l1[50],l2[50];
int cmmdc(int a,int b)
{
while (a!=b)
if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
a=cmmdc(l2[0],l2[1]);
b=l2[0]*l2[1]/a;
for (i=2;i<=n2-1;i++)
{
a=cmmdc(b,l2[i]);
b=b*l2[i]/a;
}
cout<<b;
return 0;
}
3.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,maxx;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
maxx=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]>maxx)
maxx=l1[i];
cout<<maxx;
}

4.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,minn;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
minn=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]<minn)
minn=l1[i];
cout<<minn;
}

5.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int invers(int a)
{int inv=0,c;
while (a!=0)
{
c=a%10;
inv=inv*10+c;
a=a/10;
}
return inv;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (l2[i]==invers(l2[i]))
k++;
cout<<k;
}

6.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int prim(int a)
{
int d;
if (a<2)
return 0;
for (d=2;d*d<=a;d++)
if (a%d==0)
return 0;
return 1;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (prim(l2[i])==1)
k++;
cout<<k;
}

7.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,j;
Lista l1[50],aux;
int main()
{
cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
for (i=0;i<n1-1;i++)
for (j=i+1;j<=n1-1;j++)
if (l1[i]>l1[j])
{
aux=l1[i];
l1[i]=l1[j];
l1[j]=aux;
}
for (i=0;i<=n1-1;i++)
cout<<l1[i]<<" ";
}1.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n,i,a,b;
Lista l1[50];
int cmmdc(int a,int b)
{
while (a!=b)
if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n;
for (i=0;i<=n-1;i++)
cin>>l1[i];
a=l1[0];
for (i=1;i<=n-1;i++)
{
b=l1[i];
a=cmmdc(a,b);
}
cout<<a;
return 0;
}

2.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,a,b,n2;
Lista l1[50],l2[50];
int cmmdc(int a,int b)
{
while (a!=b)
if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
a=cmmdc(l2[0],l2[1]);
b=l2[0]*l2[1]/a;
for (i=2;i<=n2-1;i++)
{
a=cmmdc(b,l2[i]);
b=b*l2[i]/a;
}
cout<<b;
return 0;
}

3.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,maxx;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
maxx=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]>maxx)
maxx=l1[i];
cout<<maxx;
}

4.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,minn;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
minn=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]<minn)
minn=l1[i];
cout<<minn;
}

5.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int invers(int a)
{int inv=0,c;
while (a!=0)
{
c=a%10;
inv=inv*10+c;
a=a/10;
}
return inv;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (l2[i]==invers(l2[i]))
 k++;
cout<<k;
}

6.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int prim(int a)
{
int d;
if (a<2)
return 0;
for (d=2;d*d<=a;d++)
if (a%d==0)
return 0;
return 1;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (prim(l2[i])==1)
k++;
cout<<k;
}

7.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,j;
Lista l1[50],aux;
int main()
{
cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
for (i=0;i<n1-1;i++)
for (j=i+1;j<=n1-1;j++)
if (l1[i]>l1[j])
{
aux=l1[i];
l1[i]=l1[j];
l1[j]=aux;
}
for (i=0;i<=n1-1;i++)
cout<<l1[i]<<" ";
}1.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n,i,a,b;
Lista l1[50];
int cmmdc(int a,int b)
{
while (a!=b)
if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n;
for (i=0;i<=n-1;i++)
cin>>l1[i];
a=l1[0];
for (i=1;i<=n-1;i++)
{
b=l1[i];
a=cmmdc(a,b);
}
cout<<a;
return 0;
}

2.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,a,b,n2;
Lista l1[50],l2[50];
int cmmdc(int a,int b)
{
while (a!=b)
if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
a=cmmdc(l2[0],l2[1]);
b=l2[0]*l2[1]/a;
for (i=2;i<=n2-1;i++)
{
a=cmmdc(b,l2[i]);
b=b*l2[i]/a;
}
cout<<b;
return 0;
}

3.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,maxx;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
maxx=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]>maxx)
maxx=l1[i];
cout<<maxx;
}

4.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,minn;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
minn=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]<minn)
minn=l1[i];
cout<<minn;
}

5.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int invers(int a)
{int inv=0,c;
while (a!=0)
{
c=a%10;
inv=inv*10+c;
a=a/10;
}
return inv;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (l2[i]==invers(l2[i]))
k++;
cout<<k;
}

6.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int prim(int a)
{
int d;
if (a<2)
return 0;
for (d=2;d*d<=a;d++)
if (a%d==0)
return 0;
return 1;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (prim(l2[i])==1)
k++;
cout<<k;
}

7.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,j;
Lista l1[50],aux;
int main()
{
cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
for (i=0;i<n1-1;i++)
for (j=i+1;j<=n1-1;j++)
if (l1[i]>l1[j])
{
aux=l1[i];
l1[i]=l1[j];
l1[j]=aux;
}
for (i=0;i<=n1-1;i++)
cout<<l1[i]<<" ";
}1.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n,i,a,b;
 Lista l1[50];
int cmmdc(int a,int b)
{
while (a!=b)
if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n;
for (i=0;i<=n-1;i++)
cin>>l1[i];
a=l1[0];
for (i=1;i<=n-1;i++)
{
b=l1[i];
a=cmmdc(a,b);
}
cout<<a;
return 0;
}

2.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,a,b,n2;
Lista l1[50],l2[50];
int cmmdc(int a,int b)
{
while (a!=b)
if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
a=cmmdc(l2[0],l2[1]);
b=l2[0]*l2[1]/a;
for (i=2;i<=n2-1;i++)
{
a=cmmdc(b,l2[i]);
b=b*l2[i]/a;
}
cout<<b;
return 0;
}

3.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
 int n1,i,maxx;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
maxx=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]>maxx)
maxx=l1[i];
cout<<maxx;
}

4.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,minn;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
minn=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]<minn)
minn=l1[i];
cout<<minn;
}

5.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int invers(int a)
{int inv=0,c;
while (a!=0)
{
c=a%10;
inv=inv*10+c;
a=a/10;
}
return inv;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (l2[i]==invers(l2[i]))
k++;
cout<<k;
}
6.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int prim(int a)
{
int d;
if (a<2)
return 0;
for (d=2;d*d<=a;d++)
if (a%d==0)
return 0;
return 1;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (prim(l2[i])==1)
k++;
cout<<k;
}

7.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,j;
Lista l1[50],aux;
int main()
{
cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
for (i=0;i<n1-1;i++)
for (j=i+1;j<=n1-1;j++)
if (l1[i]>l1[j])
{
aux=l1[i];
l1[i]=l1[j];
l1[j]=aux;
}
for (i=0;i<=n1-1;i++)
cout<<l1[i]<<" ";
}1.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n,i,a,b;
Lista l1[50];
int cmmdc(int a,int b)
{
while (a!=b)
if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n;
for (i=0;i<=n-1;i++)
cin>>l1[i];
a=l1[0];
for (i=1;i<=n-1;i++)
{
b=l1[i];
a=cmmdc(a,b);
}
cout<<a;
return 0;
}

2.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,a,b,n2;
Lista l1[50],l2[50];
int cmmdc(int a,int b)
{
while (a!=b)
if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
a=cmmdc(l2[0],l2[1]);
b=l2[0]*l2[1]/a;
for (i=2;i<=n2-1;i++)
{
a=cmmdc(b,l2[i]);
b=b*l2[i]/a;
}
cout<<b;
return 0;
}

3.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,maxx;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
maxx=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]>maxx)
maxx=l1[i];
cout<<maxx;
}

4.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,minn;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
minn=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]<minn)
minn=l1[i];
cout<<minn;
}

5.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int invers(int a)
{int inv=0,c;
while (a!=0)
{
c=a%10;
inv=inv*10+c;
a=a/10;
}
return inv;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (l2[i]==invers(l2[i]))
k++;
cout<<k;
}

6.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int prim(int a)
{
int d;
if (a<2)
return 0;
for (d=2;d*d<=a;d++)
if (a%d==0)
return 0;
return 1;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (prim(l2[i])==1)
k++;
cout<<k;
}

7.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,j;
Lista l1[50],aux;
int main()
{
cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
for (i=0;i<n1-1;i++)
for (j=i+1;j<=n1-1;j++)
if (l1[i]>l1[j])
{
aux=l1[i];
l1[i]=l1[j];
l1[j]=aux;
}
for (i=0;i<=n1-1;i++)
cout<<l1[i]<<" ";
}1.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n,i,a,b;
Lista l1[50];
int cmmdc(int a,int b)
{
while (a!=b)
 if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n;
for (i=0;i<=n-1;i++)
cin>>l1[i];
a=l1[0];
for (i=1;i<=n-1;i++)
{
b=l1[i];
a=cmmdc(a,b);
}
cout<<a;
return 0;
}

2.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,a,b,n2;
Lista l1[50],l2[50];
int cmmdc(int a,int b)
{
while (a!=b)
if (a>b)
a=a-b;
else b=b-a;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
a=cmmdc(l2[0],l2[1]);
b=l2[0]*l2[1]/a;
for (i=2;i<=n2-1;i++)
{
a=cmmdc(b,l2[i]);
b=b*l2[i]/a;
}
cout<<b;
return 0;
}

3.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,maxx;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
maxx=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]>maxx)
maxx=l1[i];
cout<<maxx;
}

4.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,minn;
Lista l1[50];
int main()
{cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
minn=l1[0];
for (i=1;i<=n1-1;i++)
if (l1[i]<minn)
minn=l1[i];
cout<<minn;
}

5.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int invers(int a)
{int inv=0,c;
while (a!=0)
{
c=a%10;
inv=inv*10+c;
a=a/10;
}
return inv;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (l2[i]==invers(l2[i]))
k++;
cout<<k;
}

6.
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n2,i,k;
Lista l2[50];
int prim(int a)
{
int d;
if (a<2)
return 0;
for (d=2;d*d<=a;d++)
if (a%d==0)
return 0;
return 1;
}
int main()
{cin>>n2;
for (i=0;i<=n2-1;i++)
cin>>l2[i];
for (i=0;i<=n2-1;i++)
if (prim(l2[i])==1)
k++;
cout<<k;
}

7.

#include <iostream>
#include <bits/stdc++.h>
using namespace std;
typedef int Lista;
int n1,i,j;
Lista l1[50],aux;
int main()
{
cin>>n1;
for (i=0;i<=n1-1;i++)
cin>>l1[i];
for (i=0;i<n1-1;i++)
for (j=i+1;j<=n1-1;j++)
if (l1[i]>l1[j])
{
aux=l1[i];
l1[i]=l1[j];
l1[j]=aux;
}
for (i=0;i<=n1-1;i++)
cout<<l1[i]<<" ";
}