水题一道,不过和UVA的11300搞混了
#include"stdio.h"
#define MAX 100000
int a[MAX] = {0};
int main(void)
{
int n,m,i,sum,ans,ix = 1;
while((scanf("%d",&n)) == 1 && n)
{
sum = 0;
ans = 0;
for( i = 0 ; i < n ; i ++ )
{
scanf("%d",a + i);
sum += a[i];
}
m = sum / n;
for( i = 0 ; i < n ; i ++ )
{
if(a[i] < m)
{
ans += (m - a[i]);
}
}
printf("Set #%d\n",ix);
printf("The minimum number of moves is %d.\n\n",ans);
ix ++;
}
retu......
阅读全文