Description

  Box of Bricks 

Little Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. ``Look, I've built a wall!'', he tells his older sister Alice. ``Nah, you should make all stacks the same height. Then you would have a real wall.'', she retorts. After a little con- sideration, Bob sees that she is right. So he sets out to rearrange the bricks, one by one, such that all stacks are the same height afterwards. But since Bob is lazy he wants to do this with the minimum number of bricks moved. Can you help?

Input 

The input consists of several data sets. Each set begins with a line containing the number n of stacks Bob has built. The next line containsn numbers, the heights h_i of the n stacks. You may assume  and .

The total number of bricks will be divisible by the number of stacks. Thus, it is always possible to rearrange the bricks such that all stacks have the same height.

The input is terminated by a set starting with n = 0. This set should not be processed.

Output 

For each set, first print the number of the set, as shown in the sample output. Then print the line `` The minimum number of moves isk.'', where k is the minimum number of bricks that have to be moved in order to make all the stacks the same height.

Output a blank line after each set.

Sample Input 

65 2 4 1 7 50

Sample Output 

Set #1The minimum number of moves is 5.

---

解题报告

看着小伙伴在刷题，手痒痒就看了这题，原来是大水题。。。

直接计算一下输入的和，然后求平均，只要大于平均的数减去平均数相加就是答案，结果可能数组开小了，RE，开大一点，就WA了，小伙伴说是有空行，就AC了。。。

#include<stdio.h>int main(){    int a,i=0,j,x[100],n,max;    while(++i)    {        max=0;        a=0;        scanf("%d",&n);        if(n==0)break;        for(j=0;j<n;j++)        {            scanf("%d",&x[j]);            max+=x[j];        }        for(j=0;j<n;j++)        {            if(x[j]>(max/n))            {                a=a+x[j]-(max/n);            }        }        printf("Set #%d\nThe minimum number of moves is %d.\n\n",i,a);    }    return 0;}