2.3:xet trong day co so nguen to, in ra gia tri lon nhat nho nhat
#include<stdio.h>
#include<math.h>
#include<conio.h>
#include<stdlib.h>
void Nhapdayso(int N, unsigned int *a){
int i;
if(a != NULL){
printf("Ban hay nhap %d phan tu cua day:
", N);
for(i=0; i<N; i++){
scanf("%d", &a[i]);
}
}
else printf("Khong du bo nho!!!
");
}
int KtraNT(int N){
int i, d=0;
for(i=1; i <= N; i++){
if(N%i ==0){
d++;
}
}
if(d==2) return 1;
else return 0;
}
void VitriNT(int N, unsigned int *a){
int i;
for(i=0; i<N; i++){
if(KtraNT(a[i])){
printf("a[%d] = %d\t", i, a[i]);
}
}
printf("
");
}
void MINMAX(int N, unsigned int *a){
int i, d;
unsigned int min, max=0;
for(i=0; i<N; i++){
if(KtraNT(a[i])){
if(a[i]>max){
max = a[i];
d = i;
}
}
}
printf("So nguyen to long nhat cua day la:
a[%d] = %d
", d, max);
min = max;
for(i=0; i<N; i++){
if(KtraNT(a[i])){
if(a[i]<min){
min = a[i];
d = i;
}
}
}
printf("So nguyen to be nhat cua day la:
a[%d] = %d
", d, min);
}
void KiemtraNT(int N, unsigned int *a){
int i, j, d=0;
for(i=0; i<N; i++){
if(KtraNT(a[i])){
printf("Day da cho co so nguyen to!
");
printf("Vi tri cua cac so nguyen to trong day la:
");
VitriNT(N, a);
MINMAX(N, a);
break;
}
else d++;
}
if(d==N) printf("Day da cho khong co so nguyen to!
");
}
main()
{
int N;
unsigned int *a;
printf("Ban muon nhap day so co bao nhieu phan tu?
");
scanf("%d", &N);
a = malloc(N*sizeof(int));
Nhapdayso(N, a);
KiemtraNT(N, a);
getch();
free(a);
return 0;
}
Bạn đang đọc truyện trên: Truyen247.Pro