#include #include #define maxx 100 #include void nhap_mang(int A[],int n); int kt_so_nguyen_to(int kt); int kt_so_doi_xung(int kt); int kt_so_chinh_phuong(int kt); int kt_so_boi_ba(int kt); int main() { int A[maxx],n,Scp=0,Sbb=0;; printf("nhap vao so luong phan tu trong mang : "); scanf("%d",&n); while(n<=0 || n>maxx) { printf("nhap lai so luong phan tu cua mang: "); scanf("%d",&n); } nhap_mang(A,n); printf("\n cac so nguyen to la: "); for(int i=0;i0;i=i/10) { int du1=i%10; du+=du1; } if(du%3==0) { return 1; } return 0; } int kt_so_doi_xung(int k) { int so_dao=0,chu_so,kt=k; do { chu_so=kt%10; so_dao=so_dao*10+chu_so; kt=kt/10; } while(kt>0); if(so_dao==k) { return 1; } return 0; }