POJ 1477:Box of Bricks
来源:互联网 发布:淘宝卖手机壳怎么买 编辑:程序博客网 时间:2024/06/05 08:07
Box of Bricks
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 19949 Accepted: 8029
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.
Source
Southwestern European Regional Contest 1997
你 离 开 了 , 我 的 世 界 里 只 剩 下 雨 。 。 。
#include <stdio.h>int main(){ int n,i,s,aver,a[51],num,j=0; while(~scanf("%d", &n)) { if(n == 0) break; j++,s = 0,num = 0; for(i = 0; i < n; i++) { scanf("%d", &a[i]); s+=a[i]; } aver= s/n; for(i = 0; i < n; i++) if(a[i] > aver) num = num + a[i] - aver; printf("Set #%d\nThe minimum number of moves is %d.\n\n", j, num); } return 0;}
1 0
- poj 1477 Box of Bricks
- POJ 1477 Box of Bricks
- poj 1477 Box of Bricks
- POJ 1477:Box of Bricks
- POJ——1477 Box of Bricks
- POJ 1477 Box of Bricks G++
- 1477 Box of Bricks
- 1477:Box of Bricks
- 1477 Box of Bricks
- (贪心5.2.8)POJ 1477 Box of Bricks
- POJ 1477 && HDU 1326 Box of Bricks(水~)
- pku 1477 Box of Bricks
- PKU 1477 Box of Bricks
- Box of Bricks
- 591 - Box of Bricks
- HDOJ1326 Box of Bricks
- HDU1326:Box of Bricks
- 591 - Box of Bricks
- PHP 正则表达式
- Implicit super constructor xx() is undefined for default constructor. Must define an explicit constr
- android *** Activity 03
- JavaScript_Date
- C++的重载、覆盖和隐藏
- POJ 1477:Box of Bricks
- 理论: 博弈4 :威佐夫博奕(Wythoff Game)
- 面试题总结-阿里神马和通联数据(算法)
- Emacs学习笔记
- hash 1
- 测试一下使用word写博客
- 人海中寻找,真的遇到你——Spring @ responsebody
- 支持向量机通俗导论(理解SVM的三层境界)
- FPGA BCD计数器(一位)