c语言第二版李丽娟第六章答案.doc

/*lx6-37*/# includeint cube( int n )int i,t;for(i=1,t=1;i=3;i+)t=t*n;return t;main() int a,b;printf(输入一个整数: );scanf(%d,&a);b=cube(a);printf(%d的立方是%d,a,b);/*lx6-38*/#include#includeint inv(int a);prime(int a) int b,k;if(a=2)return 1;else if (a%2=0)return 0;else b=1;k=3;while(k=sqrt(a)&b) if (a%k=0)b=0;k=k+2;return (b);int inv(int a)int i,j;i=a/10;j=a%10;return(j*10+i);main() int n;for(n=11;n=97;n+)if(prime(n)&prime(inv(n)printf(%dn,n);/*lx6-39*/#include main() int fac(int);int n,k,c;printf(please input (n,k):);scanf(%d,%d,&n,&k);c=fac(n)/(fac(k)*fac(n-k);printf(c(%d,%d)=%d,n,k,c);int fac(int m) int i,s=1;for(i=1;i=m;i+)s*=i;return(s);/*lx6-40*/#includeint func() int i=1,s=0,n=0;while(s1000)i*=2;s+=i;n+;return n-1;main()printf(最大的n=%d:n,func();/*lx6-41*/#include int prime(int n) int i,flag=1; for (i=2;i=n/2;i+) if (n%i=0) flag=0; return flag; return flag;void factor(int n) int i; i=2; while (i=n) if (n%i=0)&prime(i) printf(%d ,i); n=n/i; continue; i+; main() int num; printf(Enter num:); scanf(%d,&num); printf(prime factor is:n); factor(num);/*lx6-42*/#includefloat f1(int x,int n) int i; float j=1; for(i=1;i=n;i+) j=j*x; return j;float f2(int n) if(n=1)return 1;else return (f2(n-1)*n);main()float exp=1.0;int x,n;printf(Input a number:);scanf(%d,&x);printf(%d,x);exp=exp+x;for(n=2;n=19;n+) exp=exp+f1(x,n)/f2(n); printf(nThe exp(%d)=%8.4fn,x,exp);/*lx6-43*/#include void delchar(char str,char c) int i,j; for (i=0,j=0;stri!=0;i+) if (stri!=c)strj+=stri; strj=0;main() char str80; int i,j; gets(str); delchar(str,k); puts(str);/*lx6-44*/#includeint compare(int x ,int y ) if(x=y) return 1;else return 0;main() int a5,b5,i,eq=0,neq=0;printf(input array a:n);for(i=0;i5;i+)scanf(%d,&ai);printf(input array b:n);for(i=0;i5;i+)scanf(%d,&bi);for(i=0;i5;i+)if(compare(ai,bi)=1) eq=eq+1;else neq=neq+1;printf(ai=bi:%dnai!=bi:%dn,eq,neq);/*lx6-45*/#include #include int huiwen(char str) int i,j,len,flag=1; len=strlen(str); for (i=0,j=len-1;i128&strj128) /*两侧都是汉字字符*/ if (stri=strj-1&stri+1=strj) i+; j-; else flag=0; else flag=0; return flag;main() char str50; printf(Enter string:); gets(str); if (huiwen(str) printf(%s is a palindroman); else printf(%s is not palindroman);/*lx6-46*/#include void change(int a,int b,int n) int i,t; for (i=0;in;i+) t=ai; ai=bi; bi=t; main()int i,a10=1,2,3,4,5,6,7,8,9,0; int b10=11,12,13,14,15,16,17,18,19,20; printf(Change Before:); printf(nArray a:); for (i=0;i10;i+) printf(%4d ,ai); printf(n ); printf(nArray b:); for (i=0;i10;i+) printf(%4d ,bi); printf(n ); change(a,b,10); printf(Change After: ); printf(nArray a:); for (i=0;i10;i+) printf(%4d ,ai); printf(n ); printf(nArray b:); for (i=0;i10;i+) printf(%4d ,bi); printf(n );/*lx6-47*/#include#define n 100int b = 9,8,5,4,3,2,7,6,8,7,5,3,4,5,9,1;int ann;#define n sizeof b/sizeof b0void main() int k,i,j,m; a10=b0; k=1; for(i=1;i=1&ajj-1bi;j-); for(m=0;mj;m+) aj+1m=ajm; aj+1j=bi; if(j=k) k+; printf(k = %dn,k); for(j=0;jk;j+) printf(%4d,akj); printf(n);/*lx6-48*/#include #define N 10#define M 10int andian(int aM,int n,int m) int i,j,k,max,maxcol; int flag1,flag2=0; /*flag1标记每一行的最大值是否鞍点，flag2标记矩阵是否有鞍点*/ for (i=0;in;i+) max=ai0; for (j=1;jmax) max=aij;maxcol=j; for (k=0,flag1=1;kn&flag1;k+) if (akmaxcolmax) flag1=0; if (flag1=1) printf(n%3d %3d %5dn,i,maxcol,max); flag2=1; if (flag2=0) return -1;main() int i,j,n,m,aNM; printf(Enter row & col:); scanf(%d，%d,&n,&m); printf(Enter ar