C语言上机答案Word下载.docx
《C语言上机答案Word下载.docx》由会员分享,可在线阅读,更多相关《C语言上机答案Word下载.docx(22页珍藏版)》请在冰豆网上搜索。
eps)
{
i=1,a=1,b=1,c=1,s=0;
while(c>
=eps)
s+=c;
a*=i;
b*=2*i+1;
c=a/b;
i++;
s*2;
4、int
fun(int
score[],
m,
below[])
i,j=0,s=0;
for(i=0;
i<
m;
i++)
s+=score[i];
s/=m;
i++)
if(score[i]<
s)
below[j]=score[i];
j++;
}
j;
5、void
*a
i=0,j=0;
while(a[i])
if(j==0
a[i]!
*'
j=i+1;
if(a[i]!
a[j]=a[i];
a[j]=0;
6、void
j=i;
break;
a[i-j]=a[i];
i-=j;
for(;
j>
0;
j--)
a[i]='
7、void
*a,
n
if(j>
n)
a[i-j+n]=a[i];
a[i-j+n]=0;
8、void
x,
pp[],
*n
i;
*n=0;
for(i=1;
=x;
i+=2)
if(x%i==0)
pp[*n]=i;
(*n)++;
9、void
fun(char
*s,
t[])
while(s[i])
if(i%2!
=0
||
s[i]%2==0)
t[j]=s[i];
t[j]=0;
10、void
a,
b,
*c)
*c=a/10*100+a%10+b/10*10+b%10*1000;
11、double
s=0;
n;
if(i%3==0
i%7==0)
s+=i;
sqrt(s);
12、void
(*s)[10],
*b,
*n,
mm,
nn)
i,j;
mm;
for(j=0;
j<
nn;
j++)
b[*n]=s[i][j];
13、int
STREC
a[]
b;
N-1;
for(j=i+1;
N;
if(a[i].s<
a[j].s)
b=a[i];
a[i]=a[j];
a[j]=b;
14、double
w[][N]
s+=w[0][i]+w[N-1][i]+w[i][0]+w[i][N-1];
s-=w[0][0]+w[0][N-1]+w[N-1][0]+w[N-1][N-1];
s/(N*4-4);
15、int
t,
*k)
*k=0;
t;
if(s[i]>
s[*k])
*k=i;
16、void
j=0;
a[i-j]=0;
17、int
lim,
aa[MAX])
i,j,k=0;
for(i=2;
=lim;
for(j=2;
if(i%j==0)
if(j==i)
aa[k]=i;
k++;
k;
18、void
k,
xx[])
i,j=m+1,n=0;
while(n<
k)
if(j%i==0)
xx[n]=i;
n++;
19、double
*h
a=0;
*p=h->
next;
while(p)
if(a<
p->
s)
a=p->
s;
p=p->
a;
20、double
s+=a[i].s;
s/=N;
if(a[i].s>
b[*n]=a[i];
21、int
a[M][N]
i,s=0;
s+=a[0][i]+a[M-1][i];
M-1;
s+=a[i][0]+a[i][N-1];
22、void
if(i%2==1
s[i]%2==1)
23、fun(char(*a)[81],int
num,char
**max)
i,j,k=strlen(a[0]);
*max=a[0];
num;
j=strlen(a[i]);
if(k<
j)
k=j;
*max=a[i];
24、int
*str)
i,j=0;
while(str[j])
=j/2;
if(str[i]!
=str[j-i-1])
if(i>
=j/2)
1;
25、int
a[],
=a[j])
j+1;
26、void
*max,
*d
*d=0;
if(a[i]>
a[*d])
*d=i;
*max=a[*d];
27、int
*s)
i=0,j=0,f=1;
if(s[i]<
'
s[i]>
if(f)
f=0;
else
f=1;
28、int
a[][N],
m
for(j=i;
a[i][j]*=m;
29、void
(*s)[N],
*b)
M;
b[k]=s[j][i];
30、int
*b
i,j=0,s=a[0].s;
s=a[i].s;
if(a[i].s==s)
b[j]=a[i];
31、double
fun(double
x
a=1,b=1,s=1;
=n;
a*=x;
b*=i;
s+=a/b;
32、void
if(s[i]%2==0)
33、fun
(int
a[][M])
i,s=a[0][0];
if(a[0][i]>
s=a[0][i];
if(a[1][i]>
s=a[1][i];
34、long
*p)
if(p[0]=='
while(p[i])
s=s*10+p[i]-'
0'
s*=-1;
i=0;
35、void
*c=a/10*100+a%10+b/10*1000+b%10*10;
36、int
i,k=0;
*p=str,s[81];
while(*p)
if(*p!
s[k++]=*p;
p++;
str[i]=s[i];
str[i]='
\0'
37、void
p1[],
p2[])
*p,*q;
p=p1;
q=p2;
while(*p)
while(*q)
*p++=*q++;
*p='
38、int
array[3][3])
i,j,t;
3;
t=array[i][j];
array[i][j]=array[j][i];
array[j][i]=t;
39、void
*w,
p,
i,a[N];
=p;
a[i]=w[i];
n-(p+1);
w[i]=w[i+(p+1)];
w[n-(p+1)+i]=a[i];
40、void
a[M][N],
*p;
p=a[i];
b[k++]=*p++;
b[k]='
41、void
*c=a/10*10+a%10*1000+b/10+b%10*100;
42、void
n,int
h,int
e
n-h-e;
a[i]=a[i+h];
a[i]=0;
43、void
*c=a/10*1000+a%10*10+b/10+b%10*100;
44、void
i,k;
b[i]=0;
k=a[i]/10;
if(k>
=10)
b[10]++;
b[k]++;
45、double
s+=1.0/(i*(i+1));
46、float
m1=1.0,n1=1.0,k=1.0;
=m;
m1*=i;
n1*=i;
=m-n;
k*=i;
m1/n1/k;
47、void
b[k++]=s[i][j];
*n=k;
48、void
m)
a[N];
while(w[i])
w[i-m]=w[i];
i--;
m--;
m>
=0;
m--,i--)
w[i]=a[m];
49、int
*a,STREC
*b,int
l,
=l
a[i].s<
=h)
50、fun(
STU
*s
*s=a[0];
s->
*s=a[i];