HDU 1326 Box of Bricks(水题)
来源:互联网 发布:网络用语沙发啥意思 编辑:程序博客网 时间:2024/05/29 15:29
Box of Bricks
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6377 Accepted Submission(s): 2774
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
AC代码:
#include<iostream>#include<cstdlib>#include<cstdio>#include<cmath>#include<cstring>#include<string>#include<cstdlib>#include<iomanip>#include<algorithm>typedef long long LL;using namespace std;int main(){ int n; int a[101]; int m=1; while(cin>>n){if(n==0)break;int sum=0;for(int i=0;i<n;i++){scanf("%d",&a[i]);sum+=a[i];}int avg,ans=0;avg=sum/n;for(int i=0;i<n;i++){if(a[i]>avg){ans+=(a[i]-avg);} } cout<<"Set #"<<m++<<endl<<"The minimum number of moves is "<<ans<<"."<<endl<<endl;} return 0;}
1 0
- 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
- HDU 1326 Box of Bricks
- HDU 1326 Box of Bricks
- hdu 1326 Box of Bricks
- HDU Box of Bricks
- POJ 1477 && HDU 1326 Box of Bricks(水~)
- hdu-oj 1326 Box of Bricks
- hdu 2088 Box of Bricks(water~)
- 水题 Box of Bricks
- HDU 2088 Box of Bricks
- HDU 2088 Box of Bricks
- hdu 2088 Box of Bricks
- HDU#2088: Box of Bricks
- HDU 2088 Box of Bricks
- c++对象的引用
- 4568: [Scoi2016]幸运数字 倍增+线性基
- Unix环境高级编程——守护进程记录总结(从基础到实现)
- 剑指offer-面试题60:把二叉树打印成多行
- 平衡二叉树旋转原理(图示)
- HDU 1326 Box of Bricks(水题)
- 设计模式——适配器模式
- Android:通过build gradle中的buildTypes设置自动log开关(一)
- 成员变量vs局部变量
- HDU 2874 LCA转RMQ+并查集
- eclipse恢复已删除的文件
- 第一步:在IDEA中导入kafka源代码
- yugong-mysql查看表字段和主键约束
- 4569: [Scoi2016]萌萌哒 倍增+并查集