poj 1477 Box of Bricks
2012-06-06 16:10
344 查看
//这题只是让你求给出的数的平均数即可!再通过续一比较,不够平均数的就从多于平均数中补上! #include <iostream> using namespace std; int num[55]; int main() { int n, i, tc = 0, sum, avg, ans; while (cin >> n) { if (n == 0) break; tc++; sum = ans = 0; for (i = 0; i < n; i++) { cin >> num[i]; sum += num[i]; } avg = sum / n; for (i = 0; i < n; i++) { if (num[i] > avg) ans += num[i] - avg; } cout << "Set #" << tc << endl << "The minimum number of moves is " << ans << "." << endl << endl; } system("pause"); }
相关文章推荐
- poj 1477 Box of Bricks
- poj1477 box of bricks
- POJ 1477 && HDU 1326 Box of Bricks(水~)
- poj 1477 Box of Bricks
- (贪心5.2.8)POJ 1477 Box of Bricks
- POJ 1477 Box of Bricks
- POJ 1477 Box of Bricks
- pku 1477 Box of Bricks
- PKU 1477 Box of Bricks
- 1477 Box of Bricks
- AOJ-AHU-OJ-12 Box of Bricks
- HDOJ1326 Box of Bricks
- HDU 2088 Box of Bricks
- U-Box of Bricks
- HOJ 1599-------Box of Bricks
- Uva 591 - Box of Bricks
- 杭电 HDU ACM 1326 Box of Bricks
- UVA 591 Box of Bricks
- uva 591 - Box of Bricks
- HDU ACM 11 2088 Box of Bricks