235122026-01-24 10:01:02BoldizsárKövek (100 pont)cpp17Accepted 100/10025ms564 KiB
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n;cin >> n;int sum =0,ans = 0;
    vector<int>prefkovek(n+1);
    for(int i = 1;i <= n;i++) {cin >> prefkovek[i];sum+=prefkovek[i];prefkovek[i]=sum;}
    for(int i = 1;i <= n;i++){
        if(double((prefkovek[n]-prefkovek[i]))/double((n-i)) != sum/n && double(prefkovek[i])/double(i) != sum/n) ans++;
    }
    cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base100/100
1Accepted0/01ms316 KiB
2Accepted0/025ms564 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms508 KiB
5Accepted5/51ms316 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms508 KiB
8Accepted5/51ms316 KiB
9Accepted7/71ms500 KiB
10Accepted7/71ms316 KiB
11Accepted8/81ms316 KiB
12Accepted8/81ms384 KiB
13Accepted8/82ms344 KiB
14Accepted8/83ms316 KiB
15Accepted8/88ms556 KiB
16Accepted8/821ms564 KiB
17Accepted8/825ms564 KiB