Submission #73088593

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a),E##i=(b);i<=E##i;i++)
#define REV(i,a,b) for(int i=(a),E##i=(b);i>=E##i;i--)
#define CLOSE_TIE ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define psbk push_back
#define endl '\n'
template <typename T>
void _outval(string s,int p,const T &t) {cout<<s.substr(p,s.length()-p)<<'='<<t<<endl; }
template <typename T, typename... Args>
void _outval(string s,int p,const T &t,const Args &...rest){
    string n=""; while(s[p]!=',') n+=s[p++]; cout<<n<<'='<<t<<", ";
    _outval(s,p+1,rest...);
}
#define outval(...) _outval(#__VA_ARGS__,0,__VA_ARGS__)
#define outarr(a,be,ed)\
{cout<<(#a)<<": ";\
FOR(iiii,be,ed)cout<<'['<<iiii<<"]="<<a[iiii]<<", "; cout<<endl;}
const int N=3e5+5;
int n;
ll a[N],sum,mx;
map<ll,int> mp;
int main(){
//    freopen("in.txt","r",stdin);
    CLOSE_TIE
    cin>>n;
    FOR(i,1,n){
        cin>>a[i];
        sum+=a[i],mx=max(mx,a[i]);
        ++mp[a[i]];
    }
    vector<ll> d;
    for(ll i=1;i*i<=sum;i++){
        if(sum%i==0){
            d.psbk(i);
            if(i*i<sum) d.psbk(sum/i);
        }
    }
    sort(d.begin(),d.end());
    for(ll x:d){
        bool fl=1;
        if(mx>x) continue;
        FOR(i,1,n)
            if(a[i]!=x)
                if(mp[x-a[i]]!=mp[a[i]]){fl=0; break;}
        if(fl) cout<<x<<' ';
    }
    return 0;
}

Submission Info

Judge Result