完整word版习题答案第四章算法设计与分析吕国英

1、算法设计与分析（第二版）习题答案第四章1.#i nclude int mai n(void) int buf100;int n;int i,j,k;sca nf(%d,&n); for(i=0;i n;i+) bufi=2;for(i=0;i n-1;i+) for(j=0;j n-i-1;j+)bufj+=2;for(j=0;j=10)bufj+1+=bufj/10;bufj=bufj%10; for(i=n-1;i=0;i-) p ri ntf(%d,bufi);prin tf(n); return 0; 2.#in clude int mai n(void)int n=2;int i;f

2、or(i=1;i=9;i+)n=( n+2)*2;prin tf(%dn, n);return 0;3.#i nclude int mai n(void) int a=54;int n;int m;printf(计算机先拿3张牌n);a=a-3;while(a=0) printf（还剩 d张牌 n,a）;pri ntf（你拿几张？请输入：）;sca nf(%d,&n); if(n 4| |n a)错误！重新拿牌n）;还剩d张牌n,a）; pri ntf( con ti nue;a=a-n;pri ntf( if(a=0) break;m=5-n; pri ntf(“计算机拿dn,m）;a=a-

3、m;return 0;4.#in clude int d;int a1,a2;int fun (i nt n);int mai n(void) int n; pri ntf(n=?,d=?,a仁？,a2=?);sca nf(%d%d%d%dn,&n,& d, &a1, &a2); prin tf(%dn,fu n(n);return 0;int fun (i nt n) if(n=1) retur n a1;if(n=2) return a2;return fun(n-2)-(fu n(n-1)-d)*2;5.#in clude char chess 88;int is_safe(i nt r

4、ow,i nt col);int quee n(i nt row,i nt col,i nt n);int main( void) int i,j;for(i=0;i8;i+) for(j=0;j8;j+) chessij=X： quee n(0,0,0);for(i=0;i8;i+) fora=0;j8;j+)pri ntf(%c ,chessij);pri ntf(n);return 0;int is_safe(i nt row,i nt col) int i,j;for(i=0;i8;i+)if(chessrowi=Q) return 0; if(chessicol=Q)return 0

5、;i=row;j=col;while(i!=-1 &j!=-1)if(chessi-H=Q) return 0;i=row;j=col;while(i!=-1 &j!=8) if(chessi-j+=Q) return 0;i=row;j=col;while(i!=8&j!=-1) if(chessi+jT=Q) return 0; i=row;j=col;while(i!=8&j!=8)if(chessi+j+=Q) return 0;return 1;int quee n(i nt row,i nt col,i nt n) int i,j;in t result=0;if(n=8) ret

6、urn 1; else if(is_safe(row,col)chessrowcol=Q;for(i=0;i8;i+)for(j=0;j0)break-if(resu-t0)refurn 1-e-se宀 chessrow=co-pxrefurn qe-sereturn q6.巷nc-udeAsfdicLhvinf main(void) 宀 infi-LKfor(n1for1kh33=+):5+)宀kulooirir(k&2H0)宀ir(3 丿+2*j+k/2K100)prinW 汁也 &d云 召也 &2n &2nvAn=-LLk=refurn q7.巷nc-udeAsfdicLhvinf ma

7、in(void) 宀 三二ror(n1=AH10000=+)宀ir(i&2H1 炉史&3X2 炉史&5X4 炉空&6X5 炉史&7HH0)prin 犬-&2rrDrefurn q8.#in clude int main( void)int i;int sum;int a1,a2,a3,a4;for(i=1000;i=9999;i+)a1=i%10;a2=i/10%10;if(a1!=a2) a3=i/100%10; if(a1!=a3&a2!=a3) a4=i/1000;if(a1!=a4&a2!=a4&a3!=a4)Sum=(a1+a2+a3+a4)*(a1+a2+a3+a4);if(i%s

