235092026-01-24 09:54:14BoldizsárKövek (100 pont)cpp17Wrong answer 25/10025ms756 KiB
// Source: https://usaco.guide/general/io

#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(prefkovek[i]/i != (prefkovek[n]-prefkovek[i])/n-i && prefkovek[i]/i != sum/n) ans++;
    }
    cout << ans;
}
SubtaskSumTestVerdictTimeMemory
base25/100
1Accepted0/01ms508 KiB
2Wrong answer0/025ms756 KiB
3Accepted5/51ms316 KiB
4Accepted5/51ms316 KiB
5Wrong answer0/51ms316 KiB
6Accepted5/51ms316 KiB
7Accepted5/51ms316 KiB
8Accepted5/51ms316 KiB
9Wrong answer0/71ms316 KiB
10Wrong answer0/71ms316 KiB
11Wrong answer0/81ms508 KiB
12Wrong answer0/81ms316 KiB
13Wrong answer0/82ms316 KiB
14Wrong answer0/83ms316 KiB
15Wrong answer0/89ms560 KiB
16Wrong answer0/823ms748 KiB
17Wrong answer0/825ms564 KiB