c语言题库Word下载.docx

上传人:b****3 文档编号:17894112 上传时间:2022-12-11 格式:DOCX 页数:9 大小:29.53KB
下载 相关 举报
c语言题库Word下载.docx_第1页
第1页 / 共9页
c语言题库Word下载.docx_第2页
第2页 / 共9页
c语言题库Word下载.docx_第3页
第3页 / 共9页
c语言题库Word下载.docx_第4页
第4页 / 共9页
c语言题库Word下载.docx_第5页
第5页 / 共9页
点击查看更多>>
下载资源
资源描述

c语言题库Word下载.docx

《c语言题库Word下载.docx》由会员分享,可在线阅读,更多相关《c语言题库Word下载.docx(9页珍藏版)》请在冰豆网上搜索。

c语言题库Word下载.docx

i++)av+=__1__;

77:

for(i=0;

s[i]!

=___1___;

i++)16:

=d*10+*s-__1__;

78:

___1___)17:

while(n<

__1__)79:

i++)18:

b[i]=__1__;

80:

t[0][N-j-1]=t[j][___1___];

19:

voidfun(int(*a)__1__)81:

voidfun(int(*t)___1___)20:

row=colum=__1__;

82:

voidfun(int___1___,intn)21:

voidfun(int(*a)[N],int__1__)83:

22:

for(p=1;

p<

=__1__;

p++)84:

if(a[i]%2==___1___)23:

rmax=a[i][j];

c=__1__;

}85:

if(___1___==0){24:

if(n>

=len)strcpy(__1__);

86:

max=min=___1___;

25:

lp=__1__;

87:

voidfun(int___1___,intn)26:

__1__;

flag=1;

}88:

p=(n%2==0)?

n/2:

n/2+___1___;

27:

*(t+n)=__1__;

n++;

}89:

for(i=0;

i++)28:

if(isdigit(*s))sum+=*s-__1__;

90:

___1___fun(charch)29:

ch=tolower(__1__);

91:

if((ch>

a'

)___1___(ch<

z'

))30:

k=__1__;

92:

f=___1___;

31:

i++)93:

t=___1___;

32:

i++)94:

33:

i++)95:

f=1.0+___1___;

34:

voidfun(char(*ss)__1__,intk)96:

for(___1___;

i;

j++)35.b=__1__;

97:

switch(___1___)36:

b__1__=10004;

98:

for(j=a[i]*2;

=n;

j+=___1___)37.__1__fun(structstudenta)99:

#defineOK(i,t,n)38.__1__fun(structstudent*a)((___1___%t==0)&

&

(i/t<

n))39.__1__t;

100:

t=(a>

b)?

(b>

c?

40.while(!

feof(__1__))b:

(a>

c:

___1___))41.__1__(*f)();

101:

if(___1___==0)42.p=__1__;

102:

pa->

next=___1___;

43.__1__*fun(NODE*h)103:

a[i]=___1___;

44.p=h->

__1__;

104:

__1__=0;

45.q=__1__;

105:

t=b[i];

b[k]=t;

46.__1__fun(inti,doublex,double106:

int___1___;

y)107:

return___1___;

47.__1__fp;

108:

}___1___;

48.__1__fp;

109:

i=___1___;

使用说明:

打开填空题的程序后,以看到的所49.fp=fopen(filename,__1__);

110:

int__

(1)__[55];

要填写的三个空作为查找参照;

操作题分为填空50.fp=fopen(__1__,"

rb+"

);

题、改错题、编程题,如果你考试的填空题三个51.intfun(___1___*std)空的内容和这题库中给出的某一道填空题的题52.voidWriteText(FILE___1___)目三个空的内容一样,那么你的改错题、编程题53.fprintf(___1___,"

%d%f\n"

i,sqrt((doubl的答案也都在下面(同一套题)。

注:

1、请在纯e)i));

英文输入法状态下答题。

