UVA 591 Box of Bricks
来源:互联网 发布:手机语音骂人软件 编辑:程序博客网 时间:2024/06/06 04:42
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 containsn numbers, the heights hi 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 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 stacks the same height.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.
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;}
- 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 591Box 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
- 黑马程序员_java04_单例设计模式
- leetcode笔记:Valid Sudoku
- Extjs 学习(一) 选择器
- java 数据结构一 之栈
- 结队编程的好与坏
- UVA 591 Box of Bricks
- 简单介绍一下HBase、Cassandra、Voldemort、Redis、VoltDB、MySQL
- duplicate symbol _OBJC_CLASS 错误处理方法
- 一个开始
- AsyncImageLoader,DisLruCache图片的异步加载,内存和硬盘存储,防止图片错位,从eoe看的
- Unity Attribute 总结
- 系统崩溃、重装后 Hyper-V 虚拟机配置的恢复
- 关于合伙企业
- Ext js学习笔记(二) 表格的创建