1477.txt

北大ACM题目例程 详细的解答过程 程序实现 算法分析

#define debug 0
#include<stdio.h>
#include<string.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>

#define INF 30000
#define NMAX 61
int h[NMAX],n,t;
void solve()
{
	int sum=0;
	for(int i=0;i<n;i++)
	{
		scanf("%d",&h[i]);
		sum+=h[i];
	}
	int aver=sum/n;
	sum=0;
	for(i=0;i<n;i++)
	{
		if(aver>h[i])
			sum+=aver-h[i];
	}
	printf("Set #%d\nThe minimum number of moves is %d.\n\n",t,sum);

}
int main()
{

#if debug 	
	freopen("in.txt","r",stdin);
	freopen("out.txt","w",stdout);
#endif
	scanf("%d",&n);
	t=1;
	while(n)
	{
		
		solve();
		t++;

		scanf("%d",&n);
	}
#if debug
	fclose(stdin);
	fclose(stdout);
#endif
	return 1;
}