二C上机编程题答案文档格式.docx
《二C上机编程题答案文档格式.docx》由会员分享,可在线阅读,更多相关《二C上机编程题答案文档格式.docx(96页珍藏版)》请在冰点文库上搜索。
doublefun(intn)
doublef0=0,f1=1,fn;
fn=f0+f1;
while(fn<
=n)
f0=f1;
f1=fn;
returnfn;
main()/*主函数*/
%f\n"
fun(1000));
4
voidfun(float*sn,intn)
floati,t=1;
*sn=0;
for(i=0;
{*sn+=t/(2*i+1);
t=-t;
{intn=11;
floats;
fun(&
s,n);
printf("
s=%fn=%d\n"
s,n);
5
doublefun(intm)
doubles=0,i;
s+=log(i);
returnsqrt(s);
fun(20));
6
doublefun(doublex,intn)
doubles=x+1,i,t=1;
for(i=2;
t*=i;
s+=pow(x,i)/t;
returns;
fun(0.3,10));
7
doublefun(intn)
doubles=0,i;
for(i=1;
s+=1.0/(i*(i+1));
main()
%f"
fun(10));
8
doublefun(doubleeps)
doubles=0,t=1,i,m=1;
t/m>
=eps;
s+=t/m;
t=t*i;
m=m*(2*i+1);
return2*s;
{doublex;
Inputeps:
"
);
scanf("
%lf"
&
x);
\neps=%lf,PI=%lf\n"
x,fun(x));
9
doublefun(doublex)
doublei,t=1,m=1,s=0;
fabs(m/t)>
=0.000001;
s=s+m/t;
m*=(0.5+1-i)*x;
t=t*i;
{doublex,s;
Inputx:
"
);
s=fun(x);
s=%f\n"
s);
10
doubles=0,t=0,i;
t+=i;
s+=1/t;
returns;
{intn;
doubles;
voidNONO();
\nPleaseenterN:
%d"
&
n);
s=fun(n);
theresultis:
%f\n"
s);
NONO();
voidNONO()
{/*本函数用于打开文件,输入数据,调用函数,输出数据,关闭文件。
*/
FILE*fp,*wf;
inti,n;
fp=fopen("
K:
\\K15\\24000108\\in.dat"
"
r"
wf=fopen("
\\K15\\24000108\\out.dat"
w"
for(i=0;
i<
10;
i++){
fscanf(fp,"
n);
s=fun(n);
fprintf(wf,"
s);
fclose(fp);
fclose(wf);
B类最大值和最小值(1—4)
stdlib.h>
voidfun(inta[],intn,int*max,int*d)
inti;
*d=0;
*max=a[0];
for(i=0;
n;
if(a[i]>
a[*d])
*d=i;
*max=a[*d];
{inti,x[20],max,index,n=10;
randomize();
for(i=0;
i<
n;
i++){x[i]=rand()%50;
%4d"
x[i]);
\n"
fun(x,n,&
max,&
index);
Max=%5d,Index=%4d\n"
max,index);
#defineN80
voidfun(int*s,int*t,int*k)
*k=0;
*t;
if(s[i]>
s[*k])
*k=i;
s[*t]=s[*k];
*t=*t+1;
{inta[N]={876,675,896,101,301,401,980,431,451,777},i,n,mi;
n=10;
\nTheoriginaldata:
i++)printf("
a[i]);
fun(a,&
n,&
mi);
Theindexofmaxis:
%d\n"
mi);
Theresult:
#defineM3
#defineN4
voidfun(inttt[M][N],intpp[N])
inti,j;
for(j=0;
j<
N;
j++)
pp[j]=tt[0][j];
M;
if(tt[i][j]<
pp[j])
pp[j]=tt[i][j];
{intt[M][N]={{22,45,56,30},
{19,33,45,38},
{20,22,66,40}};
intp[N],i,j,k;
Theoriginaldatais:
i++){
for(j=0;
%6d"
t[i][j]);
fun(t,p);
\nTheresultis:
for(k=0;
k<
k++)printf("
p[k]);
intfun(int*s,intt,int*k)
t;
inta[10]={876,675,896,101,301,401,980,431,451,777},k;
clrscr();
fun(a,10,&
k);
%d,%d\n"
k,a[k]);
C类二维数组行列下标(1—8)
voidfun(inta[3][3],intb[3][3])
{inti,j;
3;
for(j=0;
b[i][j]=a[i][j]+a[j][i];
{inta[3][3]={{1,2,3},{4,5,6},{7,8,9}},t[3][3];
inti,j;
fun(a,t);
%7d"
#defineN5
intfun(inta[][N],intm)
for(j=i;
a[i][j]*=m;
{inta[N][N],m,i,j;
*****Thearray*****\n"
{for(j=0;
{a[i][j]=rand()%20;
a[i][j]);
dom=rand()%10;
while(m>
=3);
m=%4d\n"
m);
fun(a,m);
THERESULT\n"
j++)printf("
intfun(intarray[3][3])
intt,i,j;
2;
for(j=1;
t=array[i][j];
array[i][j]=array[j][i];
array[j][i]=t;
intarray[3][3]={{100,200,300},
{400,500,600},
{700,800,900}};
array[i][j]);
fun(array);
Convertedarray:
{for(j=0;
doublefun(intw[][N])
doublesum=0;
sum+=w[0][j]+w[N-1][j];
N-1;
sum+=w[i][0]+w[i][N-1];
returnsum;
{inta[N][N]={0,1,2,7,9,1,9,7,4,5,2,3,8,3,1,4,5,6,8,2,5,9,1,4,1};
{printf("
s=fun(a);
*****THERESULT*****\n"
Thesumis:
%lf\n"
voidfun(int(*s)[10],int*b,int*n,intmm,intnn)
*n=0;
mm;
nn;
b[(*n)++]=s[i][j];
{intw[10][10]={{33,33,33,33},{44,44,44,44},{55,55,55,55}},i,j;
inta[100]={0},n=0;
Thematrix:
3;
i++)
{for(j=0;
j<
4;
j++)printf("
%3d"
w[i][j]);
fun(w,a,&
n,3,4);
TheAarray:
n;
i++)printf("
\n\n"
voidfun(ints[][10],intb[],int*n,intmm,intnn)
/*以下代码仅供参考*/
inti,j,np=0;
/*np用作b数组下标*/
b[np++]=s[j][i];
*n=np;
{intw[10][10]={{33,33,33,33},{44,44,44,44},{55,55,55,55}},i,j;
inta[100]={0},n=0;
i<
4;
j++)printf("
w[i][j]);
fun(w,a,&
n,3,4);
_
voidfun(inta[][N])
=i;
a[i][j]=0;
main()
voidNONO();
inta[N][N],i,j;
for(i=0;
i++)
{for(j=0;
j<
j++)
{a[i][j]=rand()%10;
printf("
a[i][j]);
fun(a);
printf("
j++)printf("
NONO();
voidNONO()
FILE*rf,*wf;
inti,j,a[5][5];
rf=fopen("
5;
for(j=0;
j++)
fscanf(rf,"
%d"
a[i][j]);
fun(a);
for(i=0;
5;
i++){
for(j=0;
j++)fprintf(wf,"
fclose(rf);
voidfun(inta[][N],intn)
a[i][j]*=n;
inta[N][N],n,i,j;
don=rand()%10;
while(n>
=3);
n=%4d\n"
n);
fun(a,n);
inti,j,n,a[5][5];
\\K15\\24000103\\in.dat"
"
\\K15\\24000103\\out.dat"
fun(a,n);
D类素数(1—3)
voidfun(intm,int*k,intxx[])
for(i=2;
m;
for(j=2;
i;
if(i%j==0)break;
if(j<
i)xx[(*k)++]=i;
intm,n,zz[100];
\nPleaseenteranintegernumberbetween10and100:
fun(n,&
m,zz);
\n\nThereare%dnon-primenumberslessthan%d:
m,n);
for(n=0;
n<
n++)
\n%4d\n"
zz[n]);
将大于形参m且紧靠m的k个素数存入xx数组中。
voidfun(intm,intk,intxx[])
/*以下代码仅供