8、um=0) prin tf(%dn,i);return 0;9.#i nclude #defi ne N 10 void max_ min (i nt *a,i nt m,i nt n ,i nt *min 1,i nt *min 2,i nt *max1,i nt *max2);int main( void)int aN=2,3,4,5,34,7,9,6,43,21;int mi n1,mi n2;int max1,max2;max_mi n(a,0,N-1,&mi n1,&mi n2,&max1,&max2);p ri ntf( min 1=%dnmin 2=%dnm ax1=%dnm a

9、x2=%dn,m in1,min 2,max1,max2);return 0;void max_ min (i nt *a,i nt m,i nt n ,i nt *min 1,i nt *min 2,i nt *max1,i nt *max2) int lmi n1,lmi n2,lmax1,lmax2;int rmi n1,rmi n2,rmax1,rmax2;int mid;if(m=n)*min 1=*m in 2=*max1=*max2=am; else if(m=n-1)if(ama n) *mi n1=am;*min 2=a n; *max1=a n; *max2=am;else

10、 *min 1=a n;*mi n2=am;*max1=am;*max2=a n;else mid=(m+n)/2;max_mi n( a,m,mid，&l mi n1,&l mi n2,&l max1,&lm ax2); max_mi n( a,mid+1, n,&r mi n1,&r mi n2,&r max1,&r max2); if(lmi n1rmi n1) if(lmi n2rmax1) if(lmax2rmax1) *max1=lmax1;*max2=lmax2; else *max1=lmax1;*max2=rmax1;else if(rmax2lmax1) *max1=rma

11、x1;*max2=rmax2; else*max1=rmax1;*max2=lmax1;10.#in clude int add(i nt *a,i nt flag,i nt right);int main( void) int a10=123,4,5,6,7,8,9,10;int sum=add(a,0,9);prin tf(%dn,sum);return 0;int add(i nt *a,i nt flag,i nt right)int mid;if(flag=right)return aflag;else if(flag=right-1)return aflag+aright;else

12、 mid=(flag+right)/2;retur n add(a,flag,mid)+add(a,mid+1,right);11.#i nclude int mai n(void)int a53= -50,17,-42, -47,-19,-3, 36,-34,-43, -30,-43,34,-23,-8,-45;int i,j;int max ,n;int sum=0; for(i=0;i5;i+) max=ai0; n=0;for(j=1;jmax)max=aij; n=j; sum+=max;p ri ntf(a%d%d=%dn,i, n,max);prin tf(%dn,sum);re

13、turn 0;12./* * File: n ewma in.c * Author: nirn ava* Created on 2010 年 4 月 22 日,下午 &21 */#in clude #in clude #defi ne N 4 void matrix_mul( int *mul1,i nt *mul2,i nt *mul3,i nt len gth); void matnx_add_sub(i nt * A,i nt * B,i nt * C,i nt m,char ch);void up date_half_value(i nt * A,i nt * B,i nt m); v

14、oid get_half_value( int * A,i nt * B,i nt m); int main( void) int i,j;in t mul1N*N=123,4,5,6,7,8,9,10,1,2,3,4,5,6; int mul2N*N=7,8,9,10,1,2,3,4,5,6,7,8,9,10,1,2;int mul3N*N;matrix_mul(mul1,mul2,mul3,N);for(i=0;iN*N;i+) prin tf(%5d,mul3i);if(i+1)%N=O) p ri ntf(n); return 0;void matrix_add_sub(i nt *

15、A,i nt * B,i nt * C,i nt m,char ch)int i;for(i=0;im*m;i+)if(ch=+)Ci=Ai+Bi;elseCi=Ai-Bi;void up date_half_value(i nt * A,i nt * B,i nt m)int i,j;for(i=0;ivm/2;i+)for(j=0;jm/2;j+)Bi*m+j=Ai*m/2+j;void get_half_value(i nt * A,i nt * B,i nt m)int i,j;for(i=0;im/2;i+)for(j=0;jm/2;j+)Ai*m/2+j=Bi*m+j;void m

