ZOJ 1251 : Box of Bricks

zoj_1251.c

#include <stdio.h>

int stack[50];
int width, i, height, sum, total_move, count = 1;

int main() {
	scanf("%d",&width);
	while (width != 0) {
		for (i = sum = 0; i < width; sum += stack[i++])
			scanf("%d",&stack[i]);
		height = sum / width;
		total_move = 0;
		for (i = 0; i < width; ++i) {
			if (stack[i] > height)
				total_move += (stack[i] - height);
		}
		printf("Set #%d\nThe minimum number of moves is %d.\n\n", count, total_move);
		count++;
		scanf("%d",&width);
	}
return 0;
}