Submission #73091933

Source Code Expand

n = int(input())
a = tuple(map(int,input().split()))
suma = sum(a)
a = sorted(a)
ans = []
count = 0

if n % 2 == 0:
    s = n //2
else:
    s = n // 2 + 1

for i in range(s,n+1):
    flag = True
    if suma % i != 0:
        continue
    riko = suma // i
    if riko < a[-1]:
        continue

    for j in range(n-2*(n-i)):
        if a[-j] != riko:
            break
    for k in range(n-i):
        #print(k)
        #print(n,i)
        if a[k] + a[(n-1)-(n-2*(n-i))-k] != riko:
            flag = False
            break
            
    if flag:
        ans.append(riko)
ans = sorted(ans)
print(*ans)

Submission Info

Submission Time
Task C - AtCoder Riko
User hayahaya11
Language Python (PyPy 3.11-v7.3.20)
Score 350
Code Size 640 Byte
Status AC
Exec Time 147 ms
Memory 159976 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 350 / 350
Status
AC × 3
AC × 22
Set Name Test Cases
Sample 0_sample_1.txt, 0_sample_2.txt, 0_sample_3.txt
All 0_sample_1.txt, 0_sample_2.txt, 0_sample_3.txt, 1_1.txt, 1_2.txt, 1_3.txt, 1_4.txt, 1_5.txt, 2_1.txt, 2_2.txt, 2_3.txt, 2_4.txt, 3_1.txt, 3_2.txt, 3_3.txt, 3_4.txt, 3_5.txt, 3_6.txt, 4_1.txt, 4_2.txt, 4_3.txt, 4_4.txt
Case Name Status Exec Time Memory
0_sample_1.txt AC 52 ms 79868 KiB
0_sample_2.txt AC 52 ms 79720 KiB
0_sample_3.txt AC 52 ms 79600 KiB
1_1.txt AC 141 ms 158944 KiB
1_2.txt AC 139 ms 153348 KiB
1_3.txt AC 137 ms 156200 KiB
1_4.txt AC 138 ms 156764 KiB
1_5.txt AC 138 ms 155984 KiB
2_1.txt AC 146 ms 154416 KiB
2_2.txt AC 145 ms 154476 KiB
2_3.txt AC 145 ms 159976 KiB
2_4.txt AC 144 ms 159256 KiB
3_1.txt AC 147 ms 157784 KiB
3_2.txt AC 147 ms 157632 KiB
3_3.txt AC 147 ms 154448 KiB
3_4.txt AC 130 ms 154008 KiB
3_5.txt AC 52 ms 79884 KiB
3_6.txt AC 141 ms 154616 KiB
4_1.txt AC 97 ms 159920 KiB
4_2.txt AC 115 ms 156652 KiB
4_3.txt AC 52 ms 79832 KiB
4_4.txt AC 52 ms 79932 KiB