16、atrix_mul (int *A,i nt *B,i nt *C,i nt m)if(m=2)in t D,E,FGH,I,J;D=A0*(B1-B3);E=A3*(B2-B0);F=(A2+A3)*B0;G=(A0+A1)*B3;H=(A2-A0)*(B0+B1);l=(A1-A3)*(B2+B3);J=(A0+A3)*(B0+B3);C0=E+I+J-G;C1=D+G;C2=E+F;C3=D+H+J-F;return ;else int A1m*m/4,A2m*m/4,A3m*m/4,A4m*m/4;int B1m*m/4,B2m*m/4,B3m*m/4,B4m*m/4;int C1m*

17、m/4,C2m*m/4,C3m*m/4,C4m*m/4;int Dm*m/4,Em*m/4,Fm*m/4,Gm*m/4,Hm*m/4,lm*m/4,Jm*m/4;int temp 1m*m/4,te mp 2m*m/4;get_half_value(A1,&A0,m);get_half_value(A2,&Am/2,m);get_half_value(A3,&Am*m/2,m);get_half_value(A4,&Am*m/2+m/2,m);get_half_value(B1,&B0,m);get_half_value(B2,&Bm/2,m);get_half_value(B3，&Bm*m/

18、2,m);get_half_value(B4,&Bm*m/2+m/2,m);matrix_add_sub(B2,B4,tem p1,m/2,-);matrix_mul(A1,te mp 1,D,m/2);matrix_add_sub(B3,B1,tem p1,m/2,-);matrix_mul(A4,te mp 1,E,m/2);matrix_add_sub(A3,A4,tem p1,m/2,+);matrix_mul(te mp 1,B1,F,m/2);matrix_add_sub(A1,A2,te mp 1,m/2,+);matrix_mul(te mp 1,B4,G,m/2);matri

19、x_add_sub(A3,A1,tem p1,m/2,-);matrix_add_sub(B1,B2,tem p2,m/2,+);matrix_mul(te mp 1,te mp 2,H,m/2);matrix_add_sub(A2,A4,tem p1,m/2,-);matrix_add_sub(B3,B4,tem p2,m/2,+);matrix_mul(te mp 1,te mp 2,I,m/2);matrix_add_sub(A1,A4,tem p1,m/2,+);matrix_add_sub(B1,B4,tem p2,m/2,+);matrix_mul(te mp 1,te mp 2,

20、J,m/2);matrix_add_sub(E,I,te mp 1,m/2,+);matrix_add_sub(J,G,tem p2,m/2,-);matrix_add_sub(tem p1,tem p2,C1,m/2,+); matrix_add_sub(D,G,C2,m/2,+);matrix_add_sub(E,F,C3,m/2,+);matrix_add_sub(D,H,tem p1,m/2,+);matrix_add_sub(J,F,tem p2,m/2,-);matrix_add_sub(tem p1,tem p2,C4,m/2,+);up date_half_value(C1,&

21、C0,m);up date_half_value(C2,&Cm/2,m);up date_half_value(C3,&Cm*m/2,m);up date_half_value(C4,&Cm*m/2+m/2,m);return ;13.#in clude int main( void) int a 67=16,4,3,12,6,0,3,4,-5,6,7,0,0,2, 6,0,-1,-2,3,6,8,5,3,4,0,0,27, -1,7,4,0,7,-5,6,0,-1,3,4,12,4,2 ;int b6 7,c67; int i,j,k;int max;int flag;int temp;fo

22、r(i=0;i6;i+)fora=0;j7;j+) bij=aij; cij=-1;for(i=1;i5;i+) for(j=0;j7;j+) max=0;for(k=j-2;k=j+2;k+) if(k6) break; else if(bij+bi-1kmax) max=bij+bi-1k; flag=k; bij=max; cij=flag; for(j=1;j=5;j+)max=0;for(k=j-2;kv=j+2;k+) if(k6) break;else if(bij+bi-1kmax) max=bij+bi-1k;flag=k; bij=max;cij=flag;max=0;fo

