C语言程序设计课后习题答案(第四版)谭浩强

1、精品Word文档欢迎下载 1-5 #in elude int mai n () printf (*nn) prin tf(Very Good!nn); printf (*n) return 0; 1-6#i nclude int mai n() int a,b,c,max; prin tf(please in put a,b,c:n); scan f(%d,%d,%d, max=a; if (maxb) max=b; if (maxc) max=c; prin tf(The largest nu mber is %dn,max); return 0; 4-4-1 #i nclude int m

2、ai n() int a,b,c; printf(请输入三个整数：”)； scan f(%d,%d,%d, if (ab) if (bc) prin tf(max=%dn,c); else prin tf(max=%dn,b); else if (ac) prin tf(max=%dn,c); else prin tf(max=%dn,a); return 0; 4- 6. #i nclude int mai n() int x,y; printf(输入 x:); scan f(%d， 可编辑和修改 if(x1) y=x; prin tf(x=%3d, else if(x10) y=2*x-1

3、; prin tf(x=%d, else y=3*x-11; prin tf(x=%d, return 0; /* x1 */ y=x=%dn ,x,y); /* 1= x=10*/ y=3*x-11= %dn,x,y); 4-7-1 #i nclude int mai n() int x,y; prin tf(e nter x:); scan f(%d， y=-1; if(x!=0) if(x0) y=1; else y=0; prin tf(x=%d,y=%dn,x,y); return 0; 4- 7-2 #i nclude int mai n() int x,y; prin tf(pl

4、ease en ter x:); scan f(%d， y=0; if(x=0) if(x0) y=1; else y=-1; prin tf(x=%d,y=%dn,x,y); return 0; 4- 8 #i nclude int mai n() float score; char grade; printf(请输入学生成绩：”)； scan f(%f, while (score100|score0) printf(n输入有误，请重输”)； scan f(%f, switch(i nt)(score/10) case 10: case 9: grade=A;break; case 8: g

5、rade=B;break; case 7: grade=C;break; case 6: grade=D;break; case 5: case 4: case 3: case 2: case 1: case 0: grade=E; printf(成绩是 %5.1f,相应的等级是 %cn ,score,grade); return 0; 4-11 #i nclude int mai n() i nt t,a,b,c,d; printf(请输入四个数:); scan f(%d,%d,%d,%d, prin tf(a=%d,b=%d,c=%d,d=%dn,a,b,c,d); if (ab) t=a

6、;a=b;b=t; if (ac) t=a;a=c;c=t; if (ad) t=a;a=d;d=t; if (bc) t=b;b=c;c=t; if (bd) t=b;b=d;d=t; if (cd) t=c;c=d;d=t; printf(”排序结果如下：n); prin tf(%d %d %d %d n,a,b,c,d); return 0; 4- 12 #i nclude int mai n() int h=10; float X1=2,y1=2,x2=-2,y2=2,x3=-2,y3=-2,x4=2,y4=-2,x,y,d1,d2,d3,d4; printf(请输入一个点(x,y):

7、); scan f(%f,%f, d仁(x-x4)*(x-x4)+(y-y4)*(y-y4);/*求该点到各中心点距离 */ d2=(x-x1)*(x-x1)+(y-y1)*(y-y1); d3=(x-x2)*(x-x2)+(y-y2)*(y-y2); d4=(x-x3)*(x-x3)+(y-y3)*(y-y3); if (d11 /* 判断该点是否在塔外 */ printf(该点高度为 %dn,h); return 0; 5- 3 #i nclude int mai n() intp,r, n, m,temp; printf(请输入两个正整数n ,m:); scan f(%d,%d, if

8、(nm) temp=n; n=m; m=temp; p=n*m; while(m!=0) r=n %m; n=m; m=r; printf(”它们的最大公约数为：dn,n); printf(”它们的最小公约数为：dn,p/n); return 0; 5- 4 #i nclude int mai n() char c; int letters=0,space=0,digit=0,other=0; printf(请输入一行字符:n); while(c=getchar()!=n) if (c=a else other+; printf(字母数:%dn 空格数:%dn 数字数：dn 其它字符数:%dn

9、,letters,space,digit,other); return 0; 5-5 #i nclude int mai n() int a,n ,i=1,s n=0,t n=0; prin tf(a ,n=:); scan f(%d,%d, while (i=n) tn=tn+a;/*赋值后的tn为i个a组成数的值*/ sn=sn+tn; /*赋值后的sn为多项式前i项之和*/ a=a*10; +i; prin tf(a+aa+aaa+.=%dn,s n); return 0; 5- 6 #i nclude int mai n() double s=O,t=1; int n; for (n=

10、1; n=20; n+) t=t* n; s=s+t; prin tf(1!+2!+.+20!=%22.15en,s); return 0; 5- 7 #in clude int mai n() int n1=100 ,n 2=50 ,n 3=10; double k,s1=0,s2=0,s3=0; for (k=1;k=n 1;k+) s1=s1+k; for (k=1;k=n2;k+) /*计算1到100的和*/ /*计算1到50各数的平方和*/ s2=s2+k*k; /*计算1到10的各倒数和*/ for (k=1;k=n3;k+) s3=s3+1/k; prin tf(sum=%15.