2、当出现“==”是指54.if((fs=fopen(source,___1___))==NULL)连续输入两个等于号=,当出现——是连续输入55.s->

data=___1___;

||连个减号。

3、逻辑或、单引号及双引号的输56.t=t->

入方法。

4、区分数字1和字母l(L的小写)、57.free(___1___);

数字0和字母O。

4、所有的字母和符号(特别58.while(p!

=___1___)是改错题)以这份题库为准。

5、打印时可考虑

填空:

(1)1

(2)2*i(3)(-1)14:

缩印几份以备用(在打印或编辑时请勿改动题改错:

(1)k++;

(2)if(m==k)y[__2__]=x[i];

x[i]=-1;

}库内容)。

编程:

inti;

if(x[i]!

=__3__)y[j++]=x[i];

1:

*max=a[0];

填空:

(1)s/N

(2)j++(3)-1while(t<

=__2__)*d=0;

改错:

(1)#include<

stdio.h>

__3__;

i<

n;

i++)

(2)voidupfst(char*p)填空:

(1)0

(2)x(3)t++if(*max<

a[i])inti,j,n=0;

改错:

(1)inti,sl;

(注意:

是小写字母l)编程:

{*max=a[i];

*d=i;

}

(2)t[i]=s[sl-i-1];

doublesum=0;

while(x__2__e)*c=a%10+(b%10)*10+(a/10)*100+(b/10)*1000;

x=__3__/(t*t);

for(i=0;

i++){(请一行写完)填空:

(1)3.0或(double)3

(2)>

(3)(t+1)2:

=__1__){sum+=w[0][i]+w[N-1][i];

n+=2;

(1)doublefun(intn)

(2)s=s+(double)a/b;

s1=t%10;

s2=(__2__)%10;

s3=t/100;

inti,j,max=a[0][0];

if(s1+s2+s3==__3__)}for(i=0;

2;

i++)填空:

(1)999

(2)t/10(3)xfor(j=0;

j<

j++)改错:

(1)voidfun(longs,long*t)

(2)while(s>

0)for(i=1;

N-1;

i++){if(max<

a[i][j])编程:

if(a[i].s>

a[j].s)max=a[i][j];

{tmp=a[j];

a[j]=a[i];

a[i]=tmp;

}sum+=w[i][0]+w[i][N-1];

returnmax;

3:

9:

while(__2__)n+=2;

__2__;

x=x+t*i;

i=__3__;

x=(2.0*i-1)/((__3__)*(2.0*i));

}填空:

(1)1

(2)s>

0(3)i*10填空:

(1)0

(2)i++或++i或i+=1或i=i+1(3)2.0*i改错:

(1)intfun(intn,intxx[][M])改错:

(1)voidfun(char*s,char*t)returnsum/n;

(2)printf("

%d"

xx[i][j]);

(2)t[2*d]='

\0'

;

或t[d+i]='

或t[2*d]=0;

或编程:

t[d+i]=0;

*c=b/10+(a%10)*10+(b%10)*100+(a/10)*1000;

inti,j=0,n;

(请一行写完)y[j]=x[i];

__2__;

}n=strlen(s);

if(t%2==__1__)__3__;

for(i=0;

i++)x=__2__+t;

1)x[i]/N

(2)j++或++j(3)i++或++iif(i%2!

=0&

s[i]%2!

=0)n=__3__;

(1)num[k]=0;

(2)switch(*s){t[j]=s[i];

(1)0

(2)10*x(3)n/10编程:

inti,j,sum=0;

(1)*t=0;

(2)if(d%2!

=0)或if(d%2==1)for(i=0;

i++)}编程:

inti,j;

for(j=0;

j++)t[j]='

p1[i]!

i++);

if(i==0||i==M-1||j==0||j==N-1)10:

}for(j=0;

p2[j]!

j++)sum=sum+a[i][j];

__2__;

i++)t[j+i]=p[i];

p1[i++]=p2[j];

returnsum;

t[j+k]=__3__;

