题解 | 公务员面试
公务员面试
https://www.nowcoder.com/practice/f3a134908d5b41869f14f58307008a97
#include <stdio.h>
int MAX(int arr[], int n) {
int max = arr[0];
for (int i = 1; i < n; i++) {
if (arr[i] > max) {
max = arr[i];
}
}
return max;
}
int MIN(int arr[], int n) {
int min = arr[0];
for (int i = 1; i < n; i++) {
if (arr[i] < min) {
min = arr[i];
}
}
return min;
}
int main() {
int num[7];
while (scanf("%d %d %d %d %d %d %d", &num[0], &num[1], &num[2], &num[3],
&num[4], &num[5], &num[6]) != EOF) {
int sum = 0;
for (int i = 0; i < 7; i++) {
sum += num[i];
}
int max = MAX(num, 7);
int min = MIN(num, 7);
sum = sum - max - min;
printf("%.2lf\n", (double)sum / 5.0);
}
return 0;
}
查看18道真题和解析