14 2021. 01. 07 21:17:36 mraron Kövek (100 pont) pascal Accepted 100/100 10ms 1628 KiB 
Program kovek;
  const maxn=100000;
  var n,db,kell: integer;
      s,i,j: integer;
      k: array[1..maxn] of integer;
begin
  readln(n); 
  for i:=1 to n do read(k[i]);
  readln;
  s:=0;
  for i:=1 to n do s:=s+k[i];
  kell:=s div n;
  db:=n; s:=0; j:=0;
  for i:=1 to n do
  begin
    s:=s+k[i];
    if s=(i-j)*kell then 
    begin
      dec(db); s:=0; j:=i;
    end;
  end;
  writeln(db);
end.
Subtask Sum Test Verdict Time Memory
base 100/100
1 Accepted 0/0 1ms 996 KiB
2 Accepted 0/0 10ms 1608 KiB
3 Accepted 5/5 1ms 1204 KiB
4 Accepted 5/5 1ms 1144 KiB
5 Accepted 5/5 1ms 1208 KiB
6 Accepted 5/5 1ms 1204 KiB
7 Accepted 5/5 1ms 1076 KiB
8 Accepted 5/5 1ms 1208 KiB
9 Accepted 7/7 1ms 1208 KiB
10 Accepted 7/7 1ms 1204 KiB
11 Accepted 8/8 1ms 1076 KiB
12 Accepted 8/8 1ms 1144 KiB
13 Accepted 8/8 1ms 1140 KiB
14 Accepted 8/8 2ms 1136 KiB
15 Accepted 8/8 4ms 1320 KiB
16 Accepted 8/8 9ms 1536 KiB
17 Accepted 8/8 10ms 1628 KiB