题解 | 牛牛的数学作业

#include <stdio.h>



int jicha(int arry[], int n)//极差函数
{
int min = arry[0];
int max = arry[0];
for(int i = 0; i<n ;i ++){
if(arry[i]<min)
{
    min = arry[i];
}
if(arry[i]>max) {
max = arry[i];
}
}
return (max - min);
}
//方差函数
double fangcha(int arry[], int n){
double sum = 0.0;
double avg  = 0.0;
double fc = 0.0;
double sum_fc = 0.0;
for (int i = 0;i <n; i++) {
sum = sum + arry[i];
}
avg  = sum / n;
for (int i = 0;i <n; i++) {
fc = ((arry[i] - avg)*(arry[i] - avg));
sum_fc = fc + sum_fc;
}
    return sum_fc / n ;
}


int main() {
int a ,b ;

scanf("%d",&a);
while(a --){//多组输入
scanf("%d",&b);
int arry[b];

for(int i = 0; i<b ;i ++)
{
    scanf("%d",&arry[i]);
}
printf("%d %.3lf",jicha(arry,b),fangcha(arry, b));
printf("\n");
    
}
return 0;
}