所有填空题题干及答案

1、100套上机操作题所有程序填空题题行及答案【1.1】int fun(_1_ *std)STYPE【1.2】_2_ *fp; int i;FILE【1.3】fwrite(&stdi, sizeof(STYPE), 1, _3_);fp【2.1】void WriteText(FILE _1_)*fw【2.2】fputs(_2_,fw); fputs("n",fw);str【2.3】printf("%s",_3_);str【3.1】fprintf(_1_,"%d %fn",i,sqrt(double)i);fp【3.2】_2_;fc

2、lose(fp)【3.3】if(fp=fopen(_3_,"r")=NULL)fname【4.1】if(fs=fopen(source, _1_)=NULL)"r"【4.2】while(!feof(_2_)fs【4.3】fputc(ch,_3_);ft【5.1】s->data=_1_;x【5.2】q=_2_;p【5.3】q->next=_3_;s【6.1】t=t->_1_;next【6.2】printf(" %d ",_2_);t->data【6.3】free(_3_);t【7.1】free(_1_);q【7.

3、2】q=p->_2_;next【7.3】q=q->_3_;next【8.1】while(p!=_1_)0 或 NULL【8.2】if (p->data=ch) return _2_;n【8.3】k=fun(_3_);head,ch【9.1】_1_=0;*n【9.2】p=p->_2_;next【9.3】fun(_3_, &num);head【10.1】s+= p->_1_;data【10.2】p=p->_2_;next【10.3】printf("nsum=%dn", fun(_3_);head【11.1】_1_ fun(STU *s

4、td, char *num)STU【11.2】if(strcmp(_2_,num)=0)stdi.num【11.3】return (_3_);stdi【12.1】if(_1_=year)stdi.year【12.2】kn+= _2_;stdi【12.3】return (_3_);n【13.1】void modify(_1_ *ss,float a)STU【13.2】ss->_2_ *=a;scorei【13.3】modify(_3_,a);&std【14.1】void fun(PERSON _1_)*std【14.2】_2_ temp;PERSON【14.3】fun(_3_);s

5、td【15.1】max= _1_;std0【15.2】if(max.age<_2_) max=stdi;stdi.age【15.3】printf("nName : %s, Age : %dn", _3_,max.age);【16.1】void show(STU _1_)tt【16.2】printf("%5.1f", _2_);tt.scorei【16.3】show(_3_);std【17.1】for(j=_1_; j<M; j+)i+1【17.2】if(nk>nj) _2_;k=j【17.3】strcpy(ssk,_3_

6、);t【18.1】n=len; _1_=i;k【18.2】for(j=_2_; j>=0; j-)len【18.3】_3_='*'ssij【19.1】n=strlen(_1_);ssi【19.2】ssi_2_='*'n+j【19.3】ssin+j+ _3_='0'1【20.1】int fun(char (*ss) _1_, int *n)N【20.2】if(i=0) *n=_2_;len【20.3】_3_;*n=len【21.1】for(i=0; i<_1_; i+)M【21.2】if(len _2_ *n)<【21.3】ret

7、urn(_3_);k【22.1】t2j=si; _1_;j+【22.2】for(i=0; i<k; i+) _2_;si=t1i【22.3】for(i=0; i<_3_; i+) sk+i=t2i;j【23.1】if(si>='0' _1_ si<='9')&&【23.2】while(si+1+n!= _2_) n+;'0' 或 0【23.3】sj+1= _3_;sj【24.1】for(i=0; _1_ !=0; i+)si【24.2】if(si>='0'&&si<

8、;= _2_) n+;'9'【24.3】_3_ ;*t=n【25.1】if(n%2=0) k=n-_1_ ;1【25.2】c=_2_ ;sk【25.3】s1=_3_ ;c【26.1】_1_;t=i【26.2】for(j=_2_+2 ; j<n; j=j+2)i【26.3】pj=_3_;'0' 或 0【27.1】for(i=0; si!=_1_ ; i+)'0' 或 0【27.2】n=_2_ ;0【27.3】sj+1=_3_ ;c【28.1】for(i=0; i<N; _1_)i+【28.2】tij+_2_=tij;m【28.3】for

9、(j=0; j<_3_; j+)m【29.1】for(i=0; i<_1_; i+)N【29.2】x=ti_2_ ;N-1【29.3】ti_3_=x;0【30.1】t0N-j-1=tj_1_;0【30.2】for(j=N-1; j>=0;_2_)j-【30.3】tjN-1=r_3_;j【31.1】void fun(int (*t)_1_)N【31.2】_2_ =tij+tji;tij【31.3】_3_ =0;tji【32.1】void fun(int _1_ , int n)(*t)N 【32.2】for(_2_; i+)i=0;i<N【32.3】tin-1-i=_3_

10、;s【33.1】_1_;sun=0【33.2】sum+=_2_ ;tii【33.3】sum+= tin-i-_3_ ;1【34.1】if (ai%2=_1_)1【34.2】aj = ai; _2_;j+【34.3】return _3_;j【35.1】if (_1_= 0) ai%2【35.2】_2_ = ai; j+;aj【35.3】return _3_;j【36.1】max = min = _1_;ai【36.2】if (max<_2_)aj【36.3】if (min>_3_)aj【37.1】void fun(int _1_, int n)*a【37.2】for (i=0; i&

11、lt;n-1; i+=_2_)2【37.3】for (j=_3_; j<n; j+)i+1【38.1】p = (n%2=0)?n/2:n/2+_1_;1【38.2】ai = ap+_2_;i【38.3】_3_ = t;ap+i【39.1】for (i=0; i<_1_; i+)n/2【39.2】ai = an-1-_2_;i【39.3】_3_ = t;an-1-i【40.1】_1_ fun(char ch)char【40.2】if (ch>='0' && _2_)ch<='9'【40.3】return '9'

12、;- (ch-_3_);'0'【41.1】if (ch>='a')_1_(ch<='z')&&【41.2】return ch +'a'-_2_ ;'A'【41.3】return _3_;ch【42.1】f = _1_;1.0 或 1【42.2】t *= (_2_)*x/i;-1.0 或 -1【42.3】f += _3_;t【43.1】t = _1_;x【43.2】t *= (-1.0)*x/_2_;n【43.3】while (_3_ >= 1e-6);fabs(t)【44.1】t

13、= _1_;1.0 或 1【44.2】for (i=_2_; i<n; i+)1【44.3】t *= x/_3_;i【45.1】f = 1.0+_1_;x【45.2】t *= x/_2_;n【45.3】f += _3_;t【46.1】for (_1_; j<i; j+)j=2【46.2】if (_2_%j = 0)i【46.3】if (_3_>=i)j【47.1】switch(_1_)n%10【47.2】case 1: c1+;_2_;break【47.3】case 2: c2+;_3_;break【48.1】for (j=ai*2; j<=n; j+=_1_)ai【4

14、8.2】while (_2_=0)ai【48.3】if (ai!=_3_)0【49.1】#define OK(i, t, n) (_1_%t=0) && (i/t<n)i【49.2】for(t=1; t< maxt*(n-1); _2_)t+【49.3】return _3_;count【50.1】t = (a>b) ? (b>c? b :(a>c?c:_1_) : (a>c)?_2_ : (b>c)?c:_3_);a【51.1】n=_1_;0【51.2】while(t<=_2_)x【51.3】_3_;t+ 或 t=t+1【52.1

15、】while(t<=_1_)999【52.2】s1=t%10; s2=(_2_)%10; s3=t/100;t/10【52.3】if(s1+s2+s3=_3_)x【53.1】i=_1_;1【53.2】while(_2_)s【53.3】x=x+t*i; i=_3_;i*10【54.1】if(t%2=_1_)0【54.2】x=_2_+t;10*x【54.3】n=_3_;n/10【55.1】t=*n % _1_;10【55.2】if(t%2!= _2_)0【55.3】*n=_3_;x【56.1】s=_1_;0.0【56.2】for(i=1; i<=_2_; i+)n【56.3】s=s+(

16、2.0*i-1)*(2.0*i+1)/_3_;(t*t)【57.1】k=_1_;1【57.2】t=_2_;2.0*i【57.3】k=k*_3_;(-1)【58.1】x=_1_/4;3.0 或 3.【58.2】while(x _2_ e)>【58.3】x=_3_/(t*t);(2*i+1)【59.1】s=0; i=_1_;0【59.2】_2_;i+【59.3】x=(2.0*i-1)/(_3_)*(2.0*i);2.0*i【60.1】tj=_1_; j+;si【60.2】for(i=0; i<_2_; i+) tj+i=pi;k【60.3】tj+k= _3_;'0' 或

17、 0【61.1】p_1_=si; j+;j【61.2】for(i=0; i<_2_; i+) pj+i= ti;k【61.3】return _3_;p【62.1】av=_1_;0.0 或 0【62.2】for(i=0; i<N; i+) av = av + _2_;xi/N 【62.3】if(xi>av) y_3_= xi;j+【63.1】_1_=s/N;*av【63.2】d=*av-xi; j=_2_;i 或 xi【63.3】return _3_;xj 或 j【64.1】av=_1_;s/N【64.2】y_2_=xi; xi=-1;j+【64.3】if(xi!= _3_)

18、yj+=xi;-1【65.1】for(i=0; i<N; i+) av +=_1_;xi/N 【65.2】yj=xi; xi=-1; _2_;j+ 或 j=j+1【65.3】_3_;i+ 或 i=i+1【66.1】d=d*10+*s-_1_;'0'【66.2】_2_;s+【66.3】return _3_;ctod(a)+ctod(b)【67.1】while (n<_1_)N【67.2】if(x=ai) _2_;break【67.3】if(i=_3_)an=x; n+;n【68.1】bi= _1_;a0i【68.2】if(bi _2_ aji) bi=aji;<

19、【68.3】fun(_3_);x,y【69.1】void fun(int (*a) _1_)N【69.2】for(j= _2_ ; j<N-i; j+)i【69.3】aki=akN-i-1= _3_;i+1【70.1】row=colum= _1_;0【70.2】if(row!=colum) _2_ (row!=m1) return 0;|【70.3】return _3_;1【71.1】void fun(int (*a)N, int _1_)k【71.2】for(i = 0 ; i < _2_ ; i+)N【71.3】a0i = _3_ ;aki【72.1】for(p=1; p<

20、;= _1_; p+)k【72.2】for(j=0; j< _2_ ; j+) aij=aij+1;N-1【72.3】aiN-1= _3_;temp【73.1】rmax=aij; c= _1_ ;j【73.2】if (k!=i && akc<=rmax) find= _2_ ;0【73.3】_3_ ;i+【74.1】if(n>=len) strcpy(_1_);t,s【74.2】for(i=len-n; i<=len-1; i+) tj+= _2_ ;si【74.3】tj= _3_ ;'0' 或 0【75.1】lp= _1_ ;s【75.

21、2】lp+; rp _2_ ;-【75.3】if(lp<rp) _3_ ;return 0【76.1】_1_ ; flag=1;n+【76.2】if (*s=' ') flag= _2_ ;0【76.3】_3_ ;s+【77.1】*(t+n)= _1_ ; n+;*s【77.2】_2_ ;s+【77.3】return _3_ ;n【78.1】if(isdigit(*s) sum+= *s- _1_ ;'0' 或 48【78.2】_2_;s+【78.3】return _3_ ;sum【79.1】ch=tolower(_1_);*s【79.2】kn+= _2_

22、 ;1【79.3】if(max<kn) max= _3_ ;kn【80.1】k= _1_ ;i【80.2】if(strlen(psk) < strlen(_2_) k=j;psj【80.3】tp=psi; psi=psk; psk= _3_ ;tp【81.1】for(i=0; i< _1_ ; i+)N【81.2】if(strcmp(ssi,t)=0) return _2_ ;i【81.3】if(n= _3_) printf("nDon't found!n");-1【82.1】for(i=0; i< _1_ ; i+)N【82.2】if(le

23、n<= _2_)k【82.3】strcpy(ssj+,_3_);ssi【83.1】for(i=0; i< _1_ ; i+)N【83.2】if(strstr(ssi, _2_) != NULL)substr【83.3】if (find=_3_) printf("nDon't found!n");0【84.1】void fun(char (*ss) _1_, int k)M【84.2】while(i< _2_) N【84.3】ssik=_3_; i+;'0' 或 0【85.1】b = _1_;a【85.2】strcpy(_2_, &q

24、uot;LiSi");【85.3】for (i=0; i<3; i+) printf("%6.2f ", b._3_);scorei【86.1】b_1_ = 10004;->sno【86.2】strcpy(b_2_, "LiJie");->name【86.3】fun(_3_);&t【87.1】_1_ fun(struct student a)struct student【87.2】strcpy(_2_, "LiSi");【87.3】for (i=0; i<3; i+)

25、_3_+= 1;a.scorei【88.1】_1_ fun(struct student *a)struct student*【88.2】for (i=0; i<3; i+) _2_ += 1;a->scorei【88.3】return _3_ ;a【89.1】_1_ t;struct student【89.2】for (i=0; i<_2_; i+)n-1 【89.3】if (strcmp(_3_) > 0),【90.1】while (!feof(_1_)fp【90.2】if (n.sno_2_sno) break;=【90.3】fseek(_3_, -(long)sizeof(STU), SEEK_CUR);fp【91.1】_1_ (*f)();double【91.2】f = _2_ ; /* point fountion f1 */f1【91.3】f = _3_ ; /* point fountion f2 */