197902025-12-22 20:48:03GergoszaboKövek (100 pont)cpp17Accepted 100/10027ms1568 KiB
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using ll = long long;
using namespace std;

int main() {
	ll n; cin >> n;
    vector<ll> v(n);
    ll sum = 0;
    for (ll i = 0; i < n; i++){
        cin >> v[i];
        sum += v[i];
    }
    ll ave = sum / n;
    ll flow = 0, moves = 0;
    for (ll i = 0; i < n; i++){
        v[i] -= ave;
        flow += v[i];
        if (flow != 0) moves++;
    }
    cout << moves;
}
SubtaskSumTestVerdictTimeMemory
base100/100
1Accepted0/01ms316 KiB
2Accepted0/026ms1076 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms360 KiB
7Accepted5/51ms316 KiB
8Accepted5/51ms404 KiB
9Accepted7/71ms332 KiB
10Accepted7/71ms500 KiB
11Accepted8/81ms628 KiB
12Accepted8/81ms316 KiB
13Accepted8/82ms508 KiB
14Accepted8/83ms472 KiB
15Accepted8/89ms696 KiB
16Accepted8/823ms1368 KiB
17Accepted8/827ms1568 KiB