二级题库（30）

void fun( int  m, int  a[10])
{  int  i;
  for (i=0; i<10; i++)
/found/
    a[i] = 0;
  while (m > 0)
  {
/found/
     i = m%10;
     a[i]++;
/found/
     m = m/10;
  }
}


void fun(int  a[][N], int  b[])
{   int  i, j;
    for (i=0; i<N; i++)
    {
/found/
        b[i] = a[i][0];
/found/
        for (j=1; j<N; j++)
/found/
           if ( b[i] > a[i][j] )
               b[i] = a[i][j];
    }
}


double fun(double  a[ ] , int  n)
{
	double sum=0,max,min;
	int i;
	max=min=a[0];
	for(i=0;i<n;i++)
	{
		sum=sum+a[i];
		if(max<a[i])max=a[i];
		if(min>a[i])min=a[i]; 
	}
	sum=sum-max-min;
	return(sum/(n-2)); 
}