/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 532.0 KiB
#2 Wrong Answer 1ms 764.0 KiB
#3 Wrong Answer 1ms 532.0 KiB

Code

#define _GLIBCXX_FILESYSTEM
#include<bits/stdc++.h>
using namespace std;
#define ll long long


void solve() {
    int n;
    cin >> n;
    vector<int> a(n);
    for(int i = 0; i < n; i++) cin >> a[i];
    sort(a.begin(), a.end());
    int mx = 1;
    for(int b = 2; b <= n; b++) {
        if(n % b == 0) {
            bool v = true;
            int nb = n / b;
            int d = a[b - 1] - a[0];
            for(int i = 0; i < nb; i++) {
                int s = i * b;
                int e = s + b - 1;
                if (a[e] - a[s] != d) {
                    v = false;
                    break;
                }
            }
            if (v) mx = max(mx, nb);
        }
    }
    cout << mx << '\n';
    return;
}

int32_t main() {
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int tc = 1;
    cin >> tc;
    for(int kase = 1; kase <= tc; kase++) {
        //cout << "Case " << kase << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1162 Roy and Maximum Partition
Contest
Brain Booster #8
Language
C++17 (G++ 13.2.0)
Submit At
2025-02-17 16:45:00
Judged At
2025-02-17 16:45:00
Judged By
Score
0
Total Time
1ms
Peak Memory
764.0 KiB