poj 1477(超级水题)

题意：把不同高度的stack搬运平均，求最小搬砖的数。

#include<stdio.h>#include<stdlib.h>int main(){    int n,a[55];    int numb = 0;    while(scanf("%d",&n) != EOF && n != 0)    {        int sum = 0;        numb++;        for(int i = 0;i < n; i++)        {            scanf("%d",&a[i]);            sum += a[i];        }        printf("Set #%d\n",numb);        int average = 0;        average = sum/n;        int step = 0;        for(int i = 0;i < n; i++)        {            if(a[i] < average)                step += abs(average - a[i]);        }        printf("The minimum number of moves is %d.\n\n",step);    }    return 0;}