15 2021. 01. 07 21:35:17 mraron Kövek (100 pont) cpp11 Accepted 100/100 21ms 3928 KiB 
#include <iostream>
#include <vector>
using namespace std;

int main() {
  int n;
  cin >> n;
  vector<int> k(n);
  long long int sum = 0;
  for (int i = 0; i < n; i++) {
    cin >> k[i];
    sum += k[i];
  }
  int avg = sum / n;
  sum = 0;
  int moves = 0;
  for (int i = 0; i < n; i++) {
    sum += k[i];
    if (sum != avg * (i+1)) {
      moves++;
    }
  }
  cout << moves << endl;
  return 0;
}
Subtask Sum Test Verdict Time Memory
base 100/100
1 Accepted 0/0 2ms 1736 KiB
2 Accepted 0/0 21ms 2960 KiB
3 Accepted 5/5 1ms 2228 KiB
4 Accepted 5/5 1ms 2224 KiB
5 Accepted 5/5 1ms 2228 KiB
6 Accepted 5/5 1ms 2232 KiB
7 Accepted 5/5 1ms 2232 KiB
8 Accepted 5/5 1ms 2240 KiB
9 Accepted 7/7 1ms 2244 KiB
10 Accepted 7/7 1ms 2248 KiB
11 Accepted 8/8 1ms 2252 KiB
12 Accepted 8/8 1ms 2248 KiB
13 Accepted 8/8 2ms 2272 KiB
14 Accepted 8/8 3ms 2312 KiB
15 Accepted 8/8 8ms 2664 KiB
16 Accepted 8/8 21ms 3216 KiB
17 Accepted 8/8 21ms 3928 KiB