1.

2) Kiu d liu mng

1.2.1) Nhp xut mng
62. Vit chng trnh nhp xut mng mt chiu cc s thc.
#include <iostream.h>
void nhapso(int M[100], int &n );
int main(int argc, char *argv[])
{
int M[100],n;
nhapso(M,n);
return 0;
}
void nhapso(int M[100], int &n)
{
cout<<"nhap so"<<endl;
cin>>n;
for(int i=0; i<=n; i++)
{
cout<<"mang so la: ["<<i+1<<"]= ";
cin>>M[i];
}
}

63. Vit chng trnh khi to gi tr cc phn t l 0 cho mng mt

chiu cc s nguyn gm n phn t.
#include <iostream.h>
void nhapso(int M[5], int &n);
void xuatso(int M[5], int n);
int main(int argc, char *argv[])
{
int M[5],n;
nhapso(M,n);
xuatso(M,n);
return 0;
}
void nhapso(int M[5], int &n)
{
cout<<"nhap so "<<endl;

cin>>n;
for(int i=0; i<=n; i++)
{
cout<<"phan tu mang ["<<i+1<<"] = ";
cin>>M[i];
}
}
Void xuatso(int M[5], int n)
{
for(int i=0; i<=n; i++)
Cout<<a[<<i+1<<]= <<0<<endl;
}

64. Vit chng trnh pht sinh ngu nhin mng mt chiu cc s
nguyn m.
#include <iostream.h>
#include <stdlib.h>

#include <conio.h>
#include <time.h>
void nhapso(int M[5], int &n);
void xuatso(int M[5], int n);
int main(int argc, char *argv[])
{
int M[5],n;
nhapso(M,n);
xuatso(M,n);
return 0;
}
void nhapso(int M[5], int &n)
{
int kt,so;
cout<<"nhap gia tri phan tu mang "<<endl;
cin>>n;
srand(time(NULL));
for(int i=0; i<n; i++)
{
do
{
kt=1;
so=(rand()%50)-100;
for(int j= i-1; j>=0; j--)
{
if(so==M[j])
kt=0;
}
}

while(kt==0);
M[i]=so;
}
}
void xuatso(int M[5], int n)
{
for(int i=0; i<n; i++)
{
cout<<"a["<<i+1<<"]= "<<M[i]<<endl;
}
}

65. Vit chng trnh pht sinh ngu nhin mng mt chiu cc s
nguyn sao cho mng c th t tng dn (Khng sp xp).
#include <iostream.h>
#include <stdio.h>
#include <conio.h>
#include <time.h>
void nhapso(int M[100], int &n);
void xuatso(int M[100], int n);
int main(int argc, char *argv[])

{
int M[100],n;
nhapso(M,n);
xuatso(M,n);
return 0;
}
void nhapso(int M[100], int n)
{
cout<<"nhap mang "<<endl;
cin>>n;
srand(time(NULL));
for(int i=0; i<n; i++)
{
if(i==0)
do
{
so=(rand()%1000)-499;
if(so<100-n)
mang[0]=so;
}
while(so>=100-n);
else
do
{
so=(rand()%1000)-499;
if(so>=mang[i-1])
mang[i]=so;
}
while(so<mang[i-1]);

}
}
void xuatso(int M[100], int n)
{
cout<<"gia tri phan tu mang"<<endl;
for(int i=0; i<n; i++)
{
cout<<"a["<<i+1<<"]= "<<M[i]<<endl;
}
}

66. Vit chng trnh nhp mng cc s thc v xut cc phn t

m trong mng.
#include <iostream.h>
#include <stdlib.h>
#include <conio.h>
#include <time.h>
void nhapso(int M[100], int &n);
void xuatso(int M[100], int n);
int main(int argc, char *argv[])

{
int M[100],n;
nhapso(M,n);
xuatso(M,n);
return 0;
}
void nhapso(int M[100], int &n)
{
int so;
cout<<"nhap mang "<<endl;
cin>>n;
srand(time(NULL));
for(int i=0; i<n; i++)
{
if(i==0)
do
{
so=((rand()%1000)-499);
if(so<100-n)
M[0]=so;
}
while(so>=100-n);
else
do
{
so=(rand()%1000)-499;

if(so>=M[i-1])
M[i]=so;
}
while(so<M[i-1]);
}
}
void xuatso(int M[100], int n)
{
cout<<"gia tri phan tu mang"<<endl;
for(int i=0; i<n; i++)
{
cout<<"a["<<i+1<<"]= "<<M[i]<<endl;
}
}

67.Vit chng trnh nhp mng cc s nguyn v xut cc

phn t l c trong mng.

#include <iostream.h>
void nhapmang(int mang[],int &n);
void ptL(int mang[],int n);
int main(int argc, char *argv[])
{
int mang[100];
int n;
nhapmang(mang,n);
ptL(mang,n);
return 0;
}
void nhapmang(int mang[],int &n)
{
cout<<"nhap so phan tu: ";
cin>>n;
int i;
for( i=0;i<n;i++)
{
cout<<"nhap gia tri phan tu ["<<i+1<<"]:";
cin>>mang[i];
}

}
void ptL(int mang[],int n)
{
int i;
cout<<"phan tu le co trong mang la"<<endl;
for( i=0;i<n;i++)
{
if(i%2==0)
cout<<"a["<<i+1<<"]="<<mang[i]<<", ";
}
cout<<endl;
}

68. Vit chng trnh nhp vo mng mt chiu cc s nguyn v xut ra

phn t chn nh hn 20.
#include <iostream.h>
void nhapmang(int mang[],int &n);

