Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include"stdio.h"
- #include "conio.h"
- void Nhap(int a[], int n);
- void Xuat(int a[], int n);
- void caua(int a[], int n);
- void caub(int a[], int n);
- void cauc(int a[], int n);
- void caud(int a[], int n);
- void main()
- {
- int a[100];
- int n;
- printf("Nhap so phan tu cua mang : ");
- scanf("%d",&n);
- Nhap(a,n);
- Xuat(a,n);
- caua(a,n);
- caub(a,n);
- cauc(a,n);
- printf("Mang sau khi sap xep giam dan la : ");
- Xuat(a,n);
- caud(a,n);
- }
- void Nhap(int a[], int n)
- {
- for(int i = 0; i < n; i++)
- {
- printf("nhap a[%d] : ",i);
- scanf("%d",&a[i]);
- }
- }
- void Xuat(int a[], int n)
- {
- for(int i = 0; i < n; i++)
- {
- printf("%d ",a[i]);
- }
- }
- void caua(int a[], int n)
- {
- int dem;
- dem=0;
- for(int i = 0; i < n; i++)
- {
- if (a[i]>2016)
- dem=dem++;
- }
- printf("so phan tu lon hon 2016 la %d",dem);
- }
- void caub(int a[],int n)
- {
- int max=a[0];
- for(int i = 1; i < n; i++)
- {
- if (a[i]>max)
- max=a[i+1]
- }
- printf("phan tu lon nhat trong mang la %d",max);
- }
- void cauc(int A[], int n)
- {
- int i, j;
- int temp;
- for (i = 0; i < n - 1; i++)
- for(j = i+1; j < n; j++)
- if(A[i] < A[j])
- {
- temp = A[j];
- A[j] = A[i];
- A[i] = temp;
- }
- }
- int cp(int n)
- {
- if(n == sqrt(n) * sqrt(n))
- return 1;
- else
- return 0;
- }
- void caud(int a[],int n)
- {
- int i;
- int s=0;
- printf("Cac phan tu la so chinh phuog trong mang: \n");
- for(i=0;i<n;i++)
- {
- if(cp(a[i])%2!=0)
- {
- printf("a[%d] = %d \n",i,a[i]);
- s+=a[i];
- }
- }
- printf("Tong cac so chinh phuong le trong mang la: %d \n",s);
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement