uva 591 Box of Bricks
2013-05-13 22:05
411 查看
#include<iostream> #include<cmath> using namespace std; int a[60],n; int main() { int num=1; while(cin>>n&&n) { int sum=0; for(int i=0; i<n; i++) { cin>>a[i]; sum+=a[i]; } int ave=sum/n,count=0; for(int i=0;i<n;i++) if(a[i]>ave) count+=a[i]-ave; cout<<"Set #"<<num++<<endl<<"The minimum number of moves is "<<count<<"."<<endl<<endl; } return 0; }
相关文章推荐
- uva 591 Box of Bricks
- UVa 591 - Box of Bricks
- 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(求平均值)
- UVA591- 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