Thanks to visit codestin.com
Credit goes to www.scribd.com

0% found this document useful (0 votes)
28 views6 pages

Int TBC (Int A, Int N)

Uploaded by

NoNo official
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
28 views6 pages

Int TBC (Int A, Int N)

Uploaded by

NoNo official
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 6

 #include<iostream>

#include<cmath>
using namespace std;
int nhap(int a[], int n)
{cout<<"\n nhap cac phan tu mang"<<endl;
for(int i=0;i<n;i++)
{ cout<<"a["<<i<<"]=";
cin>>a[i];}}
int tbc(int a[], int n)
{int s=a[0];
for(int i=0;i<=n;i++)
{ s=s+a[i];}
float tbc=s/n;
return tbc;}
int sapxeptangdan(int a[], int n)
{int i,j,tg;
cout<<"\n cac pt sx tang dan la ";
for(i=0;i<n-1;i++)
for(j=i+1;j<n;j++)
if(a[i]>a[j])
{ tg=a[i];a[i]=a[j];a[j]=tg;}
for(i=0;i<n;i++)
cout<<a[i]<<" ";}
int main()
{int a[10],n,i;
cout<<"nhap vao n ";cin>>n;
if(n>0)
{nhap(a,n);
sapxeptangdan(a,n);}
cout<<"\n tbc="<<tbc(a,n);
return 0; }

 using namespace std;


int nhap(int a[], int n)
{cout<<"\n nhap cac phan tu mang"<<endl;
for(int i=0;i<n;i++)
{ cout<<"a["<<i<<"]=";
cin>>a[i];}}
int tong(int a[], int n)
{int s=a[0];
for(int i=1;i<=n; i++)
s=s+a[i];
return s;}
int scp( int n)
{int m=sqrt(n);
if(m*m==n) return 1;
else return 0;}
int main()
{int a[10],n,i;
cout<<"nhap vao n ";cin>>n;
nhap(a,n);
cout<<"\n tong "<<tong(a,n);
cout<<"\n scp la ";
for(i=0; i<=n; i++)
if(scp(a[i])==1) cout<<a[i]<<" ";
tong(a,n);
return 0; }

 using namespace std;


int nhap(int a[], int n)
{cout<<"\n nhap cac phan tu mang"<<endl;
for(int i=0;i<n;i++)
{ cout<<"a["<<i<<"]=";
cin>>a[i];}}
int sochan( int n)
{ if(n%2==0) return 1;
else return 0;}
int sole( int n)
{ if(n%2!=0) return 1;
else return 0;}
int main()
{int a[10],n,i;
cout<<"nhap vao n ";cin>>n;
nhap(a,n);
cout<<"\n so chan";
for(i=0; i<=n; i++)
if(sochan(a[i])==1) cout<<a[i]<<" ";
cout<<"\n so le";
for(i=0; i<=n; i++)
if(sole(a[i])==1) cout<<a[i]<<" ";
return 0; }

 using namespace std;


int nhap(int a[], int n)
{cout<<"\n nhap cac phan tu mang"<<endl;
for(int i=0;i<n;i++)
{ cout<<"a["<<i<<"]=";
cin>>a[i];}}
int shh( int n)
{ int i,s=0;
for(i=1;i<n;i++)
if(n%i==0) s=s+i;
if(s==n)return 1;
else return 0;}
int snt( int n)
{ int i;
if(n==0||n==1)
for(i=2;i<=sqrt(n);i++)
if(n%i==0) return 1;
else return 0;}
int main()
{int a[10],n,i;
cout<<"nhap vao n ";cin>>n;
nhap(a,n);
cout<<"\n shh ";
for(i=0; i<=n; i++)
if(shh(a[i])==1) cout<<a[i]<<" ";
cout<<"\n snt ";
for(i=0; i<=n; i++)
if(snt(a[i])==1) cout<<a[i]<<" ";
return 0; }

 using namespace std;


int nhap(int a[], int n)
{cout<<"\n nhap cac phan tu mang"<<endl;
for(int i=0;i<n;i++)
{ cout<<"a["<<i<<"]=";
cin>>a[i];}}
int max(int a[], int n)
{ int max=a[0];
for(int i=0;i<n;i++)
if(max<a[i]) max=a[i];
return max;}
int min(int a[],int n)
{ int min=a[0];
for(int i=0;i<n;i++)
if(min>a[i]) min=a[i];
return min;}
int main()
{int a[10],n;
cout<<"nhap vao n ";cin>>n;
nhap(a,n);
cout<<"\n max "<<max(a,n);
cout<<"\n min "<<min(a,n);
return 0; }

You might also like