248592026-02-16 08:17:23pirosmacska10Kövek (100 pont)cpp17Accepted 100/1008ms1016 KiB
#include <iostream>
#include <vector>
#include <string>
#include <map>
#include <set>
#include <algorithm>
#include <cmath>
#include <queue>
#include <stack>
#include <climits>
using namespace std;

using ll = long long;
const int MOD = 1e9 + 7;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n;
    cin >> n;
    vector<int> nums(n);
    int summ = 0;
    for(int i = 0; i < n; i++) {
        cin >> nums[i];
        summ += nums[i];
    }
    int avg = summ / n;

    int ans = 0;
    ll run = 0;
    for(int i = 0; i < n; i++) {
        run += nums[i]-avg;
        if(run != 0) ans++;
    }
    
    cout << ans;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
base100/100
1Accepted0/01ms508 KiB
2Accepted0/08ms1016 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms508 KiB
8Accepted5/51ms508 KiB
9Accepted7/71ms316 KiB
10Accepted7/71ms316 KiB
11Accepted8/81ms316 KiB
12Accepted8/81ms316 KiB
13Accepted8/81ms316 KiB
14Accepted8/82ms316 KiB
15Accepted8/84ms564 KiB
16Accepted8/88ms748 KiB
17Accepted8/88ms820 KiB