HDU 1326 Box of Bricks

原创 2016年08月04日 16:34:22

Box of Bricks


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.
 

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.
 

Sample Input
6 5 2 4 1 7 5 0
 

Sample Output
Set #1 The minimum number of moves is 5.

题意:给出初始的一排砖块摞,求出要想让他们等高需要移动至少多少个砖块。

首先这里所有的砖块不一定是摞数的整数倍,所以求出整型平均值,把剩下的多余砖块先加入到最后需要移动总数中,因为那些确定是要必须移开的。最后找出比平均值少的摞还需要多少砖块才能填平,就是最后填补需要移动的总数。

#include<stdio.h>
#include<string.h>
int main()
{
    int t,n,i,j,sum;
    int e=0,a[100];
    while(~scanf("%d",&t)&&t)
    {
        e++;
        printf("Set #%d\n",e);
        sum=0;
        for(i=0;i<t;i++)
        {
            scanf("%d",&a[i]);
            sum+=a[i];
        }
        int ev=sum/t;
        sum=sum-ev*t;
        for(i=0;i<t;i++)
        {
            if(a[i]<ev)
            sum+=ev-a[i];
        }
        printf("The minimum number of moves is %d.\n",sum);
        printf("\n");
    }
    return 0;
}


版权声明:本文为博主原创文章,未经博主允许不得转载。

HDU1326_Box of Bricks【水题】

题目大意:给你N堆砖块的高度,为了使N堆砖块的高度已知,需要把高的堆上的 砖块移到低的堆上,问最少需要移多少块砖。 思路:计算出总共的砖块数,在求出N堆砖的平均高度(即需要达到的最终高度),把 高的堆...
  • u011676797
  • u011676797
  • 2014年11月21日 19:51
  • 1086

hdu 1326 Box of Bricks

import java.util.Scanner; /** * Box of Bricks * */ public class Main{ public static void main(S...
  • Lutte_
  • Lutte_
  • 2017年04月20日 16:04
  • 100

HDU 1326 Box of Bricks

/* 中文题目 中文翻译-大意 题目大意: 解题思路: 难点详解: 关键点: 解题人: 解题时间: 解题体会: */ Box of Bricks Time ...
  • qq_16767427
  • qq_16767427
  • 2014年08月25日 20:23
  • 359

HDU 1326 Box of Bricks

Problem Description Little Bob likes playing with his box of bricks. He puts the bricks one upon ...
  • u013776243
  • u013776243
  • 2014年03月20日 20:27
  • 239

HDU 1326 Box of Bricks(数学题)

HDU 1326 Box of Bricks(数学题)
  • u012860063
  • u012860063
  • 2014年09月06日 09:44
  • 986

HDU 1326 Box of Bricks(水题)

Box of Bricks Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) ...
  • liangzhaoyang1
  • liangzhaoyang1
  • 2016年05月02日 20:22
  • 365

水题 ~ HDU 1326 Box of Bricks

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submissio...
  • RocketBoyc
  • RocketBoyc
  • 2016年11月14日 18:47
  • 124

HDU—— 2088 Box of Bricks

题意:Bob有一些砖,他用来摆成N个栈,每个栈的高度不一样,现在他需要将这些栈的高度变成一样,求他最少的移动次数。 解题思路:求出平均值,然后将那些高出平均值的栈高度与平均值作差,将所有差相加既得结...
  • u014086857
  • u014086857
  • 2014年12月05日 20:39
  • 350

hdoj 1326 Box of Bricks

题目链接 只要求出大于均值或者小于均值的大小即可,注意可以使用求和函数accumulate,输出格式也要注意,水题。 #include #include using namespace std; ...
  • flyupliu
  • flyupliu
  • 2013年11月20日 09:52
  • 437

hd 1326 Box of Bricks

题目就是说:求出移动最少的砖块 先要输出这是第几次,然后输出个数,最后还要空一行。 先求全部的砖块。然后取平均值。 再求各个砖块和平均值的差的总和。就是最少移动的砖块。...
  • lhn1599085
  • lhn1599085
  • 2015年04月20日 19:43
  • 136
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1326 Box of Bricks
举报原因:
原因补充:

(最多只允许输入30个字)