1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
#define _CRT_SECURE_NO_WARNINGS

#include<cstdio>
#include<vector>

using namespace std;

#define N 100005
long long dane[N];

bool czy_rozwiazanie(long long k, long long n) {
    vector<long long> starts(N, 0);
    long long active_blocks = 0;

    for (long long i = 0; i < n; ++i) {
        if (i >= k) {
            active_blocks -= starts[i - k];
        }

        long long needed = dane[i] - active_blocks;
        if (needed < 0) {
            return false;
        }

        if (needed > 0) {
            if (i + k > n) {
                return false;
            }
            starts[i] = needed;
            active_blocks += needed;
        }
    }

    return true;
}

int main() {
    long long n;
    long long suma = 0L;
    scanf("%lld", &n);

    for (int i = 0; i < n; i++) {
        scanf("%lld", &dane[i]);
        suma += dane[i];
    }

    for (long long k = n; k >= 2; k--) {
        if (suma % k == 0) {
            if (czy_rozwiazanie(k, n)) {
                printf("%lld\n", k);
                return 0;
            }
            
        }
    }

    printf("1\n");
    return 0;
}