c语言课后编程7-14.doc

7.15#include”stdio.h”int mymod(int a,int b)int c=a%b; return c;main()int a=19,b=17,c; c=mymod(a,b);printf(“%d”,c);7.16#include”stdio.h”double fun(int);main()int n; double y; scanf(“%d”,&n); y=fun(n); printf(“%fn”,y);double fun(int n)int i,s=1; double y=0; for (i=1;i=n;i+) y=y+s*1.0/n; s=s*-1; return y;7.17#include”stdio.h”main()int m;double t,fun(int);scanf(“%d”,&m);t=fun(m);printf(“%fn”,t)double fun(int n) int i; double y=1; for(i=2;i=n;i+) y=y-1.0/(i*i); return y;7.18#include”stdio.h”#include “math.h”double fun(double x)double y; y=pow(x,2)+2*x+4; return y;main()double x,y1,y2,y3; scanf(“%lf”,&x); y1=fun(5); y2=fun(x+15); y3=fun(sin(x); printf(“y1=%f y2=%f y3=%f”,y1,y2,y3);8.17#include”stdio.h”void fun(float x,float y,float *h,float *c)*h=x+y;*c=x-y;main()float a,b,*h,*c; scanf(“%f%f”,&a,&b); fun(a,b,h,c); printf(“h=%f c=%f”,*h,*c);8.18#include”stdio.h”void fun(double a,double b,double c,double *ma,double *mi)*ma=*mi=a; if (*mab) *mi=b; if (*mac) *mi=c;main()double a,b,c,*max,*min; scanf(“%lf%lf%lf”,&a,&b,&c); fun(a,b,c,max,min); printf(“max=%f min=%f”,*max,*min);9.27#include “stdio.h”#include “ctype.h”main() int num10=0,i; char ch;ch=getchar();while(ch!=n) if(isdigit(ch) /*此条件也可写成(ch=0 &ch=9) */ numch-0+; ch=getchar( ); for (i=0;i10;i+) printf(“%d”,numi); printf(“n”); 9.28#include”stdio.h”#define N 10void fun(int *s,int n)int i; for (i=n;iN-1;i+) si=si+1; main()int aN=1,2,3,4,5,6,7,8,9,10,n,i; scanf(“%d”,&n); fun(a,n); for (i=0;iN-1;i+) printf(“%d”,ai);9.29#include”stdio.h”#define N 50#include “stdlib.h “int fun(int *a,int *b)int i,n=0; for (i=0;iN;i+) if (ai%2) bn+=ai; return n;main()int aN,bN,n=0,i; for (i=0;iN;i+) ai=rand(); n=fun(a,b); for (i=0;in;i+) printf(“%6d”,bi); printf(“n”);9.30 (冒泡法排序)#include”stdio.h”#define N 10void fun(char a)int i,j; char c; for (i=0;iN-1;i+) for (j=0;jN-i-1;j+) if (ajaj+1) c=aj;aj=aj+1;aj+1=c;main()char aN=h,i,c,d,e,f,g,a,b,j; int i; fun(a); for (i=0;iai & ik;i-) ai=ai-1; ak=p; n+; return n;main()int a10=2,4,6,8,10,12,14,16,18,20,n=9,i,p;scanf(“%d”,&p);n=fun(a,n,p);for(i=0;in;i+)printf(“n”);9.32#include”stdio.h”void fun(int *a, int k) int b16=0,n=0,i; while(k!=0)bn+=k%2;k=k/2;for(i=0;in;i+) a16-i-1=bi;main() int a16=0,p,i; scanf(“%d”,&p); fun(a,p); for(i=0;i16;i+)printf(“%d”,ai);printf(“n”);9.33#include”stdio.h”#define N 15viod getrand(int *a)int n=0,i,j,f;while(nN)i=rand()%20 f=1;for(j=0;jn;j+) if(aj=i) f=0;beak; if(f) an+=i;main()int aN,i;getrand(a);for(i=0;iN;i+) printf(“%3d”,ai);printf(n”);9.34#include”stdio.h”main() int a55= 1 , 2 , 3 , 4 , 5 , 6 , 7 , 8 , 9 , 10, 11,12,13,14,15, 16,17,18,19,20, 21,22,23,24,25 ,h5=0,l5=0,i,j,d=0,f=0;for(i=0;i5;i+) for(j=0;j5;j+) hi+=aij; lj+=aij; if(i=j) d+=ajj; if(j=(5-i-1) f+=aij; for(i=0;i5;i+)printf(“h%d=%3d”,i,hi); printf(“n”); for(i=0;i5;i+)printf(“l%d=%3d”,i,li); printf(“n”); printf(“d=%3dn”,d); printf(“d=%3dn”,f); 9.35#include”stdio.h”main() int a33= 1, 2, 3, 4, 5, 6, 7, 8, 9 , b33= 10,11,12, 13,14,15, 16,17,18 ,c33,i,j; for(i=0;i3;i+) for(j=0;j3;j+) cij=aij+bij; printf(“%3d”,cij); printf(“n”); 9.36#include”stdio.h”main() int i,j; printf(“*A MULTIPLICATIONYABLE *n”); for(i=1;i=9;i+) printf(“ (%d)”,i); printf(“n”);for(i=0;i14;i+) printf(“-”); printf(“n “);for(i=1;i=9;i+) printf(“(%d)”,i);for(j=1;j=9;j+) printf(“%4d”,i*j);printf(“n”);for(i=0;i14;i+) printf(“- “);printf(“n”);9.37#include”stdio.h”#define M 5#define N 4#include “stdlib.h”main() int aMN,bN,i,j,t; for(i=0;iM;i+) bi=0; for(j=0;jN;j+) aij=rand()%100; printf(“%4d”,aij); bi+=aij; printf(“n”); for(i=0;iM;i+) printf(“%dn”,bi); j=0; for(i=1;iM;i+) if(bjbi) j=i; for(i=0;iN;i+) t=a0i;a0i=aji;aji=t; for(i=0;iM;i+) for(j=0;jN;j+) printf(“%4d”,aij); printf(“n”); 9.38#include”stdio.h”#define N 5#include stdlib.h”main() int aNN,i,j,t; for(i=0;iN;i+) for(j=0;jN;j+) aij=rand()%100; printf(“%4d”,aij); printf(“n”); printf(“n”); for(i=0;iN;i+) for(j=0;ji;j+) t=aij;aij=aji;aji=t; for(i=0;iN;i+) for(j=0;jN;j+) printf(“%4d”,aij); printf(“n”); 10.19#include “stdio.h”void mygets(char *p)char c; c=getchar(); while(c!=n) *p+=c; c=getchar(); *p=0;void myputs(char *p)while (*p) putchar(*p+);putchar(n); main()char *sp; mygets(sp); myputs(sp);10.20#include “string.h”#include “stdio.h” int fun(char *p)char p1,p2; int f=1; p1=p; p2=p+strlen(p)-1; while(*p1+!=*p2-) f=0;beak; return f;main()char *sp; int p=0; gets(sp); p=fun(sp); if(p) printf(“n YES!n”); else printf(“n NO!n”);10.21#include”stdio.h”#include “string.h” char dele(char *p,int n) char c; int i; if (nstrlen(p)-1) return c; else return ;main() char *sp,c; int i; gets(sp); scanf(“%d”,&i); c=dele(sp,i); printf(“%cn”,c); 11.11#include “ctype.h”#include “stdio.h”main(int ac,char *ag) int i; char s80; for (i=0;i=ag11-0) for (i=strlen(s)-(ag11-0);si;i+) putchar(si);putchar(n); else if (ag10=+ & isdigit(ag11) & strlen(s)=ag11-0) for (i=0;i=10) for (i=strlen(s)-10;si;i+) putchar(si); putchar(n); 11.12#include “stdio.h” void fun(int n) int i;i=n%2;if (n=0 | n=1 ) printf(“%1d”,n);return;else fun(n/2); printf(“%1d”,i); main()int i; scanf(“%d”,&i); fun(i); printf(“n”);11.13int fun(int n) int i=0; if (n=1) return 1; else i=n+fun(n-1); return i; main()int n; scanf(“%d”,&n); printf(“1+2+.+n=%dn”,fun(n);11.14int fun(int n) int i=0; if (n=1 |n=0) return 1; else i=i+fun(n-1)+fun(n-2); return i; main()int n; scanf(“%d”,&n); printf(“%d:%d”,n,fun(n);13.10#define MYALPHA(c) (c=a&c=A&c*(p+1) i=*(p+0);*(p+0)=*(p+1);*(p+1)=i; if (*(p+0)*(p+2) i=*(p+0);*(p+0)=*(p+2);*(p+2)=i; if (*(p+1)*(p+2) i=*(p+2);*(p+2)=*(p+1);*(p+1)=i; printf(“%d %d %dn”,*(p+0),*(p+1),*(p+2); free(p);14.12#include “stdio.h”#define N 30struct stud char num5,name10; int s4; double ave; ;void readrec(struct stud *a) double sum; int i,j; for (i=0;iN;i+) sum=0; scanf(“%s”,ai.num); scanf(“%s”,); for (j=0;j4;j+) scanf(“%d”,&ai.sj); sum+=ai