Box of Bricks
来源:互联网 发布:2016年8月非农数据信息 编辑:程序博客网 时间:2024/05/22 04:57
Problem Description
Little Bob likes playing with his box of bricks. He puts the bricks one upon another and builds stacks of different height. “Look, I\'ve built a wall!”, he tells his older sister Alice. “Nah, you should make all stacks the same height. Then you would have a real wall.”, she retorts. After a little consideration, Bob sees that she is right. So he sets out to rearrange the bricks, one by one, such that all stacks are the same height afterwards. But since Bob is lazy he wants to do this with the minimum number of bricks moved. Can you help?
Input
The input consists of several data sets. Each set begins with a line containing the number n of stacks Bob has built. The next line contains n numbers, the heights hi of the n stacks. You may assume 1≤n≤50 and 1≤hi≤100.
The total number of bricks will be divisible by the number of stacks. Thus, it is always possible to 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.
The total number of bricks will be divisible by the number of stacks. Thus, it is always possible to 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, print the minimum number of bricks that have to be moved in order to make all the stacks the same height.
Output a blank line between each set.
Sample Input
65 2 4 1 7 50
Sample Output
Set #1The minimum number of moves is 5
======================================================================
#include<stdio.h>#include<math.h>int main(){ int i,j,n,sum,ave,a[120]; for(j=1;;j++) { scanf("%d",&n); if(n==0) break; else { sum=0; for(i=0;i<n;i++) { scanf("%d",&a[i]); sum+=a[i]; } ave=sum/n; int huan=0; for(i=0;i<n;i++) { huan+=abs((ave-a[i]));//注意算法 } printf("Set #%d\n",j); printf("The minimum number of moves is %d.\n\n",huan/2); } } return 0;}
0 0
- Box of Bricks
- 1477 Box of Bricks
- 1477:Box of Bricks
- 1477 Box of Bricks
- 591 - Box of Bricks
- HDOJ1326 Box of Bricks
- HDU1326:Box of Bricks
- 591 - Box of Bricks
- 591 - Box of Bricks
- UVA591- Box of Bricks
- BNU Box of Bricks
- Box of Bricks
- hdu1326 Box of Bricks
- Box of Bricks
- Box of Bricks
- Box of Bricks
- Box of Bricks
- Box of Bricks
- java中的取模运算
- webview上传图片
- macos/unix下x264开发
- onConfigurationChanged
- hadoop distcp
- Box of Bricks
- SVC入门知识和JSVM基础实验
- HDU 1026 Ignatius and the Princess I
- Freemarker定义宏的用法
- Activity 总结
- MapReduce的自定义排序
- C++常用术语及其英文翻译的含义和简单用途总结(四)
- HDU 1233 首字母变大写
- uva725 Division