/*
Bai tap: Nhap mang n phan tu so nguyen
A. Tim gia tri Min, Max trong mang
B. Tinh tong cac phan tu co gia tri chan trong mang
C. Dem so luong cac so chinh phuong trong mang
D. Liet ke cac so nguyen to trong mang theo thu tu giam dan
*/
#include<oistream.h> # math.h
void main(){
int n,i,a[100]; // khai bao bien
cout<< " nhap so luong phan tu= "; // tb nhap
cin>> n' // nhap n
for( i= 0; i< n; i ++){ // lap n lan
cout << " a[ "<< i<<"]= ; // tb nhap a[i]
cin >> a[i]; // nhap a[i]
}
int max = a[0]; // tam thoi coi a[0] la max
for( i=1; i< n; i++) // duyet moi phan tu con lai
if( a[i] > max) // net pt dang duyet > max
max= a[i]; // cap nhat gia tri max moi
cout<<" gia tri max = "<<max;
(min) ="<<min<<" /n";
// dem so chan
int dem = 0;// reset bien dem =0
for( i=0; i<n; i++) // duyet moi phan tu
If (a[i] %2 ==0) // neu phan tu dang duyet la chan
dem ++; // thi tang bien dem len 1
cout<<"/n so phan tu co gia tri chan ="<< dem<<";
// liet ke cac so chinh phuong trong mang
cout<<" cac so chinh phuong";
for(i=0; i<n; i++)] // duyet moi phan tu
int t=sqrt (a[i];
if (a[i] <<" ";
}
//liet ke cac so nguyen to trong mang theo thu tu giam dan
int NT[1000];
int i,j,k,dem=0;
for(i=0;i<n;i++)
if(kt_nguyen_to(A[i])) dem++;
if(dem==0) printf("\n Trong mang khong co so nguyen to \n");
else // Neu co so nguyen to thi loc ra cac so ngto va sap xep
{ printf("\n D. Trong mang co %d so nguyen to \n",dem);
i=0;k=0;
while(i<n){
if(kt_nguyen_to(A[i])) {NT[k]=A[i]; k++;}
i++;
}
for(i=0;i<dem-1;i++)
for(j=i+1;j<dem;j++)
if(NT[i]<NT[j]){
k=NT[i];
NT[i]=NT[j];
NT[j]=k;
}
// Hien thi ket qua ra man hinh
printf("\n Danh sach cac so nguyen to theo thu tu giam dan \n");
for(i=0;i<dem;i++) printf("%6d",NT[i]);