POJ 1477 还是水!
来源:互联网 发布:winhex手工提取数据 编辑:程序博客网 时间:2024/05/01 17:40
Box of Bricks
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 11720 Accepted: 5008
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.
AC:Memory: 176K Time: 0MS
#include<stdio.h>int main(){int n,i,ave,move[51],sum,m=0;while(scanf("%d",&n)==1,n){sum=0;for(i=0;i<n;i++){scanf("%d",&move[i]);sum+=move[i];}ave=sum/n;sum=0;for(i=0;i<n;i++)if(ave<move[i])sum+=move[i]-ave;printf("Set #%d\n",++m);printf("The minimum number of moves is %d.\n\n",sum);}return 0;}
Output a blank line after each set . 居然没看见这句,郁闷了一个PE,以后要小心了。。
- POJ 1477 还是水!
- poj 3258 还是二分
- poj 2114 还是点分治
- POJ 3624 还是01背包
- POJ 1233 还是畅通工程
- poj 2243 bfs(还是骑士移动)
- poj 1847 Dijakstra 还是低级错误
- poj 1862 还是哈夫曼思想贪心
- poj 3613(还是不懂,以后再看看)
- 山还是山 水还是水
- poj 2318 TOYS--点在直线左侧还是右侧
- POJ 1053 Integer Inquiry (大数加法,还是Java大法好)
- POJ 2389 Bull Math(大数乘法,还是Java好)
- 一杯水,还是一片湖?
- poj 1477(超级水题)
- 见山还是山,见水还是水,见程序还是程序
- poj 1477
- POJ-1477
- C++ 多重继承与虚继承
- java枚举案例
- Spring中使用JavaMail
- strncpy和strcpy的用法区别
- 1 Introduction
- POJ 1477 还是水!
- Oracle 导出/导入命令备份/学习
- C#.net关于生成html静态页面的问题 .
- vc中读取wav文件的时长和文件播放的几种方式
- 苹果CEO史蒂夫·乔布斯在斯坦福演讲(一)
- 背黑锅
- 苹果CEO史蒂夫·乔布斯在斯坦福演讲中英文对照(二)
- C# asp.net字符串加密解密
- 推荐一些计算机视觉相关的书籍