Submission #6701563

---

Source Code Expand

//#pragma GCC optimize("O3")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,tune=native")
//#pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using ld = long double;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int n, k;
    cin >> n >> k;
    vector<ll> a(n);
    ll tot = 0;
    for (int i = 0; i < n; i++) {
        cin >> a[i];
        tot += a[i];
    }
    ll ans = 1;
    vector<ll> d;
    for (ll i = 1; i * i <= tot; i++) {
        if (tot % i == 0) {
            d.push_back(i);
            if (i != tot / i) {
                d.push_back(tot / i);
            }
        }
    }
    for (ll i : d) {
        vector<pair<ll, ll>> b(n);
        ll sum = 0;
        for (int j = 0; j < n; j++) {
            b[j].first = a[j] % i;
            b[j].second = (i - b[j].first) % i;
            sum += b[j].second;
        }
        sort(b.begin(), b.end());
        ll kek = 0;
        for (int j = 0; j < n; j++) {
            kek += b[j].first;
            sum -= b[j].second;
            if (kek >= sum) {
                break;
            }
        }
        if (max(kek, sum) <= k) {
            ans = max(ans, i);
        }
    }
    cout << ans;
    return 0;
}

Submission Info

Judge Result