AC的呆呆马

#include<bits/stdc++.h>

using namespace std;

int card[105];

int main()
{
	int n;
	cin >> n;
	int cardSum = 0;
	for(int i = 0; i < n; ++i)
	{
		cin >> card[i];
		cardSum += card[i]; 
	}
	int avg = cardSum / n;
	int res = 0;
	for(int i = 0; i < n - 1; ++i)
	{
		if(card[i] < avg)
		{
			card[i + 1] -= (avg - card[i]);
			res++;
		}
		if(card[i] > avg)
		{
			card[i + 1] += (card[i] - avg);
			res++;
		}
	}
	cout << res << endl;

	return 0;
}

可AC

#include <bits/stdc++.h>
using namespace std;
int ppp[10005],n,sum=0,average;
int main(){
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>ppp[i];
		average+=ppp[i];
	}
	average/=n;
	for(int i=0;i<n-1;i++){
		if(ppp[i]!=average){
			ppp[i+1]+=ppp[i]-average;
			sum++;
		}
	}
	cout<<sum;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
int a[105],sum,cnt;
int main(int argc, char **argv){
	int n;
	cin >> n;
	for (int i = 0;i < n;i++){
		cin >> a[i];
		sum += a[i];
	}
	int pj = sum / n;
	for (int i = 0;i < n;i++){
		if (a[i] < pj){
			a[i + 1] -= pj - a[i];
			a[i] = pj;
			cnt++;
		}
		if (a[i] > pj){
			a[i + 1] += a[i] - pj;
			a[i] = pj;
			cnt++;
		}
	}
	cout << cnt;
	return 0;
}

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
using namespace std;

int n,p,cnt,ans;
double plusn;
int arr[100];


int main(){
	cin >> n;
	for(int i = 0;i < n;i++){
		cin >> arr[i];
		plusn += arr[i];
	}
	p = plusn / n;
	for(int i = 0;i < n - 1;i++){
		if(arr[i] > p){
			arr[i + 1] -= (p - arr[i]);
			ans += 1;
		}
		if(arr[i] < p)
		{
			arr[i + 1] -= (p - arr[i]);
			ans++;
		}
	}
	cout << ans;
	return 0;
}