11、6fn,s1+s2+s3); return 0; 5-8 #i nclude int mai n() int i,j,k, n; prin tf(parcissus nu mbers are ); for (n=100 ;n 1000; n+) i=n/100; j=n/10-i*10; k=n %10; if (n=i*i*i + j*j*j + k*k*k) prin tf(%d ”,n); prin tf(n); return 0; 5- 10 #i nclude int mai n() int i,n=20; double a=2,b=1,s=0,t; for (i=1;i=n ;i+

12、) s=s+a/b; t=a, a=a+b, b=t; prin tf(sum=%16.10fn,s); return 0; 5-11 #i nclude int mai n() double sn=100,h n=s n/2; int n; for (n=2; n=10; n+) sn=sn+2*hn; /*第n次落地时共经过的米数*/ hn=hn/2;/*第n次反跳高度*/ printf(第10次落地时共经过 %f米n”,sn); printf(第 10 次反弹 %f 米n,hn); return 0; 5-12 #i nclude int mai n() int day,x1,x2; d

13、ay=9; x2=1; while(day0) x仁(x2+1)*2;/*第1天的桃子数是第 2天桃子数加1后的2倍.*/ x2=x1; day-; prin tf(total=%dn,x1); return 0; 5-13 #i nclude #in clude int mai n() float a,x0,x1; prin tf(e nter a positive nu mber:); scan f(%f, x0=a/2; x1= (x0+a/x0)/2; do x0=x1; x1= (x0+a/x0)/2; while(fabs(x0-x1)=1e-5); prin tf(The squ

14、are root of %5.2f is %8.5fn,a,x1); return 0; 5-15 #i nclude #in clude int mai n() float x0,x1,x2,fx0,fx1,fx2; do pri ntf(e nter x1 scan f(%f,%f, fx仁 x1*(2*x1-4)*x1+3)-6; fx2=x2*(2*x2-4)*x2+3)-6; while(fx1*fx20); do x0=(x1+x2)/2; fx0=x0*(2*x0-4)*x0+3)-6; if (fx0*fx1)=1e-5); prin tf(x=%6.2fn ,x0); ret

15、urn 0; 5- 16 #i nclude int mai n() i nt i,j,k; for (i=0;i=3;i+) for (j=0;j=2-i;j+) prin tf(”)； for (k=0;k=2*i;k+) prin tf(*); prin tf(n); for (i=0;i=2;i+) for (j=0;j=i;j+) prin tf(); for (k=0;k=4-2*i;k+) prin tf(*); prin tf(n); return 0; 6- 1 #i nclude #in clude int mai n() int i,j,n ,a101; for (i=1

