#include #include #include //==========================// Nhap Mang Dung De Quy// =====================================// void Nhap(int a[],int n) { if(n==0) return; Nhap(a, n-1);//nhap cho n-1 phan tu dau printf("\nNhap phan tu thu %d:",n-1); scanf("%d",&a[n-1]);// nhap cho phan tu cuoi cung trong mang } void NhapN(int &n) { do { printf("Nhap So Phan Tu Cua Mang : "); scanf("%d",&n); if (n<=0) printf("Nhap Sai Moi Nhap Lai \n"); } while (n<=0); } void NhapMang(int a[],int n)// nhap vao mang { if (n>0) // dieu kien { NhapMang(a,n-1); printf("Nhap Phan Tu Thu %d : ",n-1); scanf("%d",&a[n-1]); } } void XuatMang(int a[],int n) // xuat ra mang { if (n>0)// dieu kien { XuatMang(a,n-1); printf("%d\t",a[n-1]); } } long TongMang(int a[],int n) { if (n==0) return 0; long s = TongMang(a,n-1); return s = s + a[n-1]; } long TongChan(int a[],int n) { if (n==0) return 0; if (a[n-1]%2==0) return a[n-1]+TongChan(a,n-1); return TongChan(a,n-1); } int DemDuong(int a[],int n) { int dem=0; if(n==0) return 0; dem=DemDuong(a,n-1); if(a[n-1] > 0) dem++; return dem; } int PTLonNhat(int a[],int n) { if(n==0) return a[0]; int max=PTLonNhat(a,n-1); if(maxa[n-1]) min=a[n-1]; return min; } int ChanCuoi(int a[],int n) { if(n == 0) return 0; if(a[n-1]%2 == 0) return a[n-1]; ChanCuoi(a,n-1); } int ViTri(int a[],int n,int x) { if (n==0) return -1; if (a[n-1] == x) return n-1; ViTri(a,n-1,x); } int main() { int a[100],n; NhapN(n); printf("\nMoi Ban Nhap Cac Phan Tu \n"); NhapMang(a,n); printf("\nMang Ban Vua Nhap La : \n"); XuatMang(a,n); printf("\nTong Cac Phan Tu Cua Mang: %d \n",TongMang(a,n)); printf("Tong Cac Phan Tu Chan Cua Mang: %d \n",TongChan(a,n)); printf("So Phan Tu Duong La: %d \n",DemDuong(a,n)); printf("Phan Tu Lon nhat La: %d \n",PTLonNhat(a,n)); printf("Phan Tu Nho Nhat La: %d \n",PTNhoNhat(a,n)); printf("Phan Tu Chan Cuoi La: %d \n",ChanCuoi(a,n)); int x; printf("\nMoi Nhap Gia Tri Can Tim : "); scanf("%d",&x); if (ViTri(a,n,x)==-1) printf("Khong Tim Thay x : "); else printf("Tim Thay Tai Vi Tri : %d ",ViTri(a,n,x)); return 0; }