hdu2088 Box of Bricks(C语言)
来源:互联网 发布:virtualbox mac好用么 编辑:程序博客网 时间:2024/05/15 16:22
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 consideration, 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, print the minimum number of bricks that have to be moved in order to make all the stacks the same height.
Output a blank line between each set.
Output a blank line between each set.
Sample Input
65 2 4 1 7 50
Sample Output
5
Author
qianneng
Source
冬练三九之二
C语言AC代码
#include<stdio.h>int main(){ int i,n,a[55],s,t=0,sum; while(scanf("%d",&n)&&n) { if(t) printf("\n"); for(i=0; i<n; i++) { scanf("%d",&a[i]); } s=0; for(i=0; i<n; i++) { s=s+a[i]; } s=s/n; sum=0; for(i=0; i<n; i++) { if(a[i]<s) sum=sum+(s-a[i]); } printf("%d\n",sum); t=1; } return 0;}思路:求出平均高度,低于平均高度的与平均高度的差值和就是最小值。
阅读全文
0 0
- hdu2088 Box of Bricks(C语言)
- hdu2088 Box of Bricks
- HDU2088 Box of Bricks
- HDU2088 Box of Bricks【水题】
- HDOJ 【C】 2088 Box of Bricks
- hdu 2088 Box of Bricks(water~)
- 问题七十:Box of Bricks (ACM)
- UVA 591 - Box of Bricks(数学)
- HDU 1326 Box of Bricks(数学题)
- Box of Bricks(南阳oj)
- UVA - 591 Box of Bricks (水题)
- HDU 1326 Box of Bricks(水题)
- Box of Bricks
- 1477 Box of Bricks
- 1477:Box of Bricks
- 1477 Box of Bricks
- 591 - Box of Bricks
- HDOJ1326 Box of Bricks
- 2017 07 18 小结
- pdo连接数据库
- 瞧瞧 这个男孩 都做了些什么!
- Redis与Memcache的区别和应用场景
- Python import 与 from import
- hdu2088 Box of Bricks(C语言)
- java在不同情况下锁对象探索
- 【技术贴】教你彻底解决Eclipse自动补全变量名的问题
- 简单的手绘板 利用bitmap缓存
- PDO常用方法及其应用
- 2017 07 19 小结
- 2017 07 20 小结
- hdu 1114 Pig-bank
- google Guava Cache使用