题解 | #统计成绩#
统计成绩
https://www.nowcoder.com/practice/cad8d946adf64ab3b17a555d68dc0bba
#include <malloc.h> #include <stdio.h> int main() { int n; scanf("%d", &n); double* p = (double*)malloc(n * sizeof(double)); int i; double max, min, average, sum; max = 0.0, min = 0.0, average = 0.0; sum = 0; for (i = 0; i < n; i++) { scanf("%lf", p + i); sum += *(p + i); } max = min = p[0]; for (i = 0; i < n; i++) { if (*(p + i) > max) { max = *(p + i); } if (*(p + i) < min) { min = *(p + i); } } average = sum / n; printf("%.2lf %.2lf %.2lf", max, min, average); free(p); return 0; }