C语言实验报告（答案）(8)

case 2: count[2]++; break; case 3: count[3]++; break; case 4: count[4]++; break; case 5: count[5]++; break; case 6: count[6]++; break; case 7: count[7]++; break; case 8: count[8]++; break; case 9: count[9]++; break; case 10: count[10]++; break;

default: printf(\}

}

printf(\for (grade=1; grade<=GRADE_SIZE-1; grade++)

{ printf(\ for (j=0; j

{

printf(\ }

printf(\ } } 解法二：

#include #define STUDENTS 40 #define GRADE_SIZE 11 main() {

int i, j, grade;

int score[STUDENTS], count[GRADE_SIZE] = {0}; printf(\ students:\\n\

36

for (i=0; i

scanf(\ }

for ( i=0; i

{

count [ score[ i ] ] ++; }

printf(\for (grade=1; grade<=GRADE_SIZE-1; grade++) {

printf(\ for (j=0; j

{

printf(\}

printf(\ } }

2. 大奖赛现场统分 #include #define M 10 #define N 3 void main() {

int i,j,k;

float pf[N][M],sf[N],max,min,sum,temp; system(\ for(i=0;i

printf(\ performance:\\n\

37

for( j=0;j

scanf(\

}

for(i=0;i

sum=0.0; max=pf[i][0];

min=pf[i][0]; for(j=0;j

if (max

else if(min>pf[i][j]) min=pf[i][j]; sum=sum+pf[i][j]; }

sf[i]=(sum-max-min)/(M-2);

printf(\ is:%.2f\ }

for(i=0;i

k=i;

for(j=i+1;j

if(sf[k]

if(k!=i) {

temp=sf[i];

sf[i]=sf[k]; sf[k]=temp; }

}

printf(\ for(i=0;i

printf(\}

38