PE了一次,我明明看到了每个cas后面要blankline,低级错误不能犯
move is _ “。”有句号...对这种小坑比较敏感了已经
题意就是给若干个blocks堆问最少移动多少个blocks能够让这堆 等高
直接求和除个数求出每堆应该有多少,减一下当前的除以2就好
#include <bits/stdc++.h>
using namespace std;
int n;
void Gao()
{
int a[100];
int sum=0;
for (int i=0;i<n;i++)
{
cin>>a[i];
sum+=a[i];
}
sum/=n;
int ans=0;
for (int i=0;i<n;i++)
ans+=abs(sum-a[i]);
printf("The minimum number of moves is %d.\n",ans/2);
}
int main()
{
int cas=1;
// freopen("a.in","r",stdin);
while (cin>>n &&n )
{
cout<<"Set #"<<cas++<<endl;
Gao();
cout<<endl;
}
return 0;
}