23、r(j=1;jmax)max=bij; flag=j;p ri ntf(%dn,max);temp=ciflag;prin tf(%5d,aitem p);for(j=i;j0;j-) temp=cjte mp; p ri ntf(%5d,a卜1tem p); pri ntf(n);return 0;14.#i nclude int main( void)int A6=0,3,7,9,12,13;int B6=0,5,10,11,11,11;int C6=0,4,6,11,12,12;int AB6 6;int temp 6;int abc 6;int max;int flag;int i,j

24、,k;for(i=0;i=5;i+)max=0;for(j=0;jmax) max=ABij;temp i=max;max=0;for(i=0;imax)max=abci;flag=i;p ri ntf(max=%dn,max); pri ntf(c=%dn,5-flag);max=max-C5-flag;for(i=0;i=flag;i+)if(ABflagi=max)pri ntf(b=%dn,i);pri ntf(a=%dn,flag-i); break;return 0;16.#i nclude #defi ne N 100 int search(i nt *a,i nt left,i

25、 nt right); int sum_buf(i nt *a,i nt left,i nt right); int main( void)int aN;int i;int s;for(i=O;iN;i+)ai=1;a24=2;s=search(a,0,N-1);prin tf(%dn,s);return 0;int sum_buf(i nt *a,i nt left,i nt right)int i;int sum=0;for(i=left;i=right;i+) sum+=ai; return sum;int search(i nt *a,i nt left,i nt right) int

26、 mid=(left+right)/2;if(left=right-1)if(aleftsum_buf(a,mid+1,right)return search(a,left,mid-1);else if(sum_buf(a,left,mid-1)sum_buf(a,mid+1,right) return search(a,left,mid); else retur n search(a,mid+1,nght);17.#in clude int job 62=3,8,12,10, 5,9,2,6,9.3, 11,1;int x6 ,bestx 6 ,f1=0,bestf,f27=0; void

27、try(i nt i);void swa p(i nt a,i nt b);int main( void)int i,j;bestf=32767;for(i=0;i6;i+) xi=i;try(0);for(i=0;i6;i+)pri ntf(%d ,bestxi);pri ntf(nbestf=%dn,bestf); return 0;void try(i nt i)int j;if(i=6) fora=0;j6;j+) bestxj=xj;bestf=f2i; else for(j=i;jf1) f2i+1=f2i+jobxj1; else f2i+1=f1+jobxj1;if(f2i+1

28、bestf) swa p(i,j); try(i+1);swa p(i,j); f1=f1-jobxj0; void swa p(i nt i,i nt j) int temp; temp=xi; xi=xj;xj=te mp; 18.#i nclude#defi ne N 5 /N#defi ne M 2 /M个数字个加号char bufN; int aN;char bM+1N;in t cM+1;int try(i nt t);void swap(int t1,i nt t2); int add();void out put();int min=99999;int mai n()int i

29、;for(i=0;iN;i+)sca nf(%c,&bufi);a0=0;for(i=1;i=M;i+)ai=1;for(;i=N) sum=add(); if(sum min) min=sum;for(i=0;ivM+1;i+) ci=atoi(bi);/* for(i=0;iN;i+)pri ntf(%d,ai);pri ntf(n);*/ else for(j=t;jN;j+)/if(at!=aj)swap (t,j);try(t+1);swap (t,j);/elsetry(t+1);void swap (i nt t1,i nt int t;t=at1;at1=at2;at2=t;i

30、nt add()int sum=0;int i=0;int j;int k=0;int h=0;for(i=0;ivM+1;i+) fora=0;jvN;j+) bij=Q； i=0;j=0；h=0;k=0;for(j=0;jN;j+)if(aj=1)h=0;i+;bih=bufj;/ prin tf(%d “,atoi(bi);/ prin tf(%d %d %c n,i,h,bih);h+; else bih=bufj;/ prin tf(%d %d %c n,i,h,bih);/ prin tf(%d ,atoi(bi);h+； /* for(i=0;iM+1;i+)for(j=0;jN;j+)pri ntf(%c ,bij);pri ntf(n);*/ for(i=0;iM+1;i+) sum+=atoi(bi);return sum;void out putOint i;for(i=0;iM+1;i+)prin tf(%d,atoi(bi