uva 591 Box of Bricks

来源:互联网 发布:oracle nvl 转 mysql 编辑:程序博客网 时间:2024/05/11 04:45

平均数简单题目

#include <stdio.h>#defineMAX_LEN51int h[MAX_LEN];int case_count;void func(int n){int i;int sum, aver;sum = 0;for(i=0; i<n; i++)sum += h[i];aver = sum/n;sum = 0;for(i=0; i<n; i++){if(h[i] > aver)sum += h[i]-aver;}printf("Set #%d\n", case_count);printf("The minimum number of moves is %d.\n", sum);printf("\n");}int main(void){int n, i;case_count = 0;while(1){scanf("%d", &n);if(!n)break;for(i=0; i<n; i++){scanf("%d", h+i);}case_count ++;func(n);}}