8.4.3 ÔÚÒ»¸ö×Ö·ûÊý×éÖдæ·Å¡°AbcDEfg¡±×Ö·û´®£¬±àд³ÌÐò£¬°Ñ¸Ã×Ö·û´®ÖеÄСд×Öĸ±äΪ
´óд×Öĸ£¬°Ñ¸Ã×Ö·û´®ÖеĴóд×Öĸ±äΪСд×Öĸ£¬ÓÃÖ¸ÕëµÄ·½·¨½øÐбà³Ì¡£ #include void main() { char a[10]=\ for (p=a;*p!='\\0';p++) { if(*p>='a'&& *p<='z')
*p=*p-32; else if(*p>='A'&& *p<='Z') *p=*p+32; } printf(\ puts(a); printf(\ }
8.4.4 ÓÃ×Ö·ûÖ¸Õë±äÁ¿£¬½øÐÐ5¸ö×Ö·û´®µÄÊäÈ룬×Ö·û´®´óСµÄ±È½Ï£¬²¢ÇÒÊä³ö5¸ö×Ö·û´®
ÖÐ×îСµÄ×Ö·û´®¡£ #include #include void main() { char a[5][20],*p; int i; for (i=0;i<5;i++) { gets(a[i]); } for (i=1,p=a[0];i<5;i++) { if (strcmp(a[i],p)>0) p=a[i]; } printf(\ puts(p); printf(\ }
8.4.5 ÔÚÖ÷º¯ÊýÖÐËæ»úÊäÈë20¸öÊýÔÚÒ»¸öÊý×éÖÐ, ͨ¹ýÔËËã´¦ÀíÊä³ö¸ÃÊý×éÖеÄ×îСֵ¡£Æä
ÖÐÈ·¶¨×îСֵµÄϱêµÄ²Ù×÷ÔÚ×Óº¯ÊýʵÏÖ,Çë¸ø³ö¸Ãº¯ÊýµÄÖ÷º¯ÊýÓë×Óº¯ÊýµÄÍêÕû³ÌÐò¡£
#include int fun(int a[],int n) { int i,maxi; for (i=1,maxi=0;i
if (a[i]>a[maxi]) maxi=i; return(maxi); }
void main() { int a[20],maxi; int i; for (i=0;i<20;i++) { scanf(\ } maxi=fun(a,20); printf(\ }
8.4.6 ÔÚÖ÷º¯ÊýÖÐÓÐ30¸öѧÉú£¬ÈýÃſγ̣¬ÓöþάÊý×é´æ·Å¸ÃÐÅÏ¢£»ÓÃ×Óº¯Êý¶ÔÊý×éµÄÐÅ
Ï¢·Ö±ð½øÐÐÈçϵIJÙ×÷£º£¨1£©Êä³öÿÃÅ¿Î³ÌµÄÆ½¾ù·Ö£¨2£©Êä³öÿÃſγ̵Ä×î¸ß·Ö¡¢×îµÍ·Ö£¨3£©Í³¼ÆÃ¿Ãſγ̲»¼°¸ñÈËÊý¡£ #include #define N 30
void average(int a[][3],int n) {int i,j;
float ave[3],num[3];
for (i=0;i<3;i++) num[i]=0.0;
for (j=0;j<3;j++) for (i=0;iprintf(\for (i=0;i<3;i++) printf(\printf(\ }
void max(int a[][3],int n) { int i,j; int max[3],min[3]; for (j=0;j<3;j++) { max[j]=min[j]=a[0][j]; for (i=1;imax[j]) max[j]=a[i][j]; if(a[i][j]void count(int a[][3],int n) {int i,j,num[3];
for (i=0;i<3;i++) num[i]=0;
for (j=0;j<3;j++) for (i=0;ifor (i=0;i<3;i++) printf(\ }
void main() { int a[N][3]; int i,j; for (i=0;i