填空题

Cc031.c

#include<stdio.h>

#include<math.h>

/**/ /**/

{float x,x0,f,f1;

x=1.5;

do

{x0=x;

f=((2*x0-4)*xo+3)*x0-6;

f1=(6*x0-8)*x0+3;

x=x0-f/f1;

}

/**/ /**/ (fabs(x-x0)>=1e-6); ptintf(“the not is:%.2f\n”,x);

Cc641.c

#include<stdio.h>

#include<conio.h>

int main()

{ unsigned int low,high, /** / temp /**/; printf(“Please input 2 possitive integers:”); scanf(“%u%u”,&low,&high);

if (high<low)

{temp=high;

/**/ /**/

low=temp;

}

for{temp=low;temp<=high;temp++} If (temp%2==/**/ /**/)

printf(“%u”,temp);

}

Cc642.c

#include<stdio.h>

#include<conio.h>

{ double sum=0.0;

/**/;

For(i=1;i<=n;i++)

{ sum=sum+1.0/(2*i+1)/ /**/ /**/;} }

Int main()

{printf(“fun(53)-%8.3\n”,fun(53));

getch();

Return 0;

}

Cc651.c

#include<stdio.h>

#include<conio.h>

void lettersprint(int n)

{int line,letter,space;

char ch /**/ /**/;

for (line=1;/**/ line<=5 /**/;line++)

{for (space=1;space<=n-line;space++) printf(“~~”); for(letter=1;letter<=2*line-1;letter++)

printf(“2c”,/**/ /**/);

ch++;

Printf(“\n”)

}

}

int main()

{ int n;

printf(“please input n (0<n<20):”);

scanf(“%d”,&n);

lettersprint(n);

getch()

return 0;

Cc652.c

int main()

{int c7,c3,c2;

{for(c3=10;c3>=0;c3--)

for(c2=15;/**/ c2>=0 /**/;c2--)

if(7*c7+3*c3+2*c2==/**/ printf(“c7=%d c3=%d c2=%d\n”,c7,c3,c2); }

getch()

return 0;}

Cc661.c

#include<stdio.h>

#include<conio.h>

Unsigned long calcul(unsigned int n,unsigned int n) {unsigned int i;

unsigned long result;

result=/**/ /**/;

for(i=n;i>=n;i--)

result* /**/ i /**/;

return result;

}

Int mian() /**/;

Printf(“please input 2 possitive integers n and n(0<m<n<10):”);

Cc671.c

#include<stdio.h>

#include<conio.h>

int mian()

{ int a,an,an-1,an-2,i;

long sum=2;

an-1=1;

an-2=/**/ /**/;

printf(“input (2<n<30):”);

scanf(“%d”,&n);

{an=an+1+an-2

an-2=an-1

an-1=an;}

printf(“1-sum=%1d\n”,sum);

getch

}

Cc672.c

#include<stdio.h>

#include<conio.h>

#include<string.h>

define N 100

void invert_str(char a[],int x)

{int /**/ /**/;

printf(“Now invert string is:”);

For(i=x-1;i>=0; /**/ i-- /**/)

printf(“%c”,a[i]);

Printf(“\\n”);

}

Int main()

{char str[N]

Int n;

Printf(“please input string:”);

gets(str);

Cc682.c

#include<stdio.h>

#include<conio.h>

int main()

{ int i,x,a,b,c;

for (i=11;i<=/**/ {x=i+i;

c=x%10;

b=x/10%10;

a=x/10;

if (a==b||a==c|| /**/ printf(“%d+%d=%d\n”,i,i, /**/ /**/); }

getch();

return 0;

}

改错题

Cm591.c

#include<stdio.h>

#include<conio.h>

void main()

{int i,j,k,s,n=0;

for(i=10;i<100;i++)

{/**/ k=0;/**/

S=0;j=i;

while(j)

{k*=j%10;

S+=j%10;

/**/ j=j%10 /**/;

}

if(/**/k<s/**/)

{if(n%10==0) printf(“\n”);

n++;

printf(“%-5d”,i);

}

}

printf(“\n”); n=strlen(/**/ /**/); invert_str(str,n); getch(); return 0; }

getch();

}

Cm632.c

#include<stdio.h>

#include<conio.h>

Void pattern(/**/ int /**/) int n {int i,j,space;

For(i=1; /**/ i<n /**/;i++) i<=n {for(space=1;space<=20-i;space++)

Printf(“”);

For(j=1;j<=2*i-1;j++)

{if(/**/ j%2==0 /**/) j%2!=0 Printf(“*”);

Else

Printf(“#”);

}printf(“\n”);

}}

Cm641.c

#include<stdio.h>

#include<conio.h>

#include<math.h>

int main()

{ int a,b;

/**/ int result /**/ double result do(printf(“please input 2 possitive integers(aand 6):”); scanf(“%d%d”,&a,&b);

} while(a<=0 /**/ &&/**/ b<=0 ); || result=sqrt(a)+ /**/ sqrt(b) /**/; sqrt printf(“result=%.2f\n”,result);

Cm642.c

#include<stdio.h>

#include<conio.h>

int main()

{int i,n=0;

for(i=1;i<=100; /**/ i+=2 /**/) i++ If(/**/ i%3==0 /**/) i%3==0 {printf(“%5d”,i)

n++

if(n%7== /**/ 1 /**/) printf(“\n”) 0

getch()

return 0

Cm651.c

#define N 10

int main()

{double a[N]={1.1,3.2,5.3,0.4,4.5,6.7,8.8,9.0,10.0,2.2},ave,sum1 float i;

for(i=0;/**/ i>=N /**/;i++) i<N

sum1+=a[i];

ave=sum1/N;

/**/ i=0 /**/; i=0

while(i<N)

{sum2+=(a[i]-ave)*(a[i]-ave);

i++;

}

Printf(“sum2=%.3f\n”,sum2);

getch();

return 0;

Cm652.c

#include<stdio.h>

#include<conio.h>

Int prime(int x)

{ int i mark+1;

For (i=1;i<=x/2;i++)

If ( /**/ x%i=8 /**/ ) x%i==0

{mark=0

Break;

}

Return mark;

}

Int main()

{int /**/ n,a /**/ n,a,b;

do

{printf(“input even number(number)=6:”);

Scanf(“%d”,&n);

}

While (n%2==1 || n<6);

For (a=2;a<n;a++)

(b= /**/ n+a /**/; n-a

i=(prime(a)*prime(b)==1)

Cm662.c

#include<stdio.h>

#include<conio.h>

#define N 5

#define M 6

Float convert_arr(int a[][N])

{float sum,aver;

Int i,j;

/**/ sum=1 /**/ sum=0 for(i=0;i<M;i++)

For(j=0;j<N;j++)

Sum+=a[i][j];

Aver=sum /**/ N≠N /**/; (M*N) For(i=0;i<N;j++)

For(j=0;j<N;j++)

If (a[i][j]>=aver)

a[i][j]=1;

else a[i][j]=/**/ /**/; 0 return aver;

}

Cm671.c

int main()

{int a[10],pass,j,temp;

Ptintf(“enter 10 integers:”);

for(j=0;j<10;j++) scanf(“%d”,&a[j]);

for(pass=1;pass<10; /**/ pass+=2 /**/) for(j=0;j<10-pass;j++)

if(a[j]>a[j+1])

{ temp=a[j];

a[j]=a[j+1];

/**/ a[j+1]=a[j]; /**/ a[j+1]=temp; printf(“sorted numbers:\n”);

for(j=0;/**/ j<=10 /**/;j++) j<10 printf(“%d”,a[j]);

printf(“\n”);

getch();

return0;

}

Cm672.c

Int main()

{ int /**/ a1=2,a2=1; /**/ a1=2,a2=1,a3; Double sum;

Int i; pass+=1

Sum=1.0=a1/a2;

For (/**/ i=1 /**/;i<=20;i++) i=2 {a3=a1+a2;

a2=a1;

a1=a3;

Sum+= /**/ a1/a2 /**/; 1.0*a2/a1 }

Printf(“sum=%1f\n”,sum);

Cm681.c

Int main()

{char str[100];

Int i,j,len flag-1;

Printf(“ :”);

gets(str);

len=strlen(s+r);

for(i=0,j=len-1; /**/ i>j /**/;i++,j--) if(str [i]!=s+r[j])

{flag=0;

/**/ continue; /**/ break; }

If(/**/ !flag /**/) flag

Printf(--------------)

编程题

Cp642.c

#include<stdio.h>

#include<conio.h>

#define N 4

long fun(int a[N],int b[N])

{/**/

int i, j;

long int sum=0;

for (i = 0; i < N; i++)

sum += a[i] * b[i];

return sum;

}

/**/}

int mian()

{int a[N]={1,2,-1,2} b[N]={0,1,2,-1}

printf(“muti=%1d\n”,fun(a,b));

printf(“\n”)

getch() i<=j

return 0

Cp651.c

double fun(float x)

{/**/

double y;

y=(1.1*x+exp(x-0.75)/(fabs(x-0.22)+1.03); return y

/**/

Cp652.c

#define N 10

void fun (int a[N+1],int x)

{/**/

int i,j,k=0;

int max;

for(i=0;i<N;i++)

max=0;

{for (j=1;j<N;j++)

If(a[i][max]<a[i][j])

max=j;

b[k]=a[i][max];

k++;}

/**/

}

int mian()

int a[N+1]={-5,23,16,18,33,21,8,6,4,10},x,i; printf(“input x:”);

scanf(“%d”,&x);

printf(“Array a:\n”);

for-----------------------------------

Cp662.c

#include<stdio.h>

#include<conio.h>

{ /**/ long int fun(char s[])

{ long int a=0;

Long int i,k,su;

i=strlen(s)-1;

While(i>=0)

{ su=1;

For(k=strlen(s)-1;k>i;k--) su*=10; a+=(s[i--]-’0’)*su;

}

Ruturn

}

/**/

}

Int main()

{ char s[]=”1 2 3 4”;

Printf(“the result value is %1d\n”,fun[s]); getch();

return 0;

}

Cp671.c

#include<stdio.h>

#include<conio.h>

#include<math.h>

double fun(float x)

{ /**/ double y;

If (x<1)

y=x;

else if (x>=1 && x<5)

/**/

}

Int main()

{ printf(“fun(0.27)=%1f\n”,fun(0.27)); printf(“fun(4.3)=%1f\n”,fun(4.3)); printf(“fun(6.9)=%1f\n”,fun(6.9)); getch()l

Return 0;

}

Cp672.c

#include<stdio.h>

#include<conio.h>

#define N 4

void fun (int a[N][N],int b[N]) {/**/

int i,j,k=0;

int max;

for(i=0;i<N;i++) y=3.2+1.1*x; else(x>5) y=log(x); return y; a;

max=0;

/**/

}

Int a[N][N]={{1,2,3,4},{5,-6,-7,-8},{0,9,-3,7},{11,12,-3,4}},b[N]={0},i; {for (j=1;j<N;j++) If(a[i][max]<a[i][j]) max=j; b[k]=a[i][max]; k++;} For(a,b);

For(i=0;i<N;i++)

printf(“%d”,b[i]);

getch ( );

return 0;

}

Cp681.c

Double fun(float x)

{ /**/ double y;

y=(0.723+log(3*x))/(fabs(x-0.17)+0.5)

Return y;

/**/

}

Int mian()

{ printf(“\n fun%.3f=%.3f\n”)

Getch()

Return 0

Cp682.c

#define N 4

Void fun (int a[N][N])

{/**/ int b[N][N];

for(int i=0;i<N;i++)

{

for(int j=0;j<N;j++)

{

b[N-i][N-j]=a[i][j];

}

}

for(int m=0;i<N;m++)

{

for(int n=0;j<N;n++)

{

a[m][n]=b[m][n];

}

}

/**/

}

Int main()

{

Int a[N][N]={{11,-2,3,4}