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
#include <bits/stdc++.h>
#define F(i, a, b) for(int i = (a); i <= (b); i++)
#define R(i, a, b) for(int i = (a); i >= (b); i--)
#define pb push_back
#define V vector
#define pii pair<int,int>
#define f first
#define s second
#define int long long
using namespace std;


int n;
int tab[1000009];
int kon[2000009];

bool czyok(int k){
    fill(kon, kon + n + 5, 0);

    int akt = 0;

    F(i, 1, n){
        akt -= kon[i];

        if(i <= n - k + 1){
            int ile = tab[i] - akt;
            if(ile < 0) return 0;

            akt += ile;
            kon[i + k] += ile;
        }
        else{
            if(akt != tab[i]) return 0;
        }
    }

    return 1;
}

int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);

    cin >> n;
    
    int sum = 0;

    F(i, 1, n){
        cin >> tab[i];
        sum += tab[i];
    }

    R(i, 100000, 1){
        if(sum % i == 0 && czyok(i)){
            cout << i;
            return 0;
        }
    }
}