uva-591注意空行

#include<iostream>
using namespace std;
int n,t,ans[110],sum,sum1;
int main()
{
    t=1;
    while(cin>>n&&n)
    {
        sum=0,sum1=0;
        for(int i=0;i<n;i++)
        {
            cin>>ans[i];
            sum+=ans[i];
        }
        sum/=n;
        for(int i=0;i<n;i++)
        {
            sum1+=(ans[i]-sum)>0?(ans[i]-sum):(sum-ans[i]);
        }
        cout<<"Set #"<<t++<<endl;
        cout<<"The minimum number of moves is "<<sum1/2<<"."<<endl<<endl;
    }
}