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
74
75
76
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;


bool isPossible(vector<int>& nums, int k) {
    vector<int> fixed (nums.size() + 1, 0);
    int current = 0;
    for (int i = 0; i < nums.size(); i++) {
        current += fixed[i];
        int needed = nums[i] - current;

        if (needed < 0) {
            return false;
        }
        if (needed > 0) {
            if (i + k > nums.size()) {
                return false;
            }
            current += needed;
            fixed[i + k] -= needed;
        }
    }
    return true;
}

void Solve(int n, vector<int>& nums) {
    long long sum = 0;
    for (int i = 0; i < n; i++) {
        sum += nums[i];
    }

    vector<int> divs;
    for (size_t i = 1; i * i < sum + 1; i++) {
        if (sum % i == 0) {
            if (i <= n) {
                divs.push_back(i);
            }
            if (sum / i <= n) {
                divs.push_back(sum / i);
            }
        }
    }

    sort(divs.begin(), divs.end());
    reverse(divs.begin(), divs.end());

    for (int x: divs) {
        if (isPossible(nums, x)) {
            cout << x;
            return;
        }
    }

    cout << "NIE";


}

int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);

    int n; 
    cin >> n;

    vector<int> nums (n);
    for (int i = 0; i < n; i++) {
        cin >> nums[i];
    }

    Solve(n, nums);

}