s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time int64 0 100 | memory stringlengths 4 6 | code_size int64 15 14.7k | code stringlengths 15 14.7k | problem_id stringlengths 6 6 | problem_description stringlengths 358 9.83k | input stringlengths 2 4.87k | output stringclasses 807
values | __index_level_0__ int64 1.1k 1.22M |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s666047851 | p04021 | u729133443 | 1596613395 | Python | Python (3.8.2) | py | Accepted | 78 | 24060 | 64 | n,*a=map(int,open(0))
print(len({*a[::2]}^{*sorted(a)[::2]})//2) | p04021 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke got an integer sequence of length <var>N</var> from his mother, as a birthday present. The <var>i</var>-th <var>(1 ≦ i ≦ N)</var> element of the sequence is <var>a_i</var>. The elements are pairwi... | 4
2
4
3
1
| 1
| 1,200,971 |
s638077252 | p04021 | u606045429 | 1583985696 | Python | Python (3.4.3) | py | Accepted | 91 | 14196 | 72 | N, *A = map(int, open(0))
print(len(set(A[1::2]) & set(sorted(A)[::2]))) | p04021 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke got an integer sequence of length <var>N</var> from his mother, as a birthday present. The <var>i</var>-th <var>(1 ≦ i ≦ N)</var> element of the sequence is <var>a_i</var>. The elements are pairwi... | 4
2
4
3
1
| 1
| 1,200,972 |
s163209171 | p04021 | u899975427 | 1570243077 | Python | Python (3.4.3) | py | Accepted | 90 | 20452 | 83 | n,*a=map(int,open(0).read().split())
print(len(set(a[::2])^set(sorted(a)[::2]))//2) | p04021 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke got an integer sequence of length <var>N</var> from his mother, as a birthday present. The <var>i</var>-th <var>(1 ≦ i ≦ N)</var> element of the sequence is <var>a_i</var>. The elements are pairwi... | 4
2
4
3
1
| 1
| 1,200,973 |
s224847522 | p04021 | u670180528 | 1568076941 | Python | Python (3.4.3) | py | Accepted | 94 | 18292 | 68 | n,*a=map(int,open(0))
print(len(set(a[::2])^set(sorted(a)[::2]))//2) | p04021 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke got an integer sequence of length <var>N</var> from his mother, as a birthday present. The <var>i</var>-th <var>(1 ≦ i ≦ N)</var> element of the sequence is <var>a_i</var>. The elements are pairwi... | 4
2
4
3
1
| 1
| 1,200,974 |
s060200679 | p04021 | u077291787 | 1567068393 | Python | Python (3.4.3) | py | Accepted | 88 | 20964 | 456 | # AGC003C - BBuBBBlesort!
def main():
# reverse three elements <-> reverse left and right ones
# -> the parities of indices of A doesn't change
# find Ai which has different parities of indices in A and S
N, *A = map(int, open(0).read().split())
S = sorted(A)
dif = set(A[::2]) ^ set(S[::2])
... | p04021 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke got an integer sequence of length <var>N</var> from his mother, as a birthday present. The <var>i</var>-th <var>(1 ≦ i ≦ N)</var> element of the sequence is <var>a_i</var>. The elements are pairwi... | 4
2
4
3
1
| 1
| 1,200,975 |
s054552960 | p04021 | u077291787 | 1567068362 | Python | Python (3.4.3) | py | Accepted | 95 | 20964 | 456 | # AGC003C - BBuBBBlesort!
def main():
# reverse three elements <-> reverse left and right ones
# -> the parities of indices of A doesn't change
# find Ai which has different parities of indices in A and S
N, *A = map(int, open(0).read().split())
S = sorted(A)
dif = set(A[::2]) ^ set(S[::2])
... | p04021 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke got an integer sequence of length <var>N</var> from his mother, as a birthday present. The <var>i</var>-th <var>(1 ≦ i ≦ N)</var> element of the sequence is <var>a_i</var>. The elements are pairwi... | 4
2
4
3
1
| 1
| 1,200,976 |
s161378425 | p04021 | u077291787 | 1567067974 | Python | Python (3.4.3) | py | Accepted | 89 | 20964 | 215 | # AGC003C - BBuBBBlesort!
def main():
N, *A = map(int, open(0).read().split())
S = sorted(A)
dif = set(A[::2]) ^ set(S[::2])
ans = len(dif) // 2
print(ans)
if __name__ == "__main__":
main() | p04021 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke got an integer sequence of length <var>N</var> from his mother, as a birthday present. The <var>i</var>-th <var>(1 ≦ i ≦ N)</var> element of the sequence is <var>a_i</var>. The elements are pairwi... | 4
2
4
3
1
| 1
| 1,200,977 |
s623449307 | p04021 | u367130284 | 1560039691 | Python | Python (3.4.3) | py | Accepted | 88 | 20452 | 83 | n,*a=map(int,open(0).read().split());print(len(set(a[::2])^set(sorted(a)[::2]))//2) | p04021 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke got an integer sequence of length <var>N</var> from his mother, as a birthday present. The <var>i</var>-th <var>(1 ≦ i ≦ N)</var> element of the sequence is <var>a_i</var>. The elements are pairwi... | 4
2
4
3
1
| 1
| 1,200,978 |
s242980137 | p04021 | u785205215 | 1515078385 | Python | Python (3.4.3) | py | Accepted | 98 | 15324 | 937 | import math
import itertools
import heapq
from sys import stdin, stdout, setrecursionlimit
from bisect import bisect, bisect_left, bisect_right
from collections import defaultdict, deque
# d = defaultdict(lambda: 0)
# setrecursionlimit(10**7)
# inf = float("inf")
##### stdin ####
def LM(t, r): return list(map(t, r)... | p04021 | <span class="lang-en">
<p>Score : <var>600</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Snuke got an integer sequence of length <var>N</var> from his mother, as a birthday present. The <var>i</var>-th <var>(1 ≦ i ≦ N)</var> element of the sequence is <var>a_i</var>. The elements are pairwi... | 4
2
4
3
1
| 1
| 1,200,979 |
s031737889 | p04025 | u125545880 | 1601131382 | Python | Python (3.8.2) | py | Accepted | 30 | 9128 | 322 | def main():
N = int(input())
A = list(map(int, input().split()))
ans = float('inf')
for k in range(min(A), max(A)+1):
cost = 0
for a in A:
cost += (a-k)**2
ans = min(ans, cost)
if ans == 0:
break
print(ans)
if __name__ == "__main__":
main(... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,980 |
s636889104 | p04025 | u666550725 | 1601041241 | Python | PyPy3 (7.3.0) | py | Accepted | 66 | 64288 | 174 | N = int(input())
A = list(map(int, input().split()))
ans = 4000000
for a in range(-100, 101):
m = 0
for b in A:
m += (a - b) ** 2
if m < ans:
ans = m
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,981 |
s618453352 | p04025 | u536017058 | 1600968280 | Python | PyPy3 (7.3.0) | py | Accepted | 60 | 64012 | 201 | n=int(input())
a=list(map(int,input().split()))
amax, amin = max(a), min(a)
ans=5*10**6
for i in range(min(a), max(a)+1):
tmp=0
for j in range(n):
tmp+=(a[j]-i)**2
ans=min(tmp,ans)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,982 |
s460267429 | p04025 | u970267139 | 1600836421 | Python | Python (3.8.2) | py | Accepted | 38 | 9172 | 185 | n = int(input())
a = list(map(int, input().split()))
ans = 10**5 * n
for x in range(-100, 101):
tmp = 0
for ai in a:
tmp += (ai-x)**2
ans = min(tmp, ans)
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,983 |
s025068498 | p04025 | u896791216 | 1600358639 | Python | Python (3.8.2) | py | Accepted | 28 | 9104 | 238 | n = int(input())
a = list(map(int, input().split()))
avg_a = sum(a) // n
avg_b = avg_a + 1
total_one = 0
total_two = 0
for num in a:
total_one += (num - avg_a) ** 2
total_two += (num - avg_b) ** 2
print(min(total_one, total_two))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,984 |
s744686904 | p04025 | u306412379 | 1600303661 | Python | Python (3.8.2) | py | Accepted | 27 | 9124 | 201 | n = int(input())
aa = list(map(int, input().split()))
x = sum(aa) // len(aa)
cost1 = 0
cost2 = 0
for i in range(n):
cost1 += (x - aa[i])**2
cost2 += (x + 1 - aa[i])**2
print(min(cost1, cost2))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,985 |
s751369625 | p04025 | u762533651 | 1600211990 | Python | PyPy3 (7.3.0) | py | Accepted | 72 | 61700 | 411 | n = int(input())
x = sorted(list(map(int, input().split())), reverse = True)
x_2 = list(map(lambda x:x ** 2, x))
ichi = sum(x)
jijou = sum(x_2)
re = 10 ** 100
#def ji(p, x):
# ans = p * (p - 2 * x)
# return ans
for p in range(x[-1], x[0] + 1):
second = n * (p ** 2)
third = -2 * p * ichi
summ = jijo... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,986 |
s496016419 | p04025 | u583507988 | 1600106014 | Python | Python (3.8.2) | py | Accepted | 32 | 9016 | 124 | n=int(input())
a=list(map(int,input().split()))
s=sum(a)
m=round(s/n)
ans=0
for i in range(n):
ans+=(a[i]-m)**2
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,987 |
s452077712 | p04025 | u411923565 | 1600044374 | Python | Python (3.8.2) | py | Accepted | 29 | 9160 | 145 | #82 C - いっしょ
N = int(input())
A = list(map(int,input().split()))
X = round(sum(A)/N)
ans = 0
for a in A:
ans += (X-a)**2
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,988 |
s674376068 | p04025 | u855831834 | 1599931435 | Python | PyPy3 (7.3.0) | py | Accepted | 61 | 61940 | 212 | n = int(input())
A = list(map(int,input().split()))
p = sum(A)//n
q = p+1
r = p-1
ans = float("inf")
for x in [p,q,r]:
tmp = 0
for a in A:
tmp += (a-x)**2
ans = min(ans, tmp)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,989 |
s929691626 | p04025 | u843768197 | 1599916582 | Python | Python (3.8.2) | py | Accepted | 32 | 9116 | 218 | n = int(input())
a = list(map(int, input().split()))
med_l = int(sum(a)/n)
med_h = med_l + 1
sum_l = 0
sum_h = 0
for i in range(n):
sum_l += (med_l - a[i])**2
sum_h += (med_h - a[i])**2
print(min(sum_l, sum_h)) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,990 |
s730631747 | p04025 | u112007848 | 1599798769 | Python | Python (3.8.2) | py | Accepted | 29 | 9100 | 143 | import math
n=int(input())
a=list(map(int, input().split(" ")))
ave = round(sum(a)/len(a))
ans = 0
for i in a:
ans += (ave-i)** 2
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,991 |
s732300348 | p04025 | u531599639 | 1599788589 | Python | Python (3.8.2) | py | Accepted | 36 | 9136 | 172 | n = int(input())
a = list(map(int,input().split()))
ans = 10**9
for i in range(min(a),max(a)+1):
tmp = 0
for v in a:
tmp += (i-v)**2
ans = min(ans,tmp)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,992 |
s684608833 | p04025 | u896588506 | 1599767762 | Python | PyPy3 (7.3.0) | py | Accepted | 96 | 74624 | 509 | import bisect,collections,copy,itertools,math,string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
def main():
n = I()
... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,993 |
s798974621 | p04025 | u468972478 | 1599699881 | Python | Python (3.8.2) | py | Accepted | 35 | 9156 | 184 | import math
n = int(input())
a = sorted(map(int, input().split()))
ans = []
for i in range(a[0], a[-1] + 1):
c = 0
for j in a:
c += (j - i) ** 2
ans.append(c)
print(min(ans)) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,994 |
s389297023 | p04025 | u980205854 | 1599600214 | Python | PyPy3 (7.3.0) | py | Accepted | 84 | 68132 | 1,948 | import sys
from sys import exit
from collections import deque
from bisect import bisect_left, bisect_right, insort_left, insort_right #func(リスト,値)
from heapq import heapify, heappop, heappush
from itertools import product, permutations, combinations, combinations_with_replacement
from functools import reduce
from math ... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,995 |
s786828329 | p04025 | u536034761 | 1599513231 | Python | Python (3.8.2) | py | Accepted | 31 | 8980 | 133 | n = int(input())
A = list(map(int, input().split()))
ave = round(sum(A) / n)
ans = 0
for a in A:
ans += (a - ave) ** 2
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,996 |
s003876933 | p04025 | u230621983 | 1599450735 | Python | Python (3.8.2) | py | Accepted | 27 | 9076 | 403 | n, *a = map(int, open(0).read().split())
if sum(a) % n == 0:
avg = sum(a)//n
ans = 0
for e in a:
ans += (e - avg)**2
print(ans)
else:
avg = sum(a)//n + 1
avg2 = sum(a)//n - 1
avg3 = sum(a)//n
ans2 = 0
ans = 0
ans3 = 0
for e in a:
ans += (e - avg) ** 2
... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,997 |
s106735644 | p04025 | u624613992 | 1599450129 | Python | Python (3.8.2) | py | Accepted | 36 | 9060 | 201 | n = int(input())
a = list(map(int,input().split()))
ans = 1000000000000000
for i in range(min(a),max(a)+1):
ans_temp = 0
for j in a:
ans_temp += (i - j)**2
ans = min(ans,ans_temp)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,998 |
s719069192 | p04025 | u357751375 | 1599428156 | Python | Python (3.8.2) | py | Accepted | 34 | 9200 | 193 | n = int(input())
a = list(map(int,input().split()))
x = min(a)
y = max(a)
ans = 10 ** 12
for i in range(x,y+1):
m = 0
for j in a:
m += (j-i) ** 2
ans = min(ans,m)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,200,999 |
s838735855 | p04025 | u619557935 | 1599275384 | Python | Python (3.8.2) | py | Accepted | 35 | 9148 | 210 | n = int(input())
a = list(map(int, input().split()))
ans = 10000000000
for num in range(-100, 101):
kari_ans = 0
for _a in a:
kari_ans += (num - _a) ** 2
ans = min(ans, kari_ans)
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,000 |
s522954541 | p04025 | u361381049 | 1599240004 | Python | PyPy3 (7.3.0) | py | Accepted | 72 | 64640 | 184 | N = int(input())
a = list(map(int,input().split()))
ans = float('inf')
for i in range(-100,101):
cnt = 0
for j in a:
cnt += (i-j) ** 2
ans = min(ans,cnt)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,001 |
s049979493 | p04025 | u648315264 | 1598964146 | Python | Python (3.8.2) | py | Accepted | 37 | 9488 | 931 | import math
from math import gcd,pi,sqrt
INF = float("inf")
import sys
sys.setrecursionlimit(10**6)
import itertools
from collections import Counter,deque
def i_input(): return int(input())
def i_map(): return map(int, input().split())
def i_list(): return list(i_map())
def i_row(N): return [i_input() for _ in range(N... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,002 |
s356327645 | p04025 | u537962130 | 1598903814 | Python | PyPy3 (7.3.0) | py | Accepted | 64 | 65504 | 146 | n=int(input())
a=list(map(int,input().split()))
mn,mx=min(a),max(a)
m=10**9
for i in range(mn,mx+1):
m=min(m,sum([(t-i)**2 for t in a]))
print(m) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,003 |
s515638554 | p04025 | u973972117 | 1598830641 | Python | Python (3.8.2) | py | Accepted | 37 | 9108 | 243 | N=int(input())
A=list(map(int,input().split()))
Sum =0
for i in range(len(A)):
Sum += (A[0]-A[i])**2
Answer = Sum
for j in range(-100,101):
Sum =0
for k in range(len(A)):
Sum+= (A[k]-j)**2
Answer =min(Answer, Sum)
print(Answer)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,004 |
s269102398 | p04025 | u521271655 | 1598803108 | Python | Python (3.8.2) | py | Accepted | 34 | 9172 | 186 | n = int(input())
a = list(map(int,input().split()))
ans = float("inf")
for i in range(-100,101):
cnt = 0
for j in a:
cnt += (j - i)**2
ans = min(cnt,ans)
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,005 |
s666514797 | p04025 | u786150969 | 1598647181 | Python | Python (3.8.2) | py | Accepted | 28 | 9164 | 128 | N = int(input())
an = list(map(int,input().split()))
x = round(sum(an)/N)
ans = 0
for i in an:
ans += (x-i)*(x-i)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,006 |
s737255412 | p04025 | u349449706 | 1598582866 | Python | PyPy3 (7.3.0) | py | Accepted | 61 | 65296 | 116 | N=int(input())
a=list(map(int,input().split()))
print(min(sum((j-i)**2 for j in a)for i in range(min(a),max(a)+1)))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,007 |
s535231569 | p04025 | u222668979 | 1598494725 | Python | PyPy3 (7.3.0) | py | Accepted | 63 | 61936 | 176 | n = int(input())
a = list(map(int, input().split()))
ave = sum(a) // n
ans1 = sum((ai - ave)** 2 for ai in a)
ans2 = sum((ai - ave - 1)** 2 for ai in a)
print(min(ans1,ans2))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,008 |
s554421161 | p04025 | u488884575 | 1598490087 | Python | Python (3.8.2) | py | Accepted | 31 | 9408 | 264 | n=int(input())
a=list(map(int, input().split()))
from collections import Counter
c=Counter(a)
avr=sum(a)//n
c[avr]=0
if sum(a)%n!=0:
c[-(-sum(a)//n)]=0
ans = abs(max(a)-min(a))**n
for key in c:
res=0
for aa in a:
res+=(aa-key)**2
ans=min(ans,res)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,009 |
s010545856 | p04025 | u576335153 | 1598474478 | Python | Python (3.8.2) | py | Accepted | 34 | 9016 | 259 | n = int(input())
a = list(map(int, input().split()))
def cost(number):
res = 0
for x in a:
res += (x - number) ** 2
return res
ans = 1001001001
for i in range(-100, 101):
tmp = cost(i)
if tmp < ans:
ans = tmp
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,010 |
s728749148 | p04025 | u397496203 | 1598322153 | Python | PyPy3 (7.3.0) | py | Accepted | 70 | 64708 | 242 | # https://atcoder.jp/contests/arc059/tasks/arc059_a
n = int(input())
A = [int(i) for i in input().split()]
ans = 10**9 + 7
for i in range(-100, 101):
tmp = 0
for a in A:
tmp += (i - a)**2
ans = min(tmp, ans)
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,011 |
s108197771 | p04025 | u313890617 | 1598201178 | Python | Python (3.8.2) | py | Accepted | 26 | 9192 | 242 | def cost(x,a,b):
cost=0
for i in range(b):
cost+=(x-a[i])**2
return cost
n=int(input())
a=list(map(int,input().split()))
ans=0
for i in range(n):
ans+=a[i]
ans/=n
ans=int(ans)
print(min(cost(ans,a,n),cost(ans+1,a,n))) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,012 |
s861914809 | p04025 | u581403769 | 1598050928 | Python | Python (3.8.2) | py | Accepted | 27 | 9008 | 146 | n = int(input())
a = list(map(int, input().split()))
x = round(sum(a) / n)
ans = 0
for i in range(n):
ans += (a[i] - x) ** 2
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,013 |
s616855297 | p04025 | u626891113 | 1598040954 | Python | Python (3.8.2) | py | Accepted | 31 | 9032 | 277 | n = int(input())
a = list(map(int, input().split()))
mi = min(a)
ma = max(a)
if mi == ma:
print(0)
exit()
ans = 0
for i in a:
ans += (i - mi)**2
for i in range(mi + 1, ma + 1):
val = 0
for j in a:
val += (i - j)**2
ans = min(ans, val)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,014 |
s026594554 | p04025 | u124605948 | 1597872888 | Python | Python (3.8.2) | py | Accepted | 36 | 9132 | 244 | n = int(input())
A = list(map(int, input().split()))
ans = []
for num in range(101):
cost1, cost2 = 0, 0
for a in A:
cost1 += (a-num)**2
cost2 += (a-(-num))**2
ans.append(cost1)
ans.append(cost2)
print(min(ans)) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,015 |
s794680895 | p04025 | u697690147 | 1597634080 | Python | Python (3.8.2) | py | Accepted | 29 | 9168 | 142 | n = int(input())
a = list(map(int, input().split()))
mean = round(sum(a)/n)
cnt = 0
for i in range(n):
cnt += (a[i]-mean)**2
print(cnt) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,016 |
s998865513 | p04025 | u401487574 | 1597611258 | Python | Python (3.8.2) | py | Accepted | 37 | 9404 | 413 | a = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
import itertools
import heapq as hq
n = ni()
A = lma()
ans = 10**9
for i in range(-1... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,017 |
s611557328 | p04025 | u708255304 | 1597523791 | Python | Python (3.8.2) | py | Accepted | 42 | 8992 | 184 | N = int(input())
A = list(map(int, input().split()))
ans = 10**10
for i in range(-200, 201, 1):
tmp = 0
for a in A:
tmp += (a-i)**2
ans = min(ans, tmp)
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,018 |
s440423869 | p04025 | u388971072 | 1597458341 | Python | Python (3.8.2) | py | Accepted | 36 | 9140 | 197 | N = int(input())
A = list(map(int,input().split()))
ans = float('inf')
check = 0
for i in range(-100,100+1):
for j in A:
check +=(j-i)**2
ans = min(ans,check)
check=0
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,019 |
s389444556 | p04025 | u562015767 | 1597345162 | Python | Python (3.8.2) | py | Accepted | 27 | 9088 | 461 | import sys
n = int(input())
a = list(map(int,input().split()))
s = ((sum(a))//n)+1
t = sum(a)//n
u = ((sum(a))//n)-1
l = []
l.append(s)
l.append(t)
l.append(u)
ans = []
ans2 = []
aa = set(a)
if len(aa) == 1:
print(0)
sys.exit()
for j in range(len(l)):
ans = []
for i in range(n):
if a[i] == l[... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,020 |
s956419255 | p04025 | u970198631 | 1597175934 | Python | Python (3.8.2) | py | Accepted | 38 | 9144 | 220 | N = int(input())
AAA = map(int,input().split())
AA = list(AAA)
AA.sort()
mini = 10**7
x = AA[-1]
for i in range(AA[0],x+1):
total = 0
for j in AA:
total += (j-i)**2
if total < mini:
mini = total
print(mini) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,021 |
s175966893 | p04025 | u428199834 | 1597026984 | Python | Python (3.8.2) | py | Accepted | 30 | 9104 | 190 | n=int(input())
a=list(map(int,input().split()))
ave=sum(a)//n
ave_=ave+1
ans=0
ans_=0
for i in range(n):
ans+=(a[i]-ave)**2
for i in range(n):
ans_+=(a[i]-ave_)**2
print(min(ans,ans_)) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,022 |
s566064952 | p04025 | u860829879 | 1597014511 | Python | PyPy3 (7.3.0) | py | Accepted | 63 | 61836 | 137 | n=int(input())
a=list(map(int,input().split()))
mu=sum(a)//n
print(min(sum([(aa-mu)**2 for aa in a]),sum([(aa-mu-1)**2 for aa in a])))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,023 |
s766354773 | p04025 | u078349616 | 1596987879 | Python | Python (3.8.2) | py | Accepted | 37 | 8980 | 205 | N = int(input())
A = list(map(int, input().split()))
S = sum(A)
ans = float("INF")
for k in range(-100, 100+1):
tmp = 0
for a in A:
tmp += pow(a - k, 2)
ans = min(ans, tmp)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,024 |
s340760694 | p04025 | u425762225 | 1596952501 | Python | Python (3.8.2) | py | Accepted | 34 | 9196 | 399 | #!/usr/bin/env python3
# from numba import njit
# input = stdin.readline
INF = 10**9
# @njit
def solve(n,a):
ans = INF
k = min(a)
while k <= max(a):
ans = min(ans,sum((x-k)**2 for x in a))
k += 1
return ans
def main():
N = int(input())
# N,M = map(int,input().split())
a = list(map(int,input... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,025 |
s015920827 | p04025 | u212502386 | 1596770187 | Python | Python (3.8.2) | py | Accepted | 38 | 9188 | 192 | N=int(input())
A=list(map(int,input().split()))
ans=1000000
for i in range(min(A),max(A)+1):
cost=0
for x in range(len(A)):
cost+=(A[x]-i)**2
ans=min(ans,cost)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,026 |
s050336154 | p04025 | u505830998 | 1596768556 | Python | PyPy3 (7.3.0) | py | Accepted | 69 | 65484 | 918 | import sys
input_methods=['clipboard','file','key']
using_method=0
input_method=input_methods[using_method]
tin=lambda : map(int, input().split())
lin=lambda : list(tin())
mod=1000000007
#+++++
def main():
n = int(input())
#b , c = tin()
#s = input()
al = lin()
ret = mod
for i in range(-102, 102):
v = sum([... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,027 |
s445292495 | p04025 | u519968172 | 1596399650 | Python | Python (3.8.2) | py | Accepted | 25 | 9072 | 138 | n=int(input())
l=list(map(int,input().split()))
av=sum(l)//n
sm=0
sm1=0
for m in l:
sm+=(m-av)**2
sm1+=(m-av-1)**2
print(min(sm,sm1))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,028 |
s020684989 | p04025 | u131464432 | 1596337708 | Python | Python (3.8.2) | py | Accepted | 33 | 9172 | 179 | N = int(input())
a = list(map(int,input().split()))
mi = 10**9
for i in range(min(a),max(a)+1):
num = 0
for j in a:
num += (j-i)**2
mi = min(mi, num)
print(mi) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,029 |
s808448901 | p04025 | u642012866 | 1596171040 | Python | Python (3.8.2) | py | Accepted | 34 | 9180 | 185 | N = int(input())
A = list(map(int, input().split()))
res = 10**10
for i in range(min(A), max(A)+1):
x = 0
for a in A:
x += abs(a-i)**2
res = min(x, res)
print(res) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,030 |
s239360282 | p04025 | u779805689 | 1596143673 | Python | PyPy3 (7.3.0) | py | Accepted | 72 | 63832 | 161 | N=int(input())
A=list(map(int,input().split()))
M=float("inf")
for x in range(-100,101):
K=0
for a in A:
K+=(a-x)*(a-x)
M=min(M,K)
print(M)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,031 |
s366767695 | p04025 | u595952233 | 1596081652 | Python | Python (3.8.2) | py | Accepted | 30 | 9188 | 184 | n = int(input())
a = list(map(int, input().split()))
ans = float('inf')
for i in range(-100, 101):
temp = sum([(a[j] -i)**2 for j in range(n)])
ans = min(ans, temp)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,032 |
s774967157 | p04025 | u094999522 | 1596042819 | Python | Python (3.8.2) | py | Accepted | 26 | 9004 | 120 | #!/usr/bin/env python3
n, *a = map(int, open(0).read().split())
p = round(sum(a) / n)
print(sum((i - p)**2 for i in a))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,033 |
s280663170 | p04025 | u094999522 | 1596042446 | Python | Python (3.8.2) | py | Accepted | 26 | 9120 | 167 | #!/usr/bin/env python3
n, *a = map(int, open(0).read().split())
p = sum(a) // n
q = -(-sum(a) // n)
print(min(sum((i - p)**2 for i in a), sum((i - q)**2 for i in a)))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,034 |
s806914069 | p04025 | u423966555 | 1595944320 | Python | Python (3.8.2) | py | Accepted | 27 | 9184 | 217 | import math
N = int(input())
A = list(map(int, input().split()))
s = math.ceil(sum(A)/N)
t = math.floor(sum(A)/N)
ans_s = 0
ans_t = 0
for a in A:
ans_s += (a-s)**2
ans_t += (a-t)**2
print(min(ans_s, ans_t))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,035 |
s808752689 | p04025 | u495667483 | 1595899402 | Python | PyPy3 (7.3.0) | py | Accepted | 71 | 66432 | 539 | import sys, math
from itertools import combinations
sys.setrecursionlimit(500000)
MOD = 10**9+7
def input():
return sys.stdin.readline()[:-1]
def mi():
return map(int, input().split())
def ii():
return int(input())
def i2(n):
tmp = [list(mi()) for i in range(n)]
return [list(i) for i in zip(*tmp... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,036 |
s338597783 | p04025 | u629350026 | 1595818360 | Python | Python (3.8.2) | py | Accepted | 34 | 9220 | 193 | n=int(input())
a=list(map(int,input().split()))
amax=max(a)
amin=min(a)
ans=1000000000000
for i in range(amin,amax+1):
t=0
for j in range(n):
t=t+(a[j]-i)**2
ans=min(t,ans)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,037 |
s414965515 | p04025 | u894312115 | 1595798730 | Python | Python (3.8.2) | py | Accepted | 36 | 8996 | 199 | n=int(input())
ar=list(map(int,input().split()))
def f(i):
ans=0
for e in ar:
ans+=(e-i)**2
return ans
cur=float('inf')
for i in range(-200,200):
cur=min(cur,f(i))
print(cur)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,038 |
s380009915 | p04025 | u763280125 | 1595725225 | Python | Python (3.8.2) | py | Accepted | 38 | 9176 | 217 | INF = 10 ** 18
N = int(input())
A = list(map(int, input().split()))
up = max(A)
low = min(A)
res = INF
for i in range(low, up + 1):
t = 0
for a in A:
t += (i - a) ** 2
res = min(res, t)
print(res)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,039 |
s185972724 | p04025 | u357751375 | 1595714189 | Python | Python (3.8.2) | py | Accepted | 30 | 9100 | 356 | import math
n = int(input())
a = list(map(int,input().split()))
p = 0
if sum(a) % n == 0:
b = sum(a) // n
for i in range(n):
p += abs(a[i]-b) ** 2
print(p)
else:
b = sum(a) / n
x = math.floor(b)
y = math.ceil(b)
q = 0
for i in range(n):
p += abs(a[i]-x) ** 2
q += ... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,040 |
s675743094 | p04025 | u490642448 | 1595393239 | Python | PyPy3 (7.3.0) | py | Accepted | 72 | 64980 | 188 | n = int(input())
a = list(map(int,input().split()))
ans = 10**10
for i in range(-100,101):
tmp = 0
for j in range(n):
tmp += (a[j]-i)**2
ans = min(ans,tmp)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,041 |
s228127520 | p04025 | u591503175 | 1595296181 | Python | Python (3.8.2) | py | Accepted | 36 | 9116 | 373 | def resolve():
'''
code here
'''
import math
N = int(input())
As = [int(item) for item in input().split()]
res = 2000**2
for mid in range(min(As), max(As)+1):
temp_res = 0
for item in As:
temp_res += (item - mid)**2
res = min(temp_res, res)
... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,042 |
s323405985 | p04025 | u252729807 | 1595275894 | Python | Python (3.8.2) | py | Accepted | 25 | 9180 | 287 | n = int(input())
A = list(map(int, input().split()))
#%%
ans = float('inf')
# 直感的にはAの平均周辺が最小値っぽい
mean = sum(A)//n
means = [mean-1, mean, mean+1]
for m in means:
tmp = 0
for a in A:
tmp += (m - a)**2
ans = min(ans, tmp)
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,043 |
s538407325 | p04025 | u941047297 | 1595190020 | Python | Python (3.8.2) | py | Accepted | 28 | 9084 | 275 | def main():
n = int(input())
A = list(map(int, input().split()))
m = int(sum(A) / len(A) + 0.5)
ans = float('inf')
for i in range(m - 1, m + 2):
ans = min(ans, sum([(a - i) ** 2 for a in A]))
print(ans)
if __name__ == '__main__':
main()
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,044 |
s993567848 | p04025 | u917013605 | 1595102872 | Python | PyPy3 (7.3.0) | py | Accepted | 63 | 61924 | 260 | import math
N = int(input())
a_li = list(map(int, input().split()))
mid_1 = math.ceil(sum(a_li) / N)
mid_2 = sum(a_li) // N
ans_1 = 0
ans_2 = 0
for a in a_li:
ans_1 += (a - mid_1) ** 2
for a in a_li:
ans_2 += (a - mid_2) ** 2
print(min(ans_1, ans_2))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,045 |
s011606568 | p04025 | u088863512 | 1595060258 | Python | Python (3.8.2) | py | Accepted | 42 | 9912 | 754 | # -*- coding: utf-8 -*-
import sys
from collections import deque, defaultdict
from math import sqrt, factorial, gcd, ceil
# def input(): return sys.stdin.readline()[:-1] # warning not \n
# def input(): return sys.stdin.buffer.readline().strip() # warning bytes
# def input(): return sys.stdin.buffer.readline().decode('u... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,046 |
s048867202 | p04025 | u970809473 | 1594526631 | Python | Python (3.8.2) | py | Accepted | 35 | 9032 | 153 | n=int(input())
a=list(map(int,input().split()))
ans=10**9
for i in range(-100,101):
tmp=0
for j in a:
tmp+=(j-i)**2
ans=min(ans,tmp)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,047 |
s839613198 | p04025 | u628335443 | 1594479480 | Python | Python (3.8.2) | py | Accepted | 32 | 9040 | 201 | n = int(input())
a = list(map(int, input().split()))
x = sum(a) // n
count1 = 0
count2 = 0
for i in range(n):
count1 += (a[i] - x)**2
count2 += (a[i] - (x + 1))**2
print(min(count1, count2))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,048 |
s621160648 | p04025 | u193927973 | 1594440662 | Python | Python (3.8.2) | py | Accepted | 27 | 9076 | 225 | N=int(input())
A=list(map(int, input().split()))
cent=sum(A)/N
if abs(cent-int(cent))>=0.5:
if cent<0:
cent=int(cent)-1
else:
cent=int(cent)+1
else:
cent=int(cent)
ans=0
for a in A:
ans+=(a-cent)**2
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,049 |
s181990905 | p04025 | u222668979 | 1594094062 | Python | Python (3.8.2) | py | Accepted | 29 | 9172 | 176 | n = int(input())
a = list(map(int, input().split()))
ave = sum(a)//n
ans1 = sum((ai - ave) ** 2 for ai in a)
ans2 = sum((ai - ave - 1) ** 2 for ai in a)
print(min(ans1,ans2))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,050 |
s912365729 | p04025 | u222668979 | 1594093990 | Python | Python (3.8.2) | py | Accepted | 27 | 9168 | 176 | n = int(input())
a = list(map(int, input().split()))
ans1 = sum((ai - sum(a) // n) ** 2 for ai in a)
ans2 = sum((ai - sum(a) // n - 1) ** 2 for ai in a)
print(min(ans1,ans2))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,051 |
s346499204 | p04025 | u222668979 | 1594093908 | Python | Python (3.8.2) | py | Accepted | 26 | 9140 | 173 | n = int(input())
a = list(map(int, input().split()))
ave = sum(a) // n
ans = sum((ai - ave)** 2 for ai in a)
ans = min(ans, sum((ai - ave - 1)** 2 for ai in a))
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,052 |
s136094024 | p04025 | u962718741 | 1594091901 | Python | Python (3.8.2) | py | Accepted | 25 | 9120 | 251 | #!/usr/bin/env python3
def main():
N = int(input())
a = list(map(int, input().split()))
arg = round(sum(a) / len(a))
ans = 0
for i in range(N):
ans += (a[i] - arg)**2
print(ans)
if __name__ == "__main__":
main()
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,053 |
s623562459 | p04025 | u289288647 | 1593918115 | Python | Python (3.8.2) | py | Accepted | 31 | 8876 | 119 | N = int(input())
a = list(map(int, input().split()))
ans = 0
for i in a:
ans += (i-round(sum(a)/N))**2
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,054 |
s564007745 | p04025 | u603958124 | 1593911989 | Python | Python (3.8.2) | py | Accepted | 42 | 10152 | 467 | import bisect,copy,heapq,string
from collections import *
from math import *
from itertools import *
import sys
sys.setrecursionlimit(10 ** 6)
def input() : return sys.stdin.readline().strip()
def INT() : return int(input())
def MAP() : return map(int,input().split())
def LIST() : return list(MAP())
n = INT()
a =... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,055 |
s760246442 | p04025 | u290187182 | 1593891961 | Python | Python (3.8.2) | py | Accepted | 28 | 8920 | 322 | if __name__ == '__main__':
n = int (input())
a = [int(i) for i in input().split()]
minN = min(a)
maxN = max(a)
cost = -1
for i in range(minN-1,maxN+1):
temp =0
for j in a:
temp+=(i-j)*(i-j)
if cost == -1 or ( cost > temp):
cost = temp
print(cos... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,056 |
s661894335 | p04025 | u790710233 | 1593826593 | Python | Python (3.8.2) | py | Accepted | 28 | 9112 | 196 | n = int(input())
A = list(map(int, input().split()))
INF = 10**18
ans = INF
for X in range(-100, 101):
cost = sum(map(lambda a: (a-X)**2, A))
if cost < ans:
ans = cost
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,057 |
s800517637 | p04025 | u593567568 | 1593803959 | Python | Python (3.8.2) | py | Accepted | 33 | 9180 | 172 | N = int(input())
A = list(map(int,input().split()))
ans = 10 ** 10
for x in range(-100,101):
t = 0
for a in A:
t += (a - x) ** 2
ans = min(ans,t)
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,058 |
s713616043 | p04025 | u506910932 | 1593802925 | Python | Python (3.8.2) | py | Accepted | 38 | 9120 | 188 | n = int(input())
a = list(map(int, input().split()))
ans = 1001001001
for i in range(-100, 101):
tmp = 0
for aa in a:
tmp += (aa - i)**2
ans = min(ans, tmp)
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,059 |
s164003405 | p04025 | u228232845 | 1593677353 | Python | Python (3.8.2) | py | Accepted | 34 | 9056 | 495 | import sys
def input(): return sys.stdin.readline().strip()
def I(): return int(input())
def LI(): return list(map(int, input().split()))
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def S(): return input()
def LS(): return input().spl... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,060 |
s946408947 | p04025 | u376754170 | 1593622548 | Python | Python (3.8.2) | py | Accepted | 27 | 9108 | 130 | n = int(input())
ps = list(map(int, input().split()))
p_avg = round(sum(ps)/len(ps))
print(sum([abs(p-p_avg)**2 for p in ps])) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,061 |
s535174645 | p04025 | u376754170 | 1593621956 | Python | Python (3.8.2) | py | Accepted | 30 | 9192 | 213 | n = int(input())
ps = list(map(int, input().split()))
p_min = min(ps)
p_max = max(ps)
a = 999999999999999999999
for i in range(p_min, p_max+1):
b = sum([abs(p-i)**2 for p in ps])
a = min(a, b)
print(a) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,062 |
s925189425 | p04025 | u940139461 | 1593530639 | Python | PyPy3 (7.3.0) | py | Accepted | 67 | 64240 | 249 | # https://atcoder.jp/contests/arc059/tasks/arc059_a
n = int(input())
nums = [int(i) for i in input().split()]
ans = float('inf')
for i in range(-100, 101):
t = 0
for num in nums:
t += (num - i) ** 2
ans = min(ans, t)
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,063 |
s589199118 | p04025 | u185424824 | 1593442685 | Python | Python (3.8.2) | py | Accepted | 34 | 9176 | 186 | N = int(input())
a = list(map(int,input().split()))
ans = float("inf")
sum = 0
for i in range(-100,101):
for j in a:
sum += (j-i)**2
ans = min(ans,sum)
sum = 0
print(ans)
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,064 |
s690049265 | p04025 | u074294821 | 1593258778 | Python | Python (3.8.2) | py | Accepted | 29 | 9176 | 283 | import math
n = int(input())
l = list(map(int, input().split()))
avg1 = sum(l)//n
avg2 = math.ceil(sum(l)/n)
# print(avg1, avg2)
res1 = 0
res2 = 0
for i in range(n):
res1 += abs(l[i] - avg1)*abs(l[i] - avg1)
res2 += abs(l[i] - avg2)*abs(l[i] - avg2)
print(min(res1, res2))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,065 |
s263544762 | p04025 | u839509562 | 1593174738 | Python | Python (3.8.2) | py | Accepted | 34 | 9196 | 381 | import sys
input = sys.stdin.readline
def log(*args):
print(*args, file=sys.stderr)
def main():
ans = 1000000000
_n = int(input())
a = list(map(int, input().rstrip().split()))
for i in range(-100, 101):
tmp = 0
for v in a:
tmp += pow((v - i), 2)
ans = min(tmp,... | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,066 |
s402162173 | p04025 | u531631168 | 1593124392 | Python | Python (3.8.2) | py | Accepted | 27 | 9168 | 183 | n = int(input())
A = list(map(int, input().split()))
b = sum(A) / n
if b - int(b) < 0.5:
b = int(b)
else:
b = int(b) + 1
ans = 0
for a in A:
ans += (b - a) ** 2
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,067 |
s630438501 | p04025 | u179169725 | 1593014593 | Python | Python (3.8.2) | py | Accepted | 29 | 9100 | 350 | # https://atcoder.jp/contests/arc059/tasks/arc059_a
# 全探索してもいいし、二乗誤差の最小化から平均値を求めても良い
N = int(input())
A = list(map(int, input().split()))
candi1 = sum(A) // N
candi2 = candi1 + 1
ans1 = ans2 = 0
for a in A:
ans1 += (a - candi1)**2
ans2 += (a - candi2) ** 2
print(min(ans1, ans2))
| p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,068 |
s674844522 | p04025 | u482157295 | 1592953073 | Python | PyPy3 (7.3.0) | py | Accepted | 70 | 61892 | 291 | n = int(input())
a_li = list(map(int,input().split()))
a_min = min(a_li)
a_max = max(a_li)
a_average = round(sum(a_li)/n)
ans1 = 0
ans2 = 0
ans3 = 0
for i in range(n):
ans1 += (a_min-a_li[i])**2
ans2 += (a_max-a_li[i])**2
ans3 += (a_average-a_li[i])**2
print(min(ans1,ans2,ans3)) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,069 |
s115620651 | p04025 | u131881594 | 1592938470 | Python | Python (3.8.2) | py | Accepted | 36 | 9124 | 176 | n=int(input())
a=list(map(int,input().split()))
ans=10**9+7
for tar in range(-100,101):
cost=0
for i in a:
cost+=(tar-i)**2
if cost<ans: ans=cost
print(ans) | p04025 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,201,070 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.