#include<iostream>
using namespace std;
int main()
{
    int n,a[10000],k=0,sum=0,t=0,i;
    while(cin>>n&&n!=0)
    {
        k++;
        sum=0;
        t=0;
        for( i=0;i<n;i++)
        {
            cin>>a[i];
            sum+=a[i];
        }
        for(i=0;i<n;i++)
        {
            if(a[i]>sum/n)
            t+=a[i]-sum/n;
        }
        cout<<"Set #"<<k<<endl;
        cout<<"The minimum number of moves is "<<t<<"."<<endl;
    }
    return 0;
}

• Re:为什么PE？求解…… (543) heijiaotuan 2012-07-06 18:31:37
  • Re:为什么PE？求解…… (10) AB38017032 2012-07-30 19:56:25