杭电 HDU ACM 1326 Box of Bricks
来源:互联网 发布:eviews软件中文版下载 编辑:程序博客网 时间:2024/05/19 23:25
Box of Bricks
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5457 Accepted Submission(s): 2358
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 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 Europe 1997
似曾相识啊!求平均数。
#include<iostream>using namespace std;int main(){int n,aver;int ls[52];int s=0;while(cin>>n,n){s++;int sum=0;for(int i=0;i<n;i++){cin>>ls[i];sum+=ls[i];}aver=sum/n; int count=0;for(int j=0;j<n;j++){if(ls[j]>aver)count+=ls[j]-aver;}cout<<"Set #"<<s<<endl;cout<<"The minimum number of moves is "<<count<<"."<<endl<<endl;;}return 0;}
0 0
- 杭电 HDU ACM 1326 Box of Bricks
- 杭电 acm Box of Bricks
- 杭电1326-Box of Bricks
- HDU ACM 11 2088 Box of Bricks
- HDU 1326 Box of Bricks
- HDU 1326 Box of Bricks
- HDU 1326 Box of Bricks
- HDU 1326 Box of Bricks
- hdu 1326 Box of Bricks
- 杭电 2088 Box of Bricks
- 杭电oj-Box of Bricks
- HDU Box of Bricks
- 航电ACM step1.2.3 Box of bricks
- hdu-oj 1326 Box of Bricks
- HDU 1326 Box of Bricks(数学题)
- HDU 1326 Box of Bricks(水题)
- 水题 ~ HDU 1326 Box of Bricks
- HDU 2088 Box of Bricks
- Java 8 时间日期库的20个使用示例
- T001_UT001_0010
- 多个非常有用的Java程序片段-常用java示例-常用示例-范例-公共方法-公用方法
- [信息论]Huffman编码的JAVA实现
- 6
- 杭电 HDU ACM 1326 Box of Bricks
- GitHub生成密钥
- T001_UT001_0011
- Soft Skills 读书笔记 2—重新给自己定位
- 黑马程序员----JAVA中各种容器的区别和方法
- Java不同压缩算法的性能比较-java压缩算法
- Intent属性详解
- Spring概况
- T001_UT001_0012