Lập trình C: Đề 9
Giải phóng thời gian, khai phóng năng lực
Câu 1:
1. void Nhap(int a[][99], int *N, int *M);
2. void Tinhtong(int N);
3. void Kiemtra(int N);
4. void Hoanvi(float *a, float *b);
Câu 2:
#include<stdio.h>
#include<conio.h>
#include<string.h>
void nhap(int *N, char a[][25])
{
int i;
do
{
printf("\nN = ");
scanf("%d",N);
}while(*N<=0 || *N>50);
printf("\nNhap cac chuoi:");
for(i=0; i<*N; i++)
{
fflush(stdin);
printf("\na[%d] = ",i);
gets(a[i]);
}
}
void minmax(int N, char a[][25], int *Min, int *Max)
{
int i;
*Min=strlen(a[0]);
for(i=1; i<N; i++)
if(strlen(a[i])<*Min)
*Min=strlen(a[i]);
*Max=strlen(a[0]);
for(i=1; i<N; i++)
if(strlen(a[i])>*Max)
*Max=strlen(a[i]);
printf("\nDo dai Min = %d\nDo dai Max=%d",*Min,*Max);
}
void hienthi(int N, char a[][25], int Min, int Max)
{
int i, flag=0;
printf("\nNhung chuoi co do dai >%d va <%d:",Min,Max);
for(i=0; i<N; i++)
if(strlen(a[i])>Min && strlen(a[i])<Max)
{
flag=1;
printf("\na[%d] = \"%s\"",i,a[i]);
}
if(flag==0)
printf("\nKhong co chuoi nao");
}
void main()
{
int N, Min, Max;
char a[50][25];
clrscr();
nhap(&N,a);
minmax(N,a,&Min,&Max);
hienthi(N,a,Min,Max);
getch();
}
Câu 3:
#include<stdio.h>
#include<conio.h>
void menu(void)
{
printf("\n1. Nhap N va mang so thuc kieu double");
printf("\n2. Tim so lon nhat va nho nhat");
printf("\n3. Tinh tong cac so lon nhat va nho nhat");
printf("\n4. Hien thi cac so lon nhat va nho nhat");
printf("\n5. Ket thuc");
}
void nhap(int *N, double a[])
{
int i;
do
{
printf("\nN = ");
scanf("%d",N);
}while(*N<=0 || *N>=100);
printf("\nNhap cac phan tu cua mang:");
for(i=0; i<*N; i++)
{
printf("\na[%d] = ",i);
scanf("%lf",&a[i]);
}
}
void maxmin(int N, double a[], double *Max, double *Min)
{
int i;
*Max=a[0];
for(i=1; i<N; i++)
if(*Max<a[i])
*Max=a[i];
*Min=a[0];
for(i=1; i<N; i++)
if(*Min>a[i])
*Min=a[i];
}
double tinhtong(int N, double a[], double Max, double Min)
{
int i;
double tong=0;
for(i=0; i<N; i++)
if(a[i]==Min || a[i]==Max)
tong+=a[i];
return tong;
}
void hienthi(int N, double a[], double Max, double Min)
{
int i;
printf("\nNhung phan tu Min la:");
for(i=0; i<N; i++)
if(a[i]==Min)
printf("\na[%d] = %lf",i,a[i]);
printf("\nNhung phan tu Max la:");
for(i=0; i<N; i++)
if(a[i]==Max)
printf("\na[%d] = %lf",i,a[i]);
}
void main()
{
int N,chon,flag=0;
double a[99], Max, Min;
clrscr();
menu();
while(1) {
printf("\nMoi ban chon 1 muc: ");
scanf("%d",&chon);
if(flag==0 && chon!=1 && chon!=5)
{
printf("\nBan can chon muc 1 truoc");
continue;
}
flag=1;
switch(chon)
{
case 1:
nhap(&N,a);
break;
case 2:
maxmin(N,a,&Max,&Min);
printf("\nPhan tu Max=%lf, phan tu Min=%lf",Max,Min);
break;
case 3:
printf("\nTong tat ca cac phan tu max ma min la: %lf",tinhtong(N,a,Max,Min));
break;
case 4:
hienthi(N,a,Max,Min);
break;
case 5: return;
}
}
getch();
}
Giải phóng thời gian, khai phóng năng lực