uva 591 (Box of Bricks)

Algorithm used : Ad hoc

#include < stdio.h >
int main(){
int i,j,k[200],sum,avg,a,b=0,sum1;
freopen("in.txt","r",stdin);
while(scanf("%d",&i)==1 && i!=0){
    b++;
    sum=0;
    sum1=0;
for(j=0;j < i;j++){
scanf("%d",&k[j]);
sum=sum+k[j];

}
avg=sum/i;
for(j=0;j < i;j++){
if(avg>k[j]){
    a=avg-k[j];
sum1=sum1+a;}
}
printf("Set #%d\n",b);
printf("The minimum number of moves is %d.\n",sum1);
printf("\n");
}

return 0;

}

Tagged: 591, box, brick, help, hint, solution, uva