Submission #73070122

---

Source Code Expand

import sys
from collections import Counter
input = lambda: sys.stdin.readline().rstrip()
ii = lambda: int(input())
mii = lambda: map(int, input().split())
lii = lambda: list(mii())
MOD = 10**9+7
inf = 1<<64
def solve():
    n = ii()
    a = lii()
    a.sort()
    cnt = Counter(a)
    ans = set()
    s = sum(a)
    mx = max(a)
    for m in range((n + 1) // 2, n + 1):
        if s%m!=0:
            continue
        k = s//m
        if k<mx:
            continue
        x = 2*m-n
        if x < 0:
            continue
        if cnt.get(k, 0) < x:
            continue
        l, r = 0,n - 1
        cn = 0
        ok = True
        while l < r:
            while cn<x and a[l] == k:
                l += 1
                cn += 1
                if l >= r:
                    break
            if l >= r:
                break
            while cn < x and a[r] == k:
                r -= 1
                cn += 1
                if l >= r:
                    break
            if l >= r:
                break
            if a[l] + a[r] != k:
                ok = False
                break
            l += 1
            r -= 1
        if ok:
            ans.add(k)
    ans = sorted(ans)
    print(*ans)
t = 1
# t = ii()
for _ in range(t):
    solve()

Submission Info

Judge Result