returnmax;
39填空
(1)0
(2)i++(3)2.*i
改错
(1)voidfun(char*s,char*t)
(2)t[2*d]=0;
编程inti,j=0;
for(i=1;i if(s[i]%2)t[j++]=s[i];
t[j]='\0';
40填空
(1)s[i]
(2)k(3)0
改错
(1)while(*w)
(2)if(*r==*p)
编程inti,j=0;
for(i=0;it[j]=0;
41填空
(1)double
(2)f1(3)f2
改错
(1)char*fun(char*s,char*t)
(2)ss++;(3)tt++;
编程inti;
for(i=0;i42填空
(1)FILE*
(2)fp(3)ch
改错
(1)s[j++]=s[i];
(2)s[j]=0;
编程for(j=0;j b[n]=s[j][i];
n=i*M+j+1;
}
43填空填空
(1)FILE*
(2)fclose(fp)(3)fp
改错
(1)t=(STU*)calloc(sizeof(STU),m);
(2)t[k]=b[j];
编程inti,t,j=0,*p=a;
t=p[0];
for(i=0;i<=n;i++)
if(t==p[i]) ;
else
{
a[j]=t; t=p[i];j++;
}
if(i>=n)
a[j]=t;returnj;
44填空
(1)"rb"
(2)>(3)fwrite
改错
(1)p=s;
(2)while(*p++);
编程inti,j;
for(i=0;i< M;i++)b[i]=0;
for(i=0;i< N;i++){
j=a[i]/10;
if(j> 10)b[M-1]++;elseb[j]++;
}
45填空
(1)filename
(2)fp(3)fp
改错
(1)p=(NODE*)malloc(sizeof(NODE));
(2)returnh;
编程inti,n=0;
for(i=0;i {
if(s[i]>='a'&&s[i]<='z'&&s[i+1]==''||s[i+1]=='\0')
n++;
}returnn;
46填空
(1)b[k]
(2)N/2(3)<
改错
(1)intt[N],i,num=0;
(2)t[num++]=b[i];(3)for(i=0;i编程inti,n=0;
for(i=0;s[i]!
='\0';i++)
if(s[i]>='0'&&s[i]<='9')
n++;returnn;
47填空
(1)i%5
(2)\n(3)a[i]
改错
(1)returnt;
(2)for(i=0;i(3)x[i+1]=findmid(a,b,c);
编程inti,j;
j=-1;
for(i=0;i{if(*s==x)
j=i;s++;
}returnj;
48填空
(1)pb
(2)p->data(3)p->next
改错
(1)inti,one=0,zero=0;
(2)switch(s[i])(3)case0:
zero++;break;
编程while(*s)
{*a=*s;
s++;a++;
}*a=’\0’;
49填空
(1)0
(2)t(3)i+t
改错
(1)b[i]=0;
(2)b[a[i]-'a']++;
(3)if(b[max]
编程inti,j;
longintp;
i=strlen(s);
p=s[0]-48;
for(j=1;j
p=p*10+(s[j]-48);
returnp;
50填空
(1)a[i]
(2)m%10(3)m/10
改错
(1)b[i]=a[i][0];
(2)for(j=1;j<=N-1;j++)
(3)if(b[i]>a[i][j])
编程doublesum=0,max,min;
inti;
max=min=a[0];
for(i=0;i{sum=sum+a[i];
if(maxmax=a[i];
if(min>a[i])
min=a[i];
}
sum=sum-max-min;
return(sum/(n-2));