int phantuchan(int mang[],int n);

int main(int argc, char *argv[])
{
int mang[100];
int n;
nhapmang(mang,n);
phantuchan(mang,n);
return 0;
}
void nhapmang(int mang[],int &n)
{
cout<<"nhap so phan tu: ";
cin>>n;
int i;
for( i=0;i<n;i++)
{
cout<<"nhap gia tri phan tu ["<<i+1<<"]:";
cin>>mang[i];
}
}
int phantuchan(int mang[],int n)
{

int i;
cout<<"phan tu chan co trong mang be hon 20 la";
for( i=0;i<n;i++)
{
if(mang[i]%2==0 && mang[i]<20)
cout<<"a["<<i+1<<"]="<<mang[i]<<" ";
}cout<<endl;
}

69. Vit chng trnh nhp vo mng mt chiu cc s

nguyn v xut ra mn hnh cc phn t l s nguyn
t.
#include <iostream.h>
void nhapmang(int mang[],int &n);
void SNT(int mang[],int &n);
int main(int argc, char *argv[])
{
int mang[100];

int n;
nhapmang(mang,n);
SNT(mang,n);
return 0;
}
void nhapmang(int mang[],int &n)
{
cout<<"nhap so phan tu: ";
cin>>n;
int i;
for( i=0;i<n;i++)
{
cout<<"nhap gia tri phan tu ["<<i+1<<"]:";
cin>>mang[i];
}
}
void SNT(int mang[],int &n)
{
int i,dem;
for( i=0;i<n;i++)
{

dem=0;
for(int t=1;t<=mang[i];t++)
if(mang[i]%t==0)dem++;
if(dem==2)
cout<<"a["<<i+1<<"]="<<mang[i]<<", ";
}
cout<<endl;
}

70. Vit chng trnh nhp vo mng mt chiu cc snguyn v xut

ra mn hnh cc phn t l s chnh phng nm ti nhng v tr l trong
mng.
#include <iostream.h>

void nhapmang(int mang[],int &n);

void SCP(int mang[],int &n);
int main(int argc, char *argv[])
{
int mang[100];
int n;
nhapmang(mang,n);
SCP(mang,n);
return 0;
}
void nhapmang(int mang[],int &n)
{
cout<<"nhap so phan tu: ";
cin>>n;
int i;
for( i=0;i<n;i++)
{
cout<<"nhap gia tri phan tu a["<<i<<"]=";
cin>>mang[i];
}
}
void SCP(int mang[],int &n)

{
int i,j;
for( i=0;i<n;i++)
{
if(i%2==1)
{
j=1;
while (j*j<mang[i])
j++;
if(j*j==mang[i])
cout<<"a["<<i<<"]="<<mang[i]<<", ";
}
}
cout<<endl;
}

1.2.2) Tm kim
71. Vit phng thc tm vtr phn tc gi trx xut hin cui cng
trong mng.
#include <iostream.h>
void nhapmang(int mang[],int &n);
int tim(int mang[],int n,int x);
int main(int argc, char *argv[])
{
int mang[100];
int n,x,i;
nhapmang(mang,n);
cout<<"nhap x=";
cin>>x;
i=tim(mang,n,x);
if (i>0)
cout<<"vi tri xuat hien cua so "<<x <<
" sau cung la vi tri: "<<i;
else
cout<<"Khong tim thay "<<x<<" trong mang:";
cout<<endl;
return 0;

}
void nhapmang(int mang[],int &n)
{
cout<<"nhap so phan tu: ";
cin>>n;
int i;
for( i=0;i<n;i++)
{
cout<<"nhap gia tri phan tu ["<<i+1<<"]:";
cin>>mang[i];
}
}
int tim(int mang[],int n,int x)
{
int i;
for( i=n-1;i>=0;i--)
{
if(mang[i]==x) return i;
}
return 0;
cout<<endl;
}

72. Vit phng thc tm vtr ca phn tnhnht trong mng cc s

nguyn.
#include <iostream.h>
void nhapmang(int mang[],int &n);
void timM(int mang[],int &n);
int main(int argc, char *argv[])
{
int mang[100];
int n;
nhapmang(mang,n);
timM(mang,n);
return 0;
}
void nhapmang(int mang[],int &n)
{

cout<<"nhap so phan tu: ";

cin>>n;
int i;
for( i=0;i<n;i++)
{
cout<<"nhap gia tri phan tu ["<<i+1<<"]:";
cin>>mang[i];
}
}
void timM(int mang[],int &n)
{
int i,min=mang[0];
for(i=0;i<n;i++)
if(min>mang[i])
min=mang[i];
cout<<"gia tri nho nhat trong mang la:"<<min<<"\n";
}

73. Vit phng thc tm v tr ca phn t ln nht trong mng cc s

nguyn.
#include <iostream.h>
void nhapmang(int mang[],int &n);
void timkiem(int mang[],int n);
int main(int argc, char *argv[])
{
int mang[100];
int n;
nhapmang(mang,n);
timkiem(mang,n);
return 0;
}
void nhapmang(int mang[],int &n)
{

cout<<"nhap so phan tu: ";

cin>>n;
int i;
for( i=0;i<n;i++)
{
cout<<"nhap gia tri phan tu ["<<i+1<<"]:";
cin>>mang[i];
}
}
void timkiem(int mang[],int n)
{
int i,max=mang[0];
for( i=1;i<n;i++)
if(max<mang[i])
max=mang[i];
cout<<"gia tri lon nhat trong mang la "<<max<<" ";
}