全国计算机C语言二级上机试题10套5160文档格式.docx
《全国计算机C语言二级上机试题10套5160文档格式.docx》由会员分享,可在线阅读,更多相关《全国计算机C语言二级上机试题10套5160文档格式.docx(29页珍藏版)》请在冰豆网上搜索。
{
inti;
for(i=0;
tt[i];
i++)
/**********found***********/
if(('
a'
<
=tt[i])||(tt[i]<
='
z'
))
tt[i]+=32;
return(tt);
main()
chartt[81];
printf("
\nPleaseenterastring:
"
);
gets(tt);
\nTheresultstringis:
\n%s"
fun(tt));
000000000000000000000000000
voidfun(intm,int*k,intxx[])
NONO()
/*请在此函数内打开文件,输入测试数据,调用fun函数,
输出数据,关闭文件。
*/
intm,n,zz[100];
FILE*rf,*wf;
rf=fopen("
C:
\\WEXAM\\YS240001\\in.dat"
r"
);
wf=fopen("
\\WEXAM\\YS240001\\out.dat"
w"
fscanf(rf,"
%d"
&
n);
fun(n,&
m,zz);
fprintf(wf,"
%d\n%d\n"
m,n);
for(n=0;
n<
m;
n++)
%d\n"
zz[n]);
fclose(rf);
fclose(wf);
\nPleaseenteranintegernumberbetween10and100:
scanf("
\n\nThereare%dnon-primenumberslessthan%d:
"
\n%4d"
NONO();
52
unsignedlongfun(unsignedlongn)
{unsignedlongx=0;
intt;
while(n)
{t=n%10;
if(t%2==__1__)
x=__2__+t;
n=__3__;
returnx;
{unsignedlongn=-1;
while(n>
99999999||n<
0)
{printf("
Pleaseinput(0<
n<
100000000):
scanf("
%ld"
&
\nTheresultis:
%ld\n"
fun(n));
000000000000000000000
voidfun(longs,long*t)
{intd;
longsl=1;
/************found************/
t=0;
while(s>
0)
{d=s%10;
if(d%2==0)
{*t=d*sl+*t;
sl*=10;
s/=10;
{longs,t;
\nPleaseenters:
s);
fun(s,&
t);
Theresultis:
t);
00000000000000000000000
voidfun(charp1[],charp2[])
NONO()
{/*本函数用于打开文件,输入测试数据,调用fun函数,输出数据,关闭文件。
*/
inti;
chars1[80],s2[40];
for(i=0;
i<
10;
i++){
fscanf(rf,"
%s"
s1);
s2);
fun(s1,s2);
%s\n"
{chars1[80],s2[40];
Enters1ands2:
%s%s"
s1,s2);
s1=%s\n"
s2=%s\n"
Invokefun(s1,s2):
Afterinvoking:
NONO();
53
voidfun(char*s)
{inti,j,n;
s[i]!
='
\0'
;
if(s[i]>
0'
___1___s[i]<
9'
)
{n=0;
while(s[i+1+n]!
=___2___)n++;
for(j=i+n+1;
j>
i;
j--)
s[j+1]=___3___;
s[j+1]='
*'
i=i+1;
{chars[80]="
ba3a54cd23a"
\nTheoriginalstringis:
s);
fun(s);
\nTheresultis:
doublefun(intm)
{doubley=1.0;
/**************found**************/
for(i=2;
m;
y+=1/(i*i);
return(y);
{intn=5;
\nTheresultis%lf\n"
fun(n));
0000000000000000000000
voidfun(inta[3][3],intb[3][3])
inti,j,k,a[3][3],t[3][3];
for(k=0;
k<
5;
k++){
3;
%d%d%d"
a[i][0],&
a[i][1],&
a[i][2]);
fun(a,t);
for(j=0;
j<
j++)fprintf(wf,"
%7d"
t[i][j]);
main()/*主程序*/
{inta[3][3]={{1,2,3},{4,5,6},{7,8,9}},t[3][3];
inti,j;
for(i=0;
for(j=0;
j++)
NONO();
54
#defineN9
voidfun(int___1___,intn)
{inti,j,max,min,px,pn,t;
for(i=0;
n-1;
i+=___2___)
{max=min=a[i];
px=pn=i;
for(j=___3___;
j<
n;
{if(max<
a[j])
{max=a[j];
px=j;
if(min>
{min=a[j];
pn=j;
if(px!
=i)
{t=a[i];
a[i]=max;
a[px]=t;
if(pn==i)pn=px;
if(pn!
=i+1)
{t=a[i+1];
a[i+1]=min;
a[pn]=t;
{intb[N]={1,4,2,3,9,6,5,8,7},i;
\nTheoriginaldata:
N;
i++)printf("
%4d"
b[i]);
fun(b,N);
\nThedataaftermoving:
00000000000000000000
#defineSIZE20
fun(double*s,double*w)
{intk,i;
doublesum;
for(k=2,i=0;
SIZE;
i++)
{s[i]=k;
k+=2;
sun=0.0;
for(k=0,i=0;
{sum+=s[i];
if(i+1%5==0)
{w[k]=sum/5;
sum=0;
k++;
returnk;
{doublea[SIZE],b[SIZE/5];
inti,k;
k=fun(a,b);
Theoriginaldata:
{if(i%5==0)printf("
%4.0f"
a[i]);
\n\nTheresult:
k;
%6.2f"
b[i]);
\n\n"
#defineN8
typedefstruct
{charnum[10];
doubles;
}STREC;
doublefun(STREC*a,STREC*b,int*n)
{STRECs[N]={{"
GA05"
85},{"
GA03"
76},{"
GA02"
69},{"
GA04"
85},
{"
GA01"
91},{"
GA07"
72},{"
GA08"
64},{"
GA06"
87}};
STRECh[N],t;
FILE*out;
inti,j,n;
doubleave;
ave=fun(s,h,&
The%dstudentdatawhichislowerthan%7.3f:
n,ave);
%s%4.1f\n"
h[i].num,h[i].s);
out=fopen("
fprintf(out,"
%d\n%7.3f\n"
n,ave);
for(j=i+1;
j<
j++)
if(h[i].s>
h[j].s){t=h[i];
h[i]=h[j];
h[j]=t;
fprintf(out,"
%4.1f\n"
h[i].s);
fclose(out);
55
stdlib.h>
#defineN6
typedefstructnode{
intdata;
structnode*next;
}NODE;
voidfun(NODE*h)
{NODE*p,*q;
p=__1__;
while(p){
q=__2__;
while(q){
if(p->
data__3__q->
data)
{t=p->
data;
p->
data=q->
q->
data=t;
q=q->
next;
p=p->
NODE*creatlist(inta[])
{NODE*h,*p,*q;
h=(NODE*)malloc(sizeof(NODE));
h->
next=NULL;
{q=(NODE*)malloc(sizeof(NODE));
data=a[i];
if(h->
next==NULL)h->
next=p=q;
else{p->
next=q;
p=q;
returnh;
voidoutlist(NODE*h)
{NODE*p;
p=h->
if(p==NULL)printf("
ThelistisNULL!
else
\nHead"
do
->
p->
data);
p=p->
while(p!
=NULL);
End\n"
{NODE*head;
inta[N]={0,10,4,2,8,6};
head=creatlist(a);
\nTheoriginallist:
outlist(head);
fun(head);
\nThelistaftersorting:
00000000000000000000000000
typedefstructaa
{intdata;
structaa*next;
fun(NODE*h)
{intmax=-1;
NODE*p;
/***********found**********/
p=h;
while(p)
{if(p->
data>
max)
max=p->
p=h->
next;
returnmax;
outresult(ints,FILE*pf)
{fprintf(pf,"
\nThemaxinlink:
NODE*creatlink(intn,intm)
{NODE*h,*p,*s,*q;
inti,x;
h=p=(NODE*)malloc(sizeof(NODE));
h->
data=9999;
for(i=1;
=n;
{s=(NODE*)malloc(sizeof(NODE));
s->
data=rand()%m;
next=p->
next=s;
next=NULL;
outlink(NODE*h,FILE*pf)
fprintf(pf,"
\nTHELIST:
\n\nHEAD"
{fprintf(pf,"
%d"
p->
intm;
head=creatlink(12,100);
outlink(head,stdout);
m=fun(head);
\nTHERESULT:
outresult(m,stdout);
0000000000000000000
voidfun(int(*s)[10],int*b,int*n,intmm,intnn)
{/*请在此函数内打开文件,输入测试数据,调用fun函数,输出数据,关闭文件。
inti,j,k;
intw[10][10],a[100],n=0,mm,nn;
%d%d"
mm,&
nn);
mm;
nn;
j++)fscanf(rf,"
w[i][j]);
fun(w,a,&
n,mm,nn);
n;
i++)fprintf(wf,"
%3d"
a[i]);
{intw[10][10]={{33,33,33,33},{44,44,44,44},{55,55,55,55}},i,j;
inta[100]={0},n=0;
Thematrix:
{for(j=0;
j