p1[i]='

16:

(1)s[i]

(2)k(3)'

或05:

}改错:

(1)while(*w)

(2)if(*r==*p)if(t%2!

=__2__)return__3__;

*n=__3__;

(1)'

(2)s++或++s(3)ctod(a)+ctod(b)n=strlen(s);

(1)10

(2)0(3)x改错:

(1)voidfun(char*s,int*a,int*b)for(i=0;

i++)改错:

(1)if(n==0)

(2)*a=*a+1;

(3)*b=*b+1;

if(s[i]%2==0)

(2)result*=n--;

或{result*=n;

n--;

}编程:

longt;

{t[j]=s[i];

i=0;

t=(h*1000+5)/10;

if(*p=='

-'

)return(float)t/100;

}{p++;

17:

__1__)t[j]='

i++;

if(x==a[i])__2__;

}flag=-1;

if(i==__3__){a[n]=x;

}for(i=0;

i++)p[j+i]=t[i];

}填空:

(1)N或20

(2)break(3)nreturn__3__;

elseif(*p=='

+'

)改错:

(1)sum=0;

(2)scanf("

&

a[i][j]);

(1)j

(2)k(3)p或(p){p++;

inti,j,t;

1)while(i<

j)

(2)if(*a)i++;

3;

i++)/*将右上三角和左编程:

inti,j=0;

}下三角对换,实现行列互换*/for(i=0;

i<

strlen(s);

i++)for(;

len;

i++)for(j=i+1;

j++)if(!

((i%2)==0&

(s[i]%2)))t[j++]=s[i];

{x=x*10+*p-'

{t=array[i][j];

t[j]=0;

p++;

array[i][j]=array[j][i];

12:

}array[j][i]=t;

i++)av=av+__2__;

x=x*flag;

}if(x[i]>

av)y[__3__]=x[i];

6:

18:

(1)0.0

(2)x[i]/N(3)j++for(i=1;

=__2__;

i++)if(b[i]__2__a[j][i])b[i]=a[j][i];

(1)doublefun(intm)s=s+(2.0*i-1)*(2.0*i+1)/__3__;

fun(__3__);

(2)for(i=100;

=m;

i+=100)填空

(1)0

(2)n(3)(t*t)填空:

(1)a[0][i]

(2)<

(3)x,y编程:

inti;

改错

(1)for(i=0;

str[i];

i++)

(2)if(substr[k+1]=='

(1)voidfun(int*x,int*y)*s=a[0];

doubles=1.0,s1=1.0;

(2)t=*x;

*x=*y;

*y=t;

i++)intn=1;

inti,j,k=0;

if(s->

s>

a[i].s)while(s1>

=eps)/*当某项大于精度要求for(i=2;

=lim;

i++)/*求出小于或等于*s=a[i];

时,继续求下一项*/lim的全部素数*/13:

{s1=s1*n/(2*n+1);

/*求多项式的每{for(j=2;

j++)d=*av-x[i];

j=__2__;

}一项*/if(i%j==0)break;

return__3__;

s=s+s1;

/*求和*/if(j>

=i)填空:

(1)*av

(2)i(3)x[j]n++;

aa[k++]=i;

/*将求出的素数放改错:

(1)floatfun(intn)

(2)for(i=2;

i++)}入数组aa中*/编程:

return2*s;

}for(j=0;

j++)7:

returnk;

/*返回所求出的素for(i=0;

=j;

i++)t=__2__;

数的个数*/a[i][j]=a[i][j]*m;

/*右上半三角元k=k*__3__;

voidfun(int(*a)__1__)素中的值乘以m*/

for(i=m+1,n=0;

n<

k;

i++)for(j=__2__;

N-i;

j++)strcpy(ss[j++],__3__);

