zoj 1251 Box of Bricks
2012-03-17 16:28
351 查看
#include "iostream" using namespace std; int bricks[60]; int main() { int num, i, sum, average, count, n = 0; while (cin >> num && num) { sum = average = count = 0; n++; for (i = 0; i < num; i++) cin >> bricks[i]; for (i = 0; i < num; i++) sum += bricks[i]; average = sum / num; for (i = 0; i < num; i++) { if (bricks[i] > average) count += bricks[i] - average; } cout << "Set #" << n << endl; cout << "The minimum number of moves is " << count << "."<< endl; cout << endl; } }
相关文章推荐
- ZOJ Problem Set–1251 Box of Bricks
- ZOJ 1251 Box of Bricks
- zoj 1251 Box of Bricks
- ZOJ_1251_Box of Bricks
- zoj 1251 Box of Bricks
- zoj 1251 Box of Bricks
- ZOJ Problem Set - 1251 Box of Bricks
- 1251_Box of Bricks
- UVa 591 Box of Bricks
- HDU1326 Box of Bricks
- (贪心5.2.8)POJ 1477 Box of Bricks
- virtual hust 2013.6.23 数学杂题基础题目 F - Box of Bricks
- Box of Bricks
- POJ 1477 Box of Bricks
- U-Box of Bricks
- UVA - 591 Box of Bricks
- Box of Bricks
- 水题 Box of Bricks
- 591 - Box of Bricks
- 杭电1326-Box of Bricks