考试上机题库1.doc

说明：主要找你的填空题第一道题的题干，然后后面的答案都是相对应一套一套的，如：加入你的填空题第一道题的题干和这里的第1套是一样的（有些提干是一模一样的，如第1和25，33、36和39，27和49，请继续看第二个found），那你所有题的答案都是相对应的第1套。其他类推。一、填空题1/*found*/ t = _1_;（同25一样）/*found*/ t*= (-1.0)*x/_2_;（1）x （2）n (3)fabs(t)2/*found*/ switch(_1_)(1)n%10 (2)break (3)break3/*found*/if(t%2=_1_)(1)0 (2)10*x (3)n/104/*found*/ rmax=aij; c= _1_ ; (1) j (2)0 (3)i+5/*found*/void fun(char (*ss) _1_, int k)(1) M (2)N (3)06/*found*/void fun(int (*t)_1_ )(1)N (2)tij (3)tji7/*found*/void fun(int (*a)N, int _1_)(1) k (2)N (3)aki8/*found*/while(t=_1_)(1) 999 (2)t/10 (3)x9/*found*/ _1_;(1) sum=0 (2)tii (3)110/*found*/_1_ fun(char ch)(1) char (2)ch=9 (3)011/*found*/s=0; i=_1_;(1) 0 (2)i+ (3)2.*i12/*found*/while (!feof(_1_)(1) (fp) (2)= (3)fp13/*found*/for(i=0; i _1_ ; i+)(1) N (2)substr (3)014/*found*/for(p=1; pb)?(bc?b :(ac?c:_1_):(ac)?_2_:(bc)?c:_3_);(1) a (2)a (3)b16/*found*/ if (ch=a)_1_(ch=len) strcpy(_1_);(1) t,s (2)si (3)020/*found*/_1_ fun(struct student *a)(1) struct student * (2)a-scorei (3)a21/*found*/ max = min = _1_;(1) ai (2)aj (3)aj22/*found*/void fun(int _1_ , int n)(1) tN (2)i=0;in (3)s23/*found*/void fun(int _1_, int n)(1) *a (2)2 (3)i+124/*found*/ f = 1.0+_1_;(1) x (2)n (3)t25/*found*/ t = _1_;（同第1题一样）/*found*/ for (i=_2_; isno (2)-name (3)&t27/*found*/k=_1_;(同第49题一样)/*found*/ t=_2_;(1) 1 (2)2*i (3) (-1)28/*found*/s=_1_;(1) 0 (2)n (3)(t*t)29/*found*/ ch=tolower(_1_);(1) *s (2)1 (3)kn30/*found*/ _1_ t;(1) struct student (2)n-1(3),31/*found*/ if (_1_= 0) (1) ai%2 (2)aj (3) j32/*found*/ t=*n % _1_;(1) 10 (2)0 (3)x33/*found*/for(i=0; i _1_ ; i+)（同第36和第39一样）/*found*/ if(len= _2_) (1) N (2)k (3)ssi34/*found*/ _1_ ; flag=1;(1) n+ (2)0 (3)s+35/*found*/ tj=_1_; j+;(1) si (2) k (3)036/*found*/ for(i=0; i (3)(2*i+1)39/*found*/ for (i=0; i_1_; i+)/*found*/ai = an-1-_2_;（同第33和第36一样）(1) n/2 (2)i (3)an-i-140/*found*/ b = _1_;(1) a (2) (3)scorei41/*found*/ for (_1_; ji; j+)(1) j=2 (2)i (3)j42/*found*/ i=_1_;(1) 1 (2)s (3)i*1043/*found*/_1_ fun(struct student a)(1) struct student (2)(3)a.scorei44/*found*/ p=(n%2=0)?n/2:n/2+_1_;(1) 1 (2)i (3)ap+i45/*found*/ if (ai%2=_1_)(1) 1 (2)j+ (3)j46/*found*/n=_1_;(1) 0 (2)x (3)t+47/*found*/ *(t+n)= _1_ ; n+; (1) *s (2)s+ (3)n48/*found*/#define OK(i, t, n) (_1_%t=0) & (i/tn)(1) i (2)t+ (3)count49/*found*/k= _1_ ;(同第27题一样)/*found*/if(strlen(psk) strlen(_2_) ) k=j;(1) i (2)psj (3) tp50/*found*/ for (j=ai*2; j=n; j+=_1_)(1)ai (2)ai (3)0二、改错题1(1)for(i=1;i=y;i+) (2)t=t%1000;2(1)if(t=0) (2) *zero=count;3(1)*t=0; (2) if(d%2!=0)4(1)for(i=2;i tj + 1 )8(1)void fun(long s,long *t) (2)while(s0)9(1)double r; (2) while(fabs(m-n)0.001)（注：n,m,）10(1)bk=*p; (2) bk= ;k+;（注：单引号）11(1)void fun (char *s, char *t) (2)t2*d = 0;12(1)n=strlen( aa ) ; (2)ch=aai;13(1)fun(int x,int y, int z)(2)return j;14(1) void fun(int aM, int m)(2)ajk=(k+1)*(j+1);15(1) c=tolower(c)(注：c小写); (2)c=c+5;16(1) void fun(int *a)(2)aj=aj-1;17(1) if (k%13 = 0) | (k%17 =0) (注：双等号) (2)（注：横线去掉）18(1)for(i=1;i=0&k=i)20(1)char *fun(char (*sq)M )(2)return sp;21(1)switch(g)(2)case 1: return 1; case 2:return 1;22(1)fun(int a,int m)(2)else if(mamid)23(1) sum=0;(2)if(i+1)%5=0)24(1)d=1;s=0;(2)d=d/10;25(1) k=i;(2)c=k;26(1) double fun(double a,double x0)(2)if(fabs(x1-x0)0.00001)27(1)k+; (2)if(m=k)28(1) for(i=0;stri;i+)(2)if(substrk+1=0)29(1) float fun(int k)(2)return s;30(1) q=p+i; (2)while(qp)31(1) fun (int n) (2)if(n=1)32(1) if (n=0)(2)result *= n- ;33(1) int k=0;(2)while( *p | *q )34(1) t+=sk; (2)*aver=ave;35(1) while(*w)(2)if(*r=*p)36(1) a2=k/10;(2)return i;37(1) double fun (int n)(2)c=a;a+=b;b=c;38(1)double fun(int n)(2)s=s+(double)a/b;39(1) n= *p-0;(2)n=n*8+*p-0;40(1) sj+=si;(2)sj=0;41(1)sum=0;j=0;(2)if(sum%4=2)42(1) int fun(int n,int xxM)(2)printf(%d,xxij);43(1) if(p=n) return -1;(2)ai=ai+1;44(1)float k; (2)if(*c*a)45(1) t=a;a=b;b=t;(2)return(b);46(1) int i,sl;(2)ti=ssl-i-1;47(1) int j, c=0; double xa=0.;(2)if (xj=xa)48(1) int fun(int a,int b,int c)(2)else return 1;49(1) double fun(int n)(2)return sum;50(1) y=1;(2) d=a-i;三、编程题1、double fun(double x) int i=0; double s=1,a=1; while(fabs(a)0.000001) a=a*(0.5-i)*x/(i+1); s+=a; i+; return s;2、double fun(int n) int i; double s=0,a=1; for(i=1;i=n;i+) a=a/i; s+=a; return s;3、void fun(char p1, char p2) while(*p1) p1+; while(*p2) *p1=*p2; p1+; p2+; *p1=0;4、int fun(int score, int m, int below) int i=0,s=0,n=0; for(i=0;im;i+) s+=scorei; s/=m; for(i=0;im;i+) if(scorein) i=n;j=k; /* 以下完成将下标为k至串尾的字符前移k-n个位置 */ while(aj) ai=aj; i+; j+; ai=0; 6、void fun( char *a ) int i=0,j=0; while(ai=*) i+; while(ai) aj=ai; i+; j+; aj=0;7、void fun( char *ss ) int i=1; while(ssi-1&ssi) if(ssi=a&ssi=z) ssi+=A-a; i+=2; 8、void fun( STREC a ) STREC tmp; int i,j; for(i = 0; i N; i+) for(j = i+1; j N; j+) /* 请按题目要求完成以下代码 */ if(ai.snext) h=h-next; s+=h-s; i+; s/=i; return s;11、void fun(char *s, char t) int i=0,j=0; while(si) if(i%2=1&si%2=1) tj=si; j+; i+; tj=0;12、double fun( STREC *h ) double s=0; while(h-next) h=h-next; if(ss) s=h-s; return s;13、void fun( char *a, int n,int h,int e ) int i; for(i=0;in-h-e;i+) ai=ai+h; ai=0;14、void fun(int a, int b, long *c) *c=a/10*10+a%10*1000+b/10+b%10*100; 15、double fun(int n) int i; double s=0,a=0; for(i=1;i=n;i+) a+=sqrt(i); s+=a; return s;16、int fun(int n) int i,s=0; for(i=2;in;i+) if(n%i=0) s+=i; return s;17、double fun( int n) int i,s=0; for(i=21;in;i+) if(i%3=0&i%7=0) s+=i; return sqrt(s);18、double fun(int n) int i; double s=1,a=1; for(i=1;i=n;i+) a=a/i; s+=a; return s;19、void fun ( int x, int pp, int *n ) int i; for(i=1,*n=0;i=x;i+=2) if(x%i=0) pp*n=i; (*n)+; 20、void fun(int a, int b, long *c)*c=a/10*100+a%10+b/10*10+b%10*1000; 21、void fun(STREC *a) int i; double s=0; for(i=0;isi; a-ave=s/N;22、void fun( char *a, char *p ) char *b=a; while(bp) if(*b!=*) *a=*b; a+; b+; while(*p) *a=*p; a+; p+; *a=0;23、double fun( STREC *a, STREC *b, int *n ) int i; double s=0; for(i=0;iN;i+) s+=ai.s; s/=N; for(i=0,*n=0;iN;i+) if(ai.ss) b*n=ai; (*n)+; return s;24、double fun(double x9) int i; double s=0; for(i=0;i8;i+) s+=sqrt(xi+xi+1)/2); return s;25、double fun(double x10) int i; double s=0,x1=0; for(i=0;i10;i+) x1+=xi; x1/=10; for(i=0;i10;i+) s+=(xi-x1)*(xi-x1); s=sqrt(s/10); return s;26、double fun( STREC *a, STREC *b, int *n ) int i; double s=0; for(i=0;iN;i+) s+=ai.s; s/=N; for(i=0,*n=0;i=s) b*n=ai; (*n)+; return s; 27、void fun(int a, int n , int *max, int *d ) int i;for(i=1,*max=a0,*d=0;in;i+) if(*maxeps) a=a*i/(2*i+1); s+=a; i+; return s*2;29、double fun( int n ) int i; double s=0; for(i=1;i=n;i+) s+=1.0/(i*(i+1); return s;30、int fun( STREC *a,STREC *b,int l, int h ) int i,j; for(i=0,j=0;i=l&ai.sn) ai-j+n=0; 32、long fun ( char *p) /* 以下代码仅供参考 */ int i,len; /* len为串长 */ long x=0; len=strlen(p);/* 以下完成数字字符串转换为一个数字。注意：字符0不是数字0 */ for(i=0;ilen;i+) x=x*10+pi-0; return x;33、void fun( char *a ) /* 以下代码仅供参考 */ int i=0,k; while(ai=*) i+; k=i; while(ai!=0) /* 以下程序段实现非*字符前移 */ if(ai!=*) ak=ai; k+; i+; ak=0;34、void fun(int *s, int t, int *k) int i; *k=0; for(i=0;is*k) *k=i;35、void fun(char *s, char t) int i=0,j=0; while(si) if(si%2=0) tj=si; j+; i+; tj=0;36、void fun( char *a ) int i=0,j=0; while(ai) if(ai!=*) j=0; else j+; i+; ai-j=0;37、void fun(int m, int k, int xx) /* 以下代码仅供参考 */ int j=0, t=m+1; while(jk) /* 按题目要求完成以下代码 */ if(prime(t) xxj=t; j+; t+; 38、int fun (int aM) int i,s=a00; for(i=0;is) s=a0i; if(a1is) s=a1i; return s;39、STREC fun( STREC *a, char *b ) int i; STREC t = 0, -1; for(i=0;i0;n-) /* 在串尾补n个* */ *q+=*; *q=0; 41、double fun(int n) int i; double sum=0.0; for( i=1; i = n; i+) sum=sum+1.0/(2*i-1)-1.0/(2*i); return sum;42、void fun(int a, int b, long *c