UVa 591 - Box of Bricks
2012-07-24 21:16
381 查看
水题!
看懂题马上就能写出来。
看懂题马上就能写出来。
#include<iostream> using namespace std; int main() { int T=1, n, i, sum; int a[60]; while(cin >> n, n) { sum=0; int ct=0; for (i=0; i<n; i++) { cin >> a[i]; sum+=a[i]; } sum/=n; for (i=0; i<n; i++) { if (a[i] > sum) ct+=a[i]-sum; } cout << "Set #" << T << endl << "The minimum number of moves is " << ct << "." << endl << endl; T++; } return 0; }
相关文章推荐
- UVA 591 - Box of Bricks(数学)
- UVA - 591 Box of Bricks (水题)
- UVA 591 (暑假-数学 -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 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 591 - Box of Bricks
- uva 591 - Box of Bricks
- UVA 591 Box of Bricks