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
60
61
62
63
64
65
66
67
68
69
70
71
72
73
#include <bits/stdc++.h>
using namespace std;
bool check(int64_t len, const vector<int64_t> t)
{
    int n = t.size();
    vector<int64_t> op(n);
    int64_t allop = 0;
    for (int i = 0; i < n; i++)
    {
        op[i] = t[i] - allop;
        if (op[i] < 0)
        {
            return false;
        }
        allop += op[i];
        if (i - len >= -1)
        {
            allop -= op[i - len + 1];
        }
    }
    return allop == 0;
}
int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int n;
    cin >> n;
    vector<int64_t> t(n);
    int64_t bursum = 0;
    for (int i = 0; i < n; i++)
    {
        cin >> t[i];
        bursum += t[i];
    }

    vector<int64_t> kand;
    for (int64_t i = 1; i * i <= bursum; i++)
    {
        if (bursum % i == 0)
        {
            kand.push_back(i);
            kand.push_back(bursum / i);
        }
    }
    sort(kand.begin(), kand.end());
    int64_t result = 1;
    vector<int64_t> kernel;
    for (int i = 0; i < kand.size(); i++)
    {
        bool to_skip = 0;
        for (auto wr : kernel)
        {
            if (kand[i] % wr == 0)
            {
                to_skip = 1;
            }
        }
        if (to_skip)
        {
            continue;
        }
        if (check(kand[i], t))
        {
            result = max(result, kand[i]);
        }
        else if (kernel.size() < 100)
        {
            kernel.push_back(kand[i]);
        }
    }
    cout << result << "\n";
}