HDU 1326 Box of Bricks
来源:互联网 发布:js table 高度 编辑:程序博客网 时间:2024/05/20 13:09
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.#include<stdio.h>int a[50];int main(){int n,i,j=1,num;double s;while(scanf("%d",&n)!=EOF&&n){s=0;num=0;for(i=0;i<n;i++){scanf("%d",&a[i]);s+=a[i];}s=s*1.0/n;for(i=0;i<n;i++)if(a[i]>s)num+=a[i]-s;printf("Set #%d\nThe minimum number of moves is %d.\n",j,num);j++;printf("\n");}return 0;}
0 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 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
- 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
- hdoj 1326 Box of Bricks
- hd 1326 Box of Bricks
- JPEG 原理详细实例分析及其在嵌入式 Linux 中的应用
- ubuntu 中安装 hadoop 记录
- Xen虚拟机修改root密码
- RequireJS - 简介
- string
- HDU 1326 Box of Bricks
- 在LCD19264 中任意位置画一条直线,或者删除一条直线
- RequireJS - 用法
- Java 快速交换 位操作的应用
- Yii视图renderpartial不能渲染css的问题
- 2011 蓝桥杯 购物计划 【初赛试题】
- LeetCode 089 Gray Code
- test process for a project
- Design Pattern—— Dynamic Proxy Pattern(二) 动态代理模式