16、;i=100;i+) ai=i; a1=0; for (i=2;isqrt(100);i+) for (j=i+1;j=100;j+) if(ai!=0 prin tf(n); for (i=2, n=0;i=100;i+) if(ai!=0) pri ntf(%5d,ai); n+; if(n=10) pri ntf(n ”); n=0; prin tf(n); return 0; 6- 2 #i nclude int mai n() int i,j,min,temp,a11; prin tf(e nter data:n); for (i=1;i=10;i+) pri ntf(a%d=,i)

17、; scan f(%d, prin tf(n); prin tf(The orginal nu mbers:n); for (i=1;i=10;i+) prin tf(%5d,ai); prin tf(n); for (i=1;i=9;i+) mi n=i; for (j=i+1;jaj) min=j; temp=ai; ai=ami n; ami n=temp; prin tf(nThe sorted nu mbers:n); for (i=1;i=10;i+) prin tf(%5d,ai); prin tf(n); return 0; 6- 3 #in clude int mai n()

18、 int a33,sum=0; int i,j; prin tf(e nter data: n); for (i=0;i3;i+) for (j=0;j3;j+) sca nf(%3d, for (i=0;i3;i+) sum=sum+aii; prin tf(sum=%6dn,sum); return 0; 6- 4 #i nclude int mai n() int a11=1,4,6,9,13,16,19,28,40,100; int temp1,temp2, nu mber,e nd,i,j; prin tf(array a:n); for (i=0;ie nd) a10=nu mbe

19、r; else for (i=0;inu mber) temp1=ai; ai=nu mber; for (j=i+1;j11;j+) temp2=aj; aj=temp1; temp1=temp2; break; prin tf(Now array a:n); for (i=0;i11;i+) prin tf(%5d,ai); prin tf(n); return 0; 6-5 #i nclude #defi ne N 5 int mai n() int aN,i,temp; prin tf(e nter array a:n); for (i=0;iN;i+) scan f(%d, prin

20、 tf(array a:n); for (i=0;iN;i+) /循环的作用是将对称的元素的值互换 prin tf(%4d,ai); for (i=0;iN/2;i+) temp=ai; ai=aN-i-1; aN-i-1=temp; prin tf(nN ow,array a:n); for (i=0;iN;i+) prin tf(%4d,ai); prin tf(n); return 0; 6-6 #i nclude #defi ne N10 int mai n() int i,j,aNN; for (i=0;iN;i+) aii=1; ai0=1; for (i=2;iN;i+) for

21、 (j=1;j=i-1;j+) aij=ai-1j-1+ai-1j; for (i=0;iN;i+) for (j=0;j=i;j+) prin tf(%6d,aij); prin tf(n); prin tf(n); return 0; ouno 宀 M=uru_d 二耳二5-pg%=)tu_d (+ruuvruD0二 (+土CHVUD04 SO 空=曰B oHm 二 B 二一 宀 =(UAD 七 C上(LVD2 Z+卫 (UAD 筲(LVD)七 -L+ -V (+XFUUVXCXI艾)04 =三 e B+QU o=曰 e (+ruuvrUD04 (+UHVUD04 宀 oud (ol!.c

22、xl%u)0303(9UVU)0303OH.U)二一 e03- = p%=ueos c(9Tuu)u9utu_d (LsdozM Bud c-dgr 二9L=9Lro-u 二 ouroUJ -u 一 Alloplsv pnQu 軒 s 精品Word文档欢迎下载 可编辑和修改 6-8 #in elude #defi ne N 4 #defi ne M 5 /*数组为4行5列*/ int mai n() int i,j,k,aNM,max,maxj,flag; prin tf(please in put matrix: n); for (i=0;iN;i+) for (j=0;jM;j+) sca

23、n f(%d, for (i=0;iN;i+) max=ai0; maxj=0; for (j=0;jmax) max=aij; maxj=j; flag=1; for (k=0;kakmaxj) flag=0; con ti nu e; if(flag) /*输入数组*/ /*开始时假设ai0最大*/ /*将列号0赋给maxj保存*/ /*找出第i行中的最大数*/ /*将本行的最大数存放在max中*/ /*将最大数所在的列号存放在maxj中*/ /*先假设是鞍点，以flag为1代表*/ /*将最大数和其同列元素相比*/ /*如果max不是同列最小，表示不是鞍点令flagl为0 */ /*如果

24、flagl为1表示是鞍点 */ printf(a%d%d=%dn,i,maxj,max);/* 输出鞍点的值和所在行列号 */ break; if(!flag) prin tf(It is n ot exist! n); return 0; /*如果flag为0表示鞍点不存在*/ 6-9 #i nclude #defi ne N 15 int mai n() in t i, nu mber,top,bott,mid,loca,aN,flag=1,sig n; char c; prin tf(e nter data: n); scan f(%d, i=1; while(i=ai-1) i+; e

25、lse prin tf(e nter this data aga in:n ”)； prin tf(n); for (i=0;iN;i+) prin tf(%5d,ai); prin tf(n); while(flag) printf(input number to look for:); sca nf(%d, sig n=0; top=0;/top是查找区间的起始位置 bott=N-1;/bott是查找区间的最末位置 if (nu mberaN-1)/ 要查的数不在查找区间内 loca=-1;/表示找不到 while (!sig n) if (nu mber=amid) loca=mid;

26、printf(Has found %d, its position is %dn,number,loca+1); sig n=1; else if (nu mberMO)换(.V.=MO) j! (.0.=iMO)9|!MM 0= ：(ip“s%:apoooi|dQu“)HU!d !(qo)s;a6 !(u:apooaqdio in dui.Juud :08uejr081MO JBi|0 U打uj OujeuJ A opnQU!# -BSL-9 ：0 ujnjaj t(屮o“up% :Jo屮o“)#u!d ：(Eds“up%:aoedsjBuud !p：up% :i!b!p“)#U!d ：(/

27、vo|“up% :aseo jaMOi.Juud !(ddn“up% :aseoaddnuyjuud ：+屮0 3S|3 !+eds (.=!to)esia !+6ip (6=fl山xoi 资 O=町!晌资匕=fl山x巩 $=P0=D0j !(!;xaj)sja6 +r“u：P% sun indu! aseaidjuud (+!：0=!)Oj !0=iHO=eds=6!p=MO|=dd n JO0lx 印 Jeqo goEdsdpMOiddn! ;ui OujeuJ A opnQU!# 0k9 皑s矣聊赛丘 CL6UES Indu prin tf(i nput stri ng2:); scan

28、 f(%s,s2); while (s1i!=0) i+； while(s2j!=0) s1i+=s2j+; s1i=0： printf(nThe new string is:%sn,s1); return 0; 7-1-1 #i nclude int mai n() int hcf(i nt,i nt); int lcd(i nt, in t,i nt); int u,v,h,l; scan f(%d,%d, h=hcf(u,v); prin tf(H.C.F=%dn,h); l=lcd(u,v,h); prin tf(L.C.D=%dn,l); return 0; int hcf(int

29、u,i nt v) int t,r; if (vu) t=u;u=v;v=t; while (r=u%v)!=0) u=v; v=r; return(v); in t lcd(i nt u,i nt v,i nt h) return(u*v/h); 7-3 #i nclude int mai n() int prime(i nt); int n; 可编辑和修改 printf(input an integer:); scan f(%d, if (prime( n) prin tf(%d is a prime.n, n); else printf(%d is not a prime.n,n); r

30、eturn 0; int prime(i nt n) int flag=1,i; for (i=2;in/2 i+) if (n %i=0) flag=0; return(flag); 7-4 #i nclude #defi ne N 3 int arrayNN; int mai n() void con vert(i nt array3); int i,j; prin tf(i nput array: n); for (i=0;iN;i+) for (j=0;jN;j+) sca nf(%d, prin tf(norigi nal array :n); for (i=0;iN;i+) for

31、 (j=0;jN;j+) prin tf(%5d,arrayij); prin tf(n); con vert(array); prin tf(c onvert array: n); for (i=0;iN;i+) for (j=0;jN;j+) prin tf(%5d,arrayij); prin tf(n); return 0; void con vert(i nt array3) int i,j,t; for (i=0;iN;i+) for (j=i+1;jN;j+) t=arrayij; arrayij=arrayji; arrayji=t; #i nclude #in clude i

32、nt mai n() void in verse(char str); char str100; prin tf(i nput stri ng:); scan f(%s,str); in verse(str); prin tf(i nverse stri ng:%sn,str); return 0; void in verse(char str) char t; int i,j; for (i=0,j=strle n(str);i(strle n(str)/2);i+,j_) t=stri; stri=strj-1; strj-1=t; 7-6 #i nclude int mai n() vo

33、id con cate nate(char stri ng1,char stri ng2,char stri ng); char s1100,s2100,s100; prin tf(i nput stri ng1:); scan f(%s,s1); prin tf(i nput stri ng2:); scan f(%s,s2); con cate nate(s1,s2,s); printf(nThe new string is %sn,s); return 0; void con cate nate(char stri ng1,char stri ng2,char stri ng) int

34、i,j; for (i=0;stri ng1i!=0;i+) stri ngi=stri ng1i; for(j=0;stri ng2j!=0;j+) stri ngi +j=stri ng2j; stri ngi+j=O： 7-7 #i nclude int mai n() void cpy(char ,char ); char str80,c80; prin tf(i nput stri ng:); gets(str); cpy(str,c); prin tf(The vowel letters are:%sn,c); return 0; void cpy(char s,char c) i

35、nt i,j; for (i=O,j=O;si!=O;i+) if (si=a|si=A|si=e|si=E|si=i| si=T|si=o|si=O|si=u|si=U) cj=si; j+; cj=0; 7-8 #i nclude #in clude int mai n() char str80; void in sert(char ); prin tf(i nput four digits:); scan f(%s,str); in sert(str); return 0; void in sert(char str) int i; for (i=strle n( str);iO;i-)

36、 str2*i=stri; str2*i-1=; prin tf(output:n%sn ”,str); 7-9 #i nclude in t letter,digit,space,others; int mai n() void coun t(char ); char text80; prin tf(i nput stri ng:n); gets(text); prin tf(stri ng:); puts(text); letter=0; digit=0; space=0; others=0; coun t(text); prin tf(nl etter:%dn digit:%dnspac

37、e:%dino thers:%dn ,letter,digit,space,others); return 0; void coun t(char str) int i; for (i=O;stri!=O;i+) if (stri=a else if (stri=32) space+; else others+; 7-10 #in clude #in elude int mai n() int alphabetic(char); int Ion gest(char ); int i; char lin e100; prin tf(i nput one lin e:n); gets(l in e

38、); prin tf(The Ion gest word is :); for (i=Ion gest(l in e);alphabetic(l in ei);i+) prin tf(%c,li nei); prin tf(n ”); return 0; int alphabetic(char c) if (c=a else return(0); int Ion gest(char stri ng) int len=0,i,le ngth=0,flag=1,place=0,po int; for (i=0;i=le ngth) le ngth=le n; place=po int; len=0

39、; return(place); 7-11 #i nclude #in elude #defi ne N 10 char strN; int mai n() void sort(char ); int i,flag; for (flag=1;flag=1;) pri ntf(i nput stri ng:n); sca nf(%s， if (strle n( str)N) printf(string too Iong,input again!); else flag=0; sort(str); prin tf(stri ng sorted:n); for (i=0;iN;i+) prin tf

40、(%c,stri); prin tf(n ”); return 0; void sort(char str) int i,j; char t; for(j=1;jN;j+) for (i=0;(istri+1) t=stri; stri=stri+1; stri+1=t; 7-*14 #i nclude #defi ne N 10 #defi ne M 5 float scoreNM; float a_stuN,a_courM; int r,c; int mai n() int i,j; float h; float s_var(void); float highest。； void in p

41、ut_stu(void); void aver_stu(void); void aver_cour(void); in put_stu(); aver_stu(); aver_cour(); aver n); prin tf(nNO. cour1 cour2 cour3 cour4 cour5 for(i=0;iN;i+) pri ntf(n NO %2d ,i+1); for(j=0;jM;j+) prin tf(%8.2f,scoreij); prin tf(%8.2fn,a_stui); prin tf(naverage:); for (j=0;jM;j+) prin tf(%8.2f,

42、a_courj); prin tf(n); h=highest(); prin tf(highest:%7.2fNO. %2d course %2dn,h,r,c); prin tf(varia nee %8.2fn,s_var(); return 0; void in put_stu(void) int i,j; for (i=0;iN;i+) pri ntf(ni nput score of stude nt%2d:n,i+1); for (j=0;jM;j+) scan f(%f, void aver_stu(void) int i,j; float s; for (i=0;iN;i+)

43、 for (j=0,s=0;jM;j+) s+=scoreij; a_stui=s/5.0; void aver_cour(void) int i,j; float s; for (j=O;jM;j+) s=0; for (i=0;iN;i+) s+=scoreij; a_courj=s/(float)N; float highest() float high; int i,j; high=score00; for (i=0;iN;i+) for (j=0;jhigh) high=scoreij; r=i+1; c=j+1; return(high); float s_var(void) in

44、t i; float sumx,sumx n; sumx=0.0; sumx n=0.0; for (i=0;iN;i+) sumx+=a_stui*a_stui; sumx n+=a_stui; return(sumx/N-(sumx n/N)*(sumx n/N); 7-15 #i nclude #in clude #defi ne N 10 int mai n() void in put(i nt ,char n ame8); void sort(i nt ,char n ame8); void search(i nt ,in t ,char n ame8); int num N, nu

45、 mber,flag=1,c; char nameN8; in put (num,n ame); sort (num,n ame); while (flag=1) pri ntf(nin put nu mber to look for:); scan f(%d, search( nu mber, nu m, name); prin tf(co ntinue ot n ot(Y/N)?); getchar(); c=getchar(); if (c=N|c= n) flag=0; return 0; void in put(i nt nu m,char n ameN8) int i; for (

46、i=0;iN;i+) printf(input NO.:); scan f(%d, prin tf(i nput n ame:); getchar(); gets (n amei); void sort(i nt nu m,char n ameN8) int i,j,mi n, templ; char temp28; for (i=0;iN-1;i+) mi n=i; for (j=i;j nu mj)mi n=j; templ=nu mi; strcpy(temp2, namei); nu mi=nummin; strcpy (n amei, name min ); num mi n=tem

47、pl; strcpy( namemi n,temp2); prin tf(n result: n); for (i=0;in umN-1) loca=-1; while(sign=1) if (n=num mid) loca=mid; printf(NO. %d , his name is %s.n,n,nameloca); sig n=-1; else if (nnum mid) bott=mid-1; else top=mid+1; if (sig n=1 | loca=-1) prin tf(%d not bee n foun d.n, n); 8-1 #i nclude int mai

48、 n() void swap( int *p1,i nt *p2); int n1, n2,n3; int *p1,*p2,*p3; prin tf(i nput three in teger n1,n2,n 3:); scan f(%d,%d,%d, p仁 p2= p3= if(n 1 n2) swap(p1,p2); if(n 1n3) swap(p1,p3); if(n2n3) swap(p2,p3); printf(Now,the order is:%d,%d,%dn,n1,n2,n3); return 0; void swap( int *p1,i nt *p2) i nt p; p

49、=*p1; *p1=*p2; *p2=p; 8-2 #in clude #in clude int mai n() void swap(char *,char *); char str120,str220,str320; prin tf(i nput three lin e:n); gets(str1); gets(str2); gets(str3); swap(str1,str2); swap(str1,str3); swap(str2,str3); if(strcmp(str1,str2)0) if(strcmp(str1,str3)0) if(strcmp(str2,str3)0) pr

50、in tf(Now,the order is:n); prin tf(%sn%sn%sn,str1,str2,str3); return 0; void swap(char *p1,char *p2) char p20; strcpy(p,p1);strcpy(p1,p2);strcpy(p2,p); 8-3 #i nclude int mai n() void in put(i nt *); void max_min_value(i nt *); void output(i nt *); int number10; in put (nu mber); max_min_value( nu mb

51、er); output (nu mber); return 0; void in put(i nt *nu mber) int i; prin tf(i nput 10 nu mbers:); for (i=0;i10;i+) scan f(%d, void max_min_value(i nt *nu mber) int *max,*mi n,*p,temp; max= min=nu mber; for (p=nu mber+1;p *max) max=p; else if (*p*m in) min=p; temp=nu mber0; nu mber0=*mi n;*mi n=temp;

52、if(max=nu mber) max=mi n; temp=nu mber9; nu mber9=*max;*max=temp; void output(i nt *nu mber) int *p; printf(Now,they are:); for (p=nu mber;p nu mber+10;p+) prin tf(%d ,*p); prin tf(n); 8-4 #i nclude int mai n() void move(i nt 20,i nt,i nt); int nu mber20, n, m,i; prin tf(how many nu mbers?); scan f(

53、%d, prin tf(i nput %d nu mbers:n, n); for (i=0;i n;i+) sca nf(%d, prin tf(how many place you want move?); scan f(%d, move(nu mber, n, m); prin tf(Now,they are:n); for (i=0;iarray;p_) *p=*(p-1); *array=array_e nd; m-; if (m0) move(array ,n, m); 8-5 #i nclude int mai n() int i,k,m,n,num50,*p; prin tf(

54、nin put nu mber of pers on: n=”); scan f(%d, p=num; for (i=0;i n;i+) *(p+i)=i+1; i=0; k=0; m=0; while (m n-1) if (*(p+i)!=0)k+; if (k=3) *(p+i)=0; k=0; m+; i+; if (i=n) i=0; while(*p=0) p+; prin tf(The last one is NO.%dn,*p); return 0; 8-6 #i nclude int mai n() int len gth(char *p); in t le n; char

55、str20; prin tf(i nput stri ng:); sea nf(%s,str); len=len gth(str); prin tf(The len gth of stri ng is %d.n ,le n); return 0; in t le ngth(char *p) int n; n=0; while (*p!=0) n+; p+; return( n); 8-7 #i nclude #in clude int mai n() void copystr(char *,char *,i nt); int m; char str120,str220; prin tf(i n

56、put stri ng:); gets(str1); prin tf(which character that begi n to copy?); scan f(%d, if (strle n( str1)m) prin tf(i nput error!); else copystr(str1,str2,m); prin tf(result:%sn,str2); return 0; void copystr(char *p1,char *p2,i nt m) int n; n=0; while (n m-1) n+; p1+; while (*p1!=0) *p2=*p1; p1+; p2+；

57、 *p2=0： 8-8 #i nclude int mai n() int upper=0,lower=0,digit=0,space=0,other=0,i=0; char *p,s20; prin tf(i nput stri ng:); while (si=getchar()!=n) i+; p= while (*p!=n) if (A=*p) else if (a=*p) else if (*p=) +space; else if (*p=0) +digit; else +other; p+; prin tf(upper case:%dlower case:%d,upper,lower

58、); prin tf(space:%d digit:%dother:%dn,space,digit,other); return 0; 8-9 #i nclude int mai n() void move(i nt *po in ter); int a33,*p,i; prin tf(i nput matrix:n); for (i=0;i3;i+) sca nf(%d %d %d, p= move(p); prin tf(Now,matrix:n); for (i=0;i3;i+) prin tf(%d %d %dn,ai0,ai1,ai2); return 0; void move(i

59、nt *po inter) int i,j,t; for (i=0;i3;i+) for (j=i;j3;j+) t=*(poi nter+3*i+j); *(poi nter+3*i+j)=*(poi nter+3*j+i); *(poi nter+3*j+i)=t; 8-10-2 #i nclude int mai n() void cha nge(i nt *p); int a55,*p,i,j; prin tf(i nput matrix: n); for (i=0;i5;i+) for (j=0;j5;j+) sca nf(%d, p= cha nge(p); prin tf(Now

60、,matrix:n); for (i=0;i5;i+) for (j=0;j5;j+) prin tf(%d ,aij); prin tf(n); return 0; void chan ge(i nt *p)/ 交换函数 int i,j,temp; int *pmax,*pmi n; pmax=p; pmi n=p; pmax,pmin for (i=0;i5;i+)/找最大值和最小值的地址拼赋给 for (j=i;j5;j+) if (*pmax*(p+5*i+j) pmi n=p+5*i+j; temp=*(p+12);将最大值与中心元素互换 *(p+12)=*pmax; *pmax=t