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
#include<bits/stdc++.h>
using namespace std;
#define int long long

void solve() {
	int n; cin >> n;
	vector<int> a(n + 1);
	for(int i = 1; i <= n; i++) cin >> a[i];
	int sum = accumulate(a.begin(), a.end(), 0ll);
	for(int i = n; i >= 1; i--) {
		if(sum % i == 0) {
			vector<int> pre(n + 2);
			bool flag = 0;
			for(int j = 1; j <= n; j++) {
				pre[j] += pre[j - 1];
				if(pre[j] > a[j]) { flag = 1; break; }
				if(j + i > n + 1) {
					if(pre[j] != a[j]) { flag = 1; break; }
				} else { pre[j + i] -= a[j] - pre[j]; pre[j] = a[j]; }
			}
			if(flag) continue;
			cout << i << '\n'; return;
		}
	}
}

signed main() {
	ios::sync_with_stdio(false);
	ios_base::sync_with_stdio(false);
	cin.tie(0), cout.tie(0);
	// For Problem with file IO
	// #ifndef CPH
	//   freopen(".in", "r", stdin);
	//   freopen(".out", "w", stdout);
	// #endif
	int t = 1;
	// cin >> t;
	while(t--) {
		solve();
	}
	return 0;
}