Submission #1174977

---

Source Code Expand

#include <stdio.h>
#include <string>
#include <iostream>
#include <math.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <functional>
#include <sstream>
#include <set>
#include <map>
#include <complex>
#include <deque>
#include <cstdio>
#include <cstdlib>
#include <time.h>

using namespace std;

#define inf 999999999
#define ll long long
#define sort(a,n) sort(a,a+n)
#define fi  first
#define se second
#define pb(a) push_back(a)
#define time clock()

const ll MOD = 1000000007;
const double PI = 3.141592653589793238;

//--------------------------------------------------------------------------------------------//
int n;
int a[100];
int main() {
	cin >> n;
	int sum = 0;
	for (int i = 0; i < n; i++) {
		cin >> a[i];
		sum += a[i];
	}
		//clock_t start = time;
	if (sum%n != 0) {
		cout << -1 << endl;
		return 0;
	}
	int one = (int)sum / n;
	int ans = 0;
	int amari = 0;
	for (int i = 0; i <= n - 2; i++) {
		if (a[i] < one) {
			if (amari == one - a[i]) {
				amari = 0;
			}
			else {
				amari -= (one - a[i]);
				ans++;
			}
		}
		else if (a[i] > one) {
			amari += a[i] - one;
			if (amari != 0) { ans++; }
		}
		else {
			if (amari != 0) {
				ans++;
			}
		}
	}
	cout<<ans<<endl;
	//clock_t end = time;
	//cout << (double)(end - start) / CLOCKS_PER_SEC << endl;
}

Submission Info

Judge Result