这是一道acm题,这是我的AC代码,可以参考参考。
#include <iostream>
using namespace std;
const int MAX =50;
int main()
{
int Bricks[MAX]={0};
int N;
long sum=0;
int average =0;
int j=1;
cin>>N;
while(N)
{
sum = 0;
average =0;
for(int i=0;i<N;i++)
{
cin>>Bricks[i];
sum+=Bricks[i];
}
average = sum/N;
sum =0;
for(int i =0;i<N;i++)
{
if(Bricks[i]>average)
sum+=Bricks[i]-average;
}
cout<<"Set #"<<j<<"/n";
cout<<"The minimum number of moves is "<<sum<<"."<<endl;
j++;
cin>>N;
}
return 0;
}