c语言程序填空4590Word下载.docx
《c语言程序填空4590Word下载.docx》由会员分享,可在线阅读,更多相关《c语言程序填空4590Word下载.docx(53页珍藏版)》请在冰豆网上搜索。
else
{p[k]=s[i];
k++;
}
__2__;
i++)t[j+i]=p[i];
t[j+k]=__3__;
returnt;
main()
{chars[80];
printf("
Pleaseinput:
"
);
scanf("
%s"
s);
\nTheresultis:
%s\n"
fun(s));
46.
1.j2.k3.p
ctype.h>
//思考为什么要有这两个指针变量
{if(isdigit(s[i])){
p[__1__]=s[i];
{t[k]=s[i];
i++)p[j+i]=t[i];
p[j+k]=0;
return__3__;
47.
1.0.02.av/N3.j++
1.#include<
#defineN10
doublefun(doublex[],double*y)
{inti,j;
doubleav;
av=__1__;
N;
i++)av=av+__2__;
for(i=j=0;
if(x[i]>
av)y[__3__]=x[i];
y[j]=-1;
returnav;
{inti;
doublex[N]={46,30,32,40,6,17,45,15,48,26};
doubley[N];
i++)printf("
%4.0f"
x[i]);
\n"
\nTheaverageis:
%f\n"
fun(x,y));
y[i]>
=0;
%5.0f"
y[i]);
48.
1*av2.i3.x[j]
doublefun(doublex[],double*av)
doubled,s;
s=0;
i++)s=s+x[i];
__1__=s/N;
d=32767;
if(x[i]<
*av&
*av-x[i]<
=d){
d=*av-x[i];
j=__2__;
doublex[N]={46,30,32,40,6,17,45,15,48,26};
doubleav,m;
m=fun(x,&
av);
av);
m=%5.0f"
m);
49.
答案;
1.s/N2.j++3.-1
doublefun(double*x)
{inti,j;
doubles,av,y[N];
i++)s=s+x[i];
if(x[i]>
av){
y[__2__]=x[i];
x[i]=-1;
if(x[i]!
=__3__)y[j++]=x[i];
i++)x[i]=y[i];
fun(x));
\nTheresult:
.
50.
答案:
1.x[i]/N2.j++3.i++
doubleav,y[N];
av=0;
i++)av+=__1__;
if(x[i]<
y[j]=x[i];
__2__;
i=0;
while(i<
N)
{if(x[i]!
=-1)y[j++]=x[i];
__3__;
doublex[N];
i++){x[i]=rand()%50;
51.
1.482.s++3.ctod(a)+ctod(b)
#defineN9
longctod(char*s)
{longd=0;
while(*s)
if(isdigit(*s)){
d=d*10+*s-__1__;
returnd;
longfun(char*a,char*b)
{
{chars1[N],s2[N];
do
{printf("
Inputstrings1:
gets(s1);
while(strlen(s1)>
N);
Inputstrings2:
gets(s2);
while(strlen(s2)>
Theresultis:
%ld\n"
fun(s1,s2));
52.
1.N2.break3n
#defineN20
voidfun(int*a)
{inti,x,n=0;
x=rand()%20;
while(n<
__1__)
{for(i=0;
i++)
if(x==a[i])__2__;
if(i==__3__){a[n]=x;
n++;
{intx[N]={0},i;
fun(x);
Theresult:
\n"
for(i=0;
%4d"
if((i+1)%5==0)printf("
\n\n"
53.
1.2.3.
#defineN4
voidfun(int(*a)[N],int*b)
i++){
b[i]=__1__;
for(j=1;
j<
j++)
if(b[i]__2__a[j][i])b[i]=a[j][i];
{intx[N][N]={{12,5,8,7},{6,1,9,3},{1,2,3,4},{2,8,4,3}},y[N],i,j;
\nThematrix:
i<
{for(j=0;
j<
j++)printf("
x[i][j]);
fun(__3__);
"
%3d"
54.
答案
1.[N]2.i3.i+1
#defineN7
voidfun(int(*a)__1__)
{inti,j,k,m;
if(N%2==0)m=N/2;
elsem=N/2+1;
m;
for(j=__2__;
N-i;
a[i][j]=a[N-i-1][j]=i+1;
for(k=i+1;
k<
k++)
a[k][i]=a[k][N-i-1]=__3__;
{intx[N][N]={0},i,j;
fun(x);
55.
102.||3.1
#defineN3
intfun(int(*a)[N])
{inti,j,m1,m2,row,colum;
m1=m2=0;
{j=N-i-1;
m1+=a[i][i];
m2+=a[i][j];
if(m1!
=m2)return0;
row=colum=__1__;
for(j=0;
{row+=a[i][j];
colum+=a[j][i];
if((row!
=colum)__2__(row!
=m1))return0;
{intx[N][N],i,j;
Enternumberforarray:
j++)scanf("
%d"
&
x[i][j]);
Array:
if(fun(x))printf("
TheArrayisamagicsquare.\n"
elseprintf("
TheArrayisn'
tamagicsquare.\n"
56.
1.k2.N3.a[k][i]
#defineM4
voidfun(int(*a)[N],int__1__)
{inti,temp;
for(i=0;
i<
__2__;
{temp=a[0][i];
a[0][i]=__3__;
a[k][i]=temp;
{intx[M][N]={{1,2,3},{4,5,6},{7,8,9},{10,11,12}},i,j;
Thearraybeforemoving:
M;
fun(x,2);
Thearrayaftermoving:
57.
1.k(移动次数)2.N3.temp
#defineM3
#defineN5
voidfun(int(*a)[N],intk)
{inti,j,p,temp;
for(p=1;
p<
=__1__;
p++)
{temp=a[i][0];
j++)a[i][j]=a[i][j+1];
a[i][N-1]=__3__;
main()
{intx[M][N]={{1,2,3,4,5},{1,2,3,4,5},{1,2,3,4,5}},i,j;
58.
1.j2.03.i++
voidfun(int(*a)[N])
{inti=0,j,find=0,rmax,c,k;
while((i<
M)&
(!
find))
{rmax=a[i][0];
c=0;
if(rmax<
a[i][j]){
rmax=a[i][j];
c=__1__;
find=1;
while(k<
M&
find){
if(k!
=i&
a[k][c]<
=rmax)find=__2__;
if(find)printf("
find:
a[%d][%d]=%d\n"
i,c,a[i][c]);
__3__;
if(!
find)printf("
notfound!
{intx[M][N],i,j;
Thearray:
59.
1.t,s2.s[i]3.0
#defineN80
voidfun(char*s,intn,char*t)
{intlen,i,j=0;
len=strlen(s);
if(n>
=len)strcpy(__1__);
else{
for(i=len-n;
=len-1;
i++)t[j++]=__2__;
t[j]=__3__;
{chars[N],t[N];
intn;
Enterastring:
gets(s);
printf("
Entern:
n);
fun(s,n,t);
Thestringt:
puts(t);
60.
1.s2.--3.return0
intfun(char*s)
{char*lp,*rp;
lp=__1__;
rp=s+strlen(s)-1;
while((toupper(*lp)==toupper(*rp))&
(lp<
rp)){
lp++;
rp__2__;
if(lp<