Box of Bricks
来源:互联网 发布:淘宝汉服睡衣店铺推荐 编辑:程序博客网 时间:2024/06/16 02:04
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 con- sideration, 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, 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 that have to be moved in order to make all the stacks the same height.
Output a blank line after each set.
Output a blank line after each set.
Sample Input
65 2 4 1 7 50
Sample Output
Set #1The minimum number of moves is 5.
最少的移动次数,就是把比平均数高的砖搬一下就好了,首先它们搬是必须的,其次别的砖搬只会增加移动次数。
#include <stdio.h> int main(void) { int n, i, sum, average, ans, ncases=0; int h[51]; while(scanf("%d", &n) && n!=0) { sum = ans = 0; ncases++; for(i=0; i<n; i++) { scanf("%d", &h[i]); sum += h[i]; } average = sum/n; for(i=0; i<n; i++) { if(h[i]>average) { ans += h[i]-average; } } printf("Set #%d/nThe minimum number of moves is %d./n/n", ncases, ans); } 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
- 【leetcode】387. First Unique Character in a String
- 表达式求值
- Linux运维笔记----shell基础命令
- 面试题8:找到旋转数组的最小值(java)
- 通过一个可以随机产生0和1的随机数生成产生0到n的随机数
- Box of Bricks
- 10个你能参与并学习的Java开源github项目
- error LNK2005 的处理
- 走遍欧洲 —— 阿尔卑斯(Alps)
- tableExport的快速上手及快速使用
- shell比较语法
- TQ210——交叉编译器的安装
- UITextField限制字数
- 设计模式-观察者模式