{for(j=2;

j++)a[k][i]=a[k][N-i-1]=__3__;

(1)N

(2)k(3)ss[i]if(i%j==0)break;

(1)[N]

(2)i(3)i+1改错:

(1)intk=0;

(2)while(*p||*q)if(j>

=i)改错:

(1)aa[i]=m%k;

(2)printf("

aa[i-1]);

if(a[i]!

*'

)xx[n++]=i;

inti=0;

{26:

}*max=a[0];

a[k++]=a[i];

if(*s=='

'

)flag=__2__;

num;

i++)}__3__;

if(strlen(*max)<

strlen(a[i]))i++;

(1)n++

(2)0(3)s++*max=a[i];

33:

i++)改错:

(1)t+=s[k];

(2)*aver=ave20:

if(strstr(ss[i],__2__)!

=NULL)编程:

if((row!

=colum)__2__(row!

=m1))return0;

if(find==__3__)printf("

\nDon'

tfound!

\n"

*k=0;

(1)N

(2)substr(3)0for(i=0;

t;

(1)0

(2)||(3)1改错:

(1)fun(intx,inty,intz)或if(s[*k]<

s[i])*k=i;

(1)t-=1.0/i;

(2)returnt;

intfun(intx,inty,intz)

(2)returnj;

returns[*k];

inti,j=0;

char*p=str;

27:

}for(i=h;

n-e;

i++)__2__;

a[j++]=a[i];

inti=0;

return__3__;

a[j]='

(1)*s

(2)s++(3)n34:

voidfun(char(*ss)__1__,intk)while(*p){改错:

(1)intj,c=0;

floatxa=0.0;

(2)if(x[j]>

=xa)while(i<

__2__){if(*p!

='

)str[i++]=*p;

/*此行单引号内编程:

floatp,q=1.0;

ss[i][k]=__3__;

}inti;

(1)[M]

(2)N(3)0是一个空格*/for(i=1;

(1)t=1;

(2)return(s*2);

q*=i;

while(a[j]!

)p++;

p=q;

{for(i=1,q=1.0;

i++)a[i++]=a[j++];

}q*=i;

}p/=q;

a[i]='

str[i]=0;

for(i=1,q=1.0;

=m-n;

i++)35.b=__1__;

strcpy(__2__,"

LiSi"

21:

voidfun(int(*a)[N],int__1__)p/=q;

i++)printf("

%6.2f"

b.__3__);

for(i=0;

__2__;

i++)returnp;

(1)a

(2)b.name(3)score[i]a[0][i]=__3__;

28:

(1)s[j++]=s[i];

或{s[j]=s[i];

j++;

}

(2)s[j]=0;

1)k

(2)N(3)a[k][i]__2__;

while(*p!

(1)for(i=strlen(t)-1;

i;

i--)或for(i=strlen(t)-1;

return__3__;

{i>

0;

i--)

(2)if(t[j]>

t[j+1])填空:

(1)48

(2)s++(3)sum*(q++)=*(p++);

(1)if((k%13==0)||(k%17==0))

(2)}}for(i=0;

ss[i]!

i++)编程:

doublesum=0.0;

36:

if(i%2==1&

ss[i]>

ss[i]<

)inti;

strcpy(b__2__,"

LiJie"

ss[i]=ss[i]-32;

for(i=21;

i++)fun(__3__);

p++)if((i%3==0)&

(i%7==0))sum+=i;

(1)->

sno

(2)->

name(3)&

tfor(j=0;

j++)a[i][j]=a[i][j+1];

returnsqrt(sum);

(1)doublefun(doublea,doublex0)a[i][N-1]=__3__;

29:

(2)if(fabs(x1-x0)>

=0.00001)填空:

1)k

(2)N-1(3)tempk[n]+=__2__;

(1)voidfun(inta[][M],intm)if(max<

k[n])max=__3__;

doublea

展开阅读全文
相关资源
猜你喜欢
相关搜索

当前位置:首页 > 小学教育 > 数学

copyright@ 2008-2022 冰豆网网站版权所有

经营许可证编号:鄂ICP备2022015515号-1