zoukankan      html  css  js  c++  java
  • Hdu 1326 Box of Bricks

    Box of Bricks

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
    Total Submission(s): 7651    Accepted Submission(s): 3347

    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<iostream>
    #include<math.h> 
    using namespace std;   
    int main()
    { 
       int n,ave,sum;
       int s[51];
       int i;
       int count=0;
       while(cin>>n,n)
       {
        ave=sum=0;
        for(i=0;i<n;i++)
     {
      cin>>s[i];
      ave+=s[i];
     }
     ave/=n;
        for(i=0;i<n;i++)
      sum+=abs(s[i]-ave);
     sum/=2;
     cout<<"Set #"<<++count<<endl;
     cout<<"The minimum number of moves is "<<sum<<"."<<endl<<endl; //万恶的格式。   }
        return 0; 
    }
    

      

  • 相关阅读:
    java计算组合数
    编写一个方法,使用以上算法生成指定数目(比如1000个)的随机整数
    不用static,巧用对象.方法调用java中的函数
    主函数调用相同函数名的小知识
    poj 3608 旋转卡壳求不相交凸包最近距离;
    UVa1453或La4728 凸包+枚举(或旋转卡壳)
    hdu4666 最远曼哈顿距离
    poj2926 曼哈顿最远距离
    poj 2187 凸包加旋转卡壳算法
    UVa 10256 凸包简单应用
  • 原文地址:https://www.cnblogs.com/zhangliu/p/7058011.html
Copyright © 2011-2022 走看看