c语言机试改错题题库,计算机二级机试c语言题库改错答案

题库中所有答案

p=j; p=i;

if(('a'<=tt[i])&&(tt[i]<='z')) tt[i]-=32

n=*p-'0' n=n*8+*p-'0'

double f(double x) return s;

long s=0,t=0; t=t/10;

void fun(long s,long *t) while(s>0)

if(p==n) return -1; a[i]=a[i+1];

for(j=i+1;j<6;j++) *(pstr+i)=*(pstr+j);

int t[N],i,num=0; t[num++]=b[i]; for(i=0;i

k++; if(m==k)

void fun(int *a) a[j]=a[j-1];

void fun(char *str,char ch) if(*str!=ch) str[1]=0;

t=a;a=b;b=t; reyurn(b);

a2=k/10; return i;

while((high>=2)&&(n<10)) yes=0;break;

sum=0.0; if((i+1)%5==0)

t=1.0 return(s*2);

r=t; r=t;

double fun(double a,double x0) if(fabs(x1-x0)>=0.00001)

double r; while(fabs(n-m)>=0.001)

double fun(int n) s=s+(double)a/b;

*t=0; if(d%2!=0)

if(i&2||s[i]%2==0) t[j]='/0'

d=1; s=0; d=d/10;

if(i%k==0) if(k==i)

double fun(int n) return sum;

c=c+32; c=c+5;

int k,q,i; PERSON std

for(i=0;str[i];i++) if(substr[k+1]=='/0')

t=*x;*x=y; return t;

switch(g) case 1:case2: return 1;

void fun(char *a) printf("%c",*a)

return t; for(i=0;i

s[j++]=s[i]; s[j]='/0';

#define FU(m,n)(m)/(n) return (value);

return 3; else return 1;

result*=n--; return result;

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

while(i

void fun(int m,int k) aa[i]=m%k; printf("%d",aa[i-1]);

int fun(int n) if(n==1)

for(i=0,t=0;p[i];i++) c[t]='/0';

float k; if(*a

s[j++]=s[i]; s[j]='/0'

int i,j=0,k,sum; if(sum%4==2)

int i,one=0,zero=0; switch(s[i]) case 0:zero++;break;

void fun(char *s,int*a,int*b) *a=*a+1 *b=*b+1

double fun(int n) s=s+(double)a/b;

fun(int x,int y,int z) return j;

b[k]=*p; b{k++]='';

int k=0; while(*p||*q)

if(d%2==0) s/=10

n=strlen(aa) ch=aa[i];

int fun(inta[],int m) else if(m>a[mid])

char *fun(char(*sq)[M]) return sp;

void fun(char *s,char*t) t[2*d]='/0';

if(n==0) result *=n--;

a=NULL; if(*r==*p)

while(*r) *a=*r;a++;r++;

y=1; d=a-i;

void fun(int *x,int *y) t=*x;*x=*y;*y=t

void fun(int a[][M],int m) a[j][k]=(k+1)*(j+1);

double fun(int k) return s;

char *fun(char *s,char *t) s++ t++

b[i]=0; b[a[i]-'a']++ if(b[max]

void fun(int *a,int n) m=i;

s=s+(double)(n+1)/n; return t;

for(i=2;i<=m;i++) y+=1.0/(i*i)

int fun(int n,int xx[][M]) printf("%d",xx[i][j])

for(i=0,t=0;p[i];i++) c[t]='/0';

b[j]=a[i][0]; for(j=1;ja[i][j])

p=s; while(*p++);

t+=s[k]; *aver=ave;

p=(NODE*)malloc(sizeof(NODE)); return h;

while(*s) s++;

double sum=0.0; sum/=c;

while(fabs(t)>=num) t=s/n;

q=p+i; while(q>p)

while(*w) if(*r==*p)

IsPrime(int n) if(!(n%d))

void fun(int *a,int *b) t=*b,*b=*a;*a=t

if(*p=='') *(p-1)=toupper(*(p-1));

for(i=1;i<=y;i++) t=t%1000;

if(t==

0) *zero=count

float fun(int n) for(i=2;i<=n;i++)

void fun(char *s,int num[5]) num[k]=0; switch(*s)

while(p!=NULL) p=p->next