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
#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <set>
#include <cmath>
#include <string>
#include <queue>
#include <numeric>
using namespace std;

using ll = long long;


int main() {
    int n;
    cin >> n;
    vector<int> v(n), sub(n);
    auto ok = [&](int t) {
        int cur = 0;
        for (int i = 0; i < n; i++) {
            cur -= sub[i];
            sub[i] = 0;
            int add = v[i] - cur;
            if (add < 0) {
                return false;
            }
            cur += add;
            if (i + t - 1 < n) {
                sub[i+t] = add;
            } else if (add > 0) {
                return false;
            }
        }
        return true;
    };
    ll total = 0;
    for (int &i : v) {
        cin >> i;
        total += i;
    }
    int res = 1;
    for (int i = n; i > 1; i--) {
        if (total % i == 0 && ok(i)) {
            res = i;
            break;
        }
    }
    cout << res << endl;
    return 0;
}