Box of Bricks

原创 2013年12月29日 20:15:49

水题一道。。无需多说。。一切尽在代码中。。

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 containsn numbers, the heights hi of the n stacks. You may assume $1 Ÿ\le n \leŸ 50$ and $1 \leŸ h_i Ÿ\le 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>
int main()
{
    int n, i, s, aver, a[51], num, j = 0;
    while(scanf("%d", &n)!=EOF)
    {
        if(n == 0) break;
        j++;
        s = 0;
        num = 0;
        for(i = 0; i < n; i++)
        {
            scanf("%d", &a[i]);
            s = 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;
}


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

相关文章推荐

HDU 2088 Box of Bricks

Box of Bricks Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) ...

HDU 1.2.2 Box of Bricks

Box of Bricks Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others...

水题 Box of Bricks

Box of Bricks Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Othe...

HDU 1326 Box of Bricks

平均值,整型计算

uva 591 Box of Bricks

uva 591 Box of Bricks 题目大意:把n堆砖移成相同高度需要移动多少块砖。 解题思路:先求平均值,再用比平均值大的数减去平均值, 所有差的和就是所求值。 #include ...

HDU1326:Box of Bricks

Problem Description Little Bob likes playing with his box of bricks. He puts the bricks one upon an...

AOJ-AHU-OJ-12 Box of Bricks

Box of Bricks Time Limit: 1000 ms   Case Time Limit: 1000 ms   Memory Limit: 64 MB   Description Lit...

UVA 591 Box of Bricks

Box of Bricks  Little Bob likes playing with his box of bricks. He puts the bricks one ...

591 - Box of Bricks

Box of Bricks  Little Bob likes playing with his box of bricks. He puts the bricks one upon anoth...
  • SIOFive
  • SIOFive
  • 2013年07月21日 18:32
  • 734

水题 ~ HDU 1326 Box of Bricks

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submissio...
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:Box of Bricks
举报原因:
原因补充:

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