UVA 591 Box of Bricks
2015-09-09 18:40
513 查看
Description
![](http://uva.onlinejudge.org/components/com_onlinejudge/images/button_pdf.png)
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?
![](http://7xjob4.com1.z0.glb.clouddn.com/36cb263fdb021efd46747a0417884a9e)
![](http://7xjob4.com1.z0.glb.clouddn.com/7dd9f99a66fd536fcfe46b2c37b1b96d)
and
![](http://7xjob4.com1.z0.glb.clouddn.com/971291c9d39151ffd0574a5d18f708b4)
.
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 same height.
Output a blank line after each set.
Miguel A. Revilla
1998-03-10
答案:
![](http://uva.onlinejudge.org/components/com_onlinejudge/images/button_pdf.png)
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 containsn numbers, the heights hi of the n stacks. You may assumeand
.
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 isk.'', where k is the minimum number of bricks that have to be moved in order to make all the stacksthe 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.
Miguel A. Revilla
1998-03-10
答案:
#include <iostream> #include <stdio.h> using namespace std; int main () { int n, term = 0, count = 0; int sum[55] = {0}; while (scanf("%d", &n) != EOF && n) { count = 0; int temp = 0; term++; printf("Set #%d\n", term); for (int i = 0; i < n; i++) { scanf("%d", &sum[i]); temp = temp + sum[i]; } int t; t = temp / n; for (int i = 0; i < n; i++) { if (sum[i] > t) count = sum[i] - t + count; } printf("The minimum number of moves is %d.\n", count); printf("\n"); } return 0; }
相关文章推荐
- duplicate symbol _OBJC_CLASS 错误处理方法
- 【CCCF专题】深度学习在自然语言处理中的应用
- 将图片转成base64 小工具
- C/C++ 指针数组、二维数组
- IOS设置button 图片 文字 上下、左右
- C++ inline weak symbol and so on
- java 数据结构一 之栈
- 关于Cassandra的错误观点
- Extjs 学习(一) 选择器
- Sequential Monte Carlo Methods
- 结队编程的好与坏
- wxWidgets显示视频
- 黑马程序员_java04_单例设计模式
- 今天会用了正则表达式
- java生成二维码
- 李航博士的《浅谈我对机器学习的理解》 机器学习与自然语言处理
- 简单工厂模式
- iOS-runtime-根据协议名调某一个类有与协议里面放的相同的方法
- WebStorm 的使用(一)
- Windows Server 2016 技术预览 Hyper-V 新特性