591 - Box of Bricks
2013-06-21 14:13
295 查看
Box of Bricks |
Input
The input consists of several data sets. Each set begins with a line containing the numbern of stacksBob has built. The next line contains
n numbers, the heights
h
i of the
n stacks. You may assume
and
.
The total number of bricks will be divisible by the number of stacks. Thus, it is always possibleto rearrange the bricks such that all stacks have the same height.
The input is terminated by a set starting with n = 0. This set should not be processed.
Output
For each set, first print the number of the set, as shown in the sample output. Then print the line``The minimum number of moves is
k.'', where
k is the minimum number of bricks thathave to be moved in order to make all the stacks the same height.
Output a blank line after each set.
Sample Input
6 5 2 4 1 7 5 0
Sample Output
Set #1 The minimum number of moves is 5.
#include<stdio.h> int main(void) { int n,i,count=1; while(scanf("%d",&n)&&n) { int h,k=0,sum=0,a[100]={0}; for(i=0;i<n;i++) {scanf("%d",&a[i]);sum+=a[i];} h=sum/n; for(i=0;i<n;i++) if(a[i]>h) k+=a[i]-h; printf("Set #%d\nThe minimum number of moves is %d.\n\n",count++,k); } return 0; }
相关文章推荐
- UVa 591 - Box of Bricks
- UVA 591 Box of Bricks
- UVA - 591 Box of Bricks
- UVA - 591 Box of Bricks
- UVa 591-Box of Bricks
- uva 591 Box of Bricks
- uva 591 - Box of Bricks
- 591 - Box of Bricks
- UVa 591 - Box of Bricks
- UVa 591 - Box of Bricks
- UVA 591 Box of Bricks
- uva 591 - Box of Bricks
- uva 591 - Box of Bricks
- uva 591 - Box of Bricks
- UVa 591 - Box of Bricks
- uva 591 Box of Bricks
- UVA 591 - Box of Bricks
- uva 591 Box of Bricks
- UVa 591 Box of Bricks
- UVA - 591 Box of Bricks