UVA 591 (暑假-数学 -D - Box of Bricks)
来源:互联网 发布:konect类似软件 编辑:程序博客网 时间:2024/05/16 12:01
Box of Bricks
Little Bob likes playing with his box of bricks. He puts the bricks one upon another and buildsstacks of different height. ``Look, I've built a wall!'', he tells his older sister Alice. ``Nah, you shouldmake 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 allstacks are the same height afterwards. But since Bob is lazy he wants to do this with the minimumnumber of bricks moved. Can you help?
Input
The input consists of several data sets. Each set begins with a line containing the numbern of stacksBob has built. The next line contains n numbers, the heightshi of the n stacks. You may assumeand.The total number of bricks will be divisible by the number of stacks. Thus, it is always possibleto 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 isk.'', where k is the minimum number of bricks thathave to be moved in order to make all the stacks the same height.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.
#include <cstdio>int main() {int n, m = 0;while (scanf("%d", &n) && n) {int arr[100];int sum = 0;for (int i = 0; i < n; i++) {scanf("%d", &arr[i]);sum += arr[i];}int average = sum / n;int count = 0;for (int i = 0; i < n; i++) {if (arr[i] > average)count += arr[i] - average;}printf("Set #%d\nThe minimum number of moves is %d.\n\n", ++m, count);}return 0;}
Box of Bricks
Little Bob likes playing with his box of bricks. He puts the bricks one upon another and buildsstacks of different height. ``Look, I've built a wall!'', he tells his older sister Alice. ``Nah, you shouldmake 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 allstacks are the same height afterwards. But since Bob is lazy he wants to do this with the minimumnumber of bricks moved. Can you help?
Input
The input consists of several data sets. Each set begins with a line containing the numbern of stacksBob has built. The next line contains n numbers, the heightshi of the n stacks. You may assumeand.The total number of bricks will be divisible by the number of stacks. Thus, it is always possibleto 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 isk.'', where k is the minimum number of bricks thathave to be moved in order to make all the stacks the same height.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.
#include <cstdio>int main() {int n, m = 0;while (scanf("%d", &n) && n) {int arr[100];int sum = 0;for (int i = 0; i < n; i++) {scanf("%d", &arr[i]);sum += arr[i];}int average = sum / n;int count = 0;for (int i = 0; i < n; i++) {if (arr[i] > average)count += arr[i] - average;}printf("Set #%d\nThe minimum number of moves is %d.\n\n", ++m, count);}return 0;}
- UVA 591 (暑假-数学 -D - Box of Bricks)
- UVA 591 - Box of Bricks(数学)
- 数学D - Box of Bricks
- UVa 591 - Box of Bricks
- uva 591 - Box of Bricks
- Uva 591 - Box of Bricks
- uva 591 Box of Bricks
- uva 591 - Box of Bricks
- UVa 591 - Box of Bricks
- UVA 591 - Box of Bricks
- uva 591Box of Bricks
- UVa 591 - Box of Bricks
- UVA 591 Box of Bricks
- uva 591 - Box of Bricks
- uva 591 Box of Bricks
- UVa 591 - Box of Bricks
- UVA 591 Box of Bricks
- UVa 591 - Box of Bricks
- 关于C#多态性的一点认识
- Hibernate主键生成策略
- Android中的回调Callback
- OC导航器部分代码
- PHP简单表单
- UVA 591 (暑假-数学 -D - Box of Bricks)
- Linode之使用UE实现SSH连接
- [android] Intent的setFlags
- [POJ 1204]Word Puzzles(Trie树暴搜&AC自动机)
- 林毅夫、张维迎先生之争让人失望
- halcon中通过字体确定图片的位姿的例子
- 简单易学的机器学习算法——Rosenblatt感知机的对偶解法
- UVA 107 (暑假-数学 -E - The Cat in the Hat)
- Android动画之弹球落地效果