Luogu P1031 card sharing solution to a problem

table of Contents

answer

Ado, directly on the problem solution

answer

#include<iostream>
#include<cstdio>
#include<iomanip>
#include<cstring>
#include<cmath>
#include<string>
#include<cstdlib>
#include<queue>
#include<map>
#include<set>
#include<ctime>
#include<algorithm>
using namespace std; 
int a[10010],n,sum=0,x=0,to1=0;
int main(){
    cin>>n;
    for(int i=1;i<=n;i++){
       cin>>a[i];
       sum+=a[i];
    }
    x=sum/n;
    for(int i=1;i<=n;i++) a[i]=a[i]-x;
    for(int i=1;i<=n;i++){
        if(a[i]==0) continue;
        a[i+1]=a[i]+a[i+1];
        to1++;
    }
    cout<<to1;
    return 0;
}

Original website: P1031 sharing Solitaire

Published 14 original articles · won praise 8 · views 1152

Guess you like

Origin blog.csdn.net/Horse_Lake/article/details/105148684