【02NOIP提高组】均分纸牌

#include<bits/stdc++.h>
using namespace std;
const int maxn=;
int n,sum,a[maxn];
int main()
{
    int i,j,step=;
    cin>>n;
    for(i=;i<=n;i++)scanf("%d",&a[i]),sum+=a[i];
    sum/=n;
    for(i=;i<=n;i++) a[i]-=sum;
    i=;
    while(i<n&&a[i]==) i++;
    j=n;
    while(j>&&a[j]==) j--;
    while(i<j)
    {a[i+]+=a[i];
        a[i]=;

        step++;
        i++;
        while(a[i]==&&i<j) i++;
    }
    printf("%d",step);
    return ;
}