c答案(6)

{int i;

char line[100]; gets(line);

for(i=longest(line);alph(line[i]);i++) printf(\ printf(\} 7.11 #define N 10 char str[N]; main()

{int i,flag;

for(flag=1;flag==1;) {scanf(\ if(strlen(str)>N) printf(\ else

flag=0; } sort(str);

for(i=0;i

sort(str) char str[N]; {int i,j;

char t;

for(j=1;j

for(i=0;(istr[i+1]) {t=str[i]; str[i]=str[i+1]; str[i+1]=t; } }

7.12

＃i nclude float solut(a,b,c,d) float a,b,c,d; {float x=1,x0,f,f1; do

{x0=x;

26

f=((a*x0+b)*x0+c)*x0+d; f1=(3*a*x0+2*b)*x0+c; x=x0-f/f1; }

while(fabs(x-x0)>=1e-5); return(x); }

main()

{float a,b,c,d;

scanf(\ printf(\} 7.13 main() {int x,n;

float p();

scanf(\

printf(\}

float p(tn,tx) int tn,tx; {if(tn==0) return(1); else if(tn==1) return(tx); else

return(((2*tn-1)*tx*p((tn-1),tx)-(tn-1)*p((tn-2),tx))/tn); }

7.14

#define N 10 #define M 5

float score[N][M]; float a_stu[N],a_cor[M]; main() {int i,j,r,c; float h;

float s_diff(); float highest(); r=0; c=1;

input_stu(); avr_stu();

27

avr_cor();

printf(\ number class 1 2 3 4 5 avr\ for(i=0;i

{printf(\ for(j=0;j

printf(\ printf(\ }

printf(\ for(j=0;j

printf(\ %d %d\\n\ printf(\ %8.2f\\n\}

input_stu() {int i,j; float x;

for(i=0;i

float s;

for(i=0;i

{for(j=0,s=0;j

for(j=0;j

{for(i=0,s=0;i

float highest(r,c)

28

int *r,*c;

{float high; int i,j;

high=score[0][0]; for(i=0;ihigh) {high=score[i][j]; *r=i+1; *c=j+1; } return(high); }

float s_diff()

{int i,j;

float sumx=0.0,sumxn=0.0; for(i=0;i

{sumx+=a_stu[i]*a_stu[i]; sumxn+=a_stu[i]; }

return(sumx/N-(sumxn/N)*(sumxn/N)); } 7.15

＃i nclude #define N 10

void input_e(num,name) int num[];

char name[N][8]; {int i;

for(i=0;i

{scanf(\ gets(name[i]); }

}

void sort(num,name) int num[]; char name[N][8]; {int i,j,min,temp1; char temp2[8]; for(i=0;i

{min=i;

for(j=i;j

if(num[min]>num[j])min=j;

29

temp1=num[i];

num[i]=num[min]; num[min]=temp1; strcpy(temp2,name[i]); strcpy(name[i],name[min]); strcpy(name[min],temp2); }

for(i=0;i

printf(\}

void search(n,num,name) int n,num[];

char name[N][8]; {int top,bott,min,loca; loca=0; top=0;

bott=N-1;

if((nnum[N-1])) loca=-1;

while((loca==0)&&(top<=bott)) {min=(bott+top)/2;

if(n==num[min]) {loca=min;

printf(\ }

else if(n

top=min+1; }

if(loca==0||loca==-1)

printf(\}

main()

{int num[N],number,flag,c,n; char name[N][8]; input_e(num,name); sort(num,name); for(flag=1;flag;)

{scanf(\ search(number,num,name); printf(\ c=getchar(); if(c=='N'||c=='n')

30