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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s069989063 | p04031 | u500376440 | 1599682229 | Python | Python (3.8.2) | py | Accepted | 35 | 9172 | 180 | N=int(input())
a=sorted(list(map(int,input().split())))
ans=10**9
for i in range(a[0],a[-1]+1):
s=0
for j in range(N):
x=(a[j]-i)**2
s+=x
ans=min(ans,s)
print(ans)
| p04031 | <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,206,581 |
s198659034 | p04031 | u044964932 | 1599680329 | Python | Python (3.8.2) | py | Accepted | 33 | 9136 | 304 | def main():
n = int(input())
As = list(map(int, input().split()))
ans = float("inf")
for i in range(-100, 101):
ans_temp = 0
for j in range(n):
ans_temp += (As[j] + i)**2
ans = min(ans, ans_temp)
print(ans)
if __name__ == "__main__":
main()
| p04031 | <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,206,582 |
s576798358 | p04031 | u343977188 | 1599452162 | Python | Python (3.8.2) | py | Accepted | 27 | 9168 | 225 | N=int(input())
a=list(map(int,input().split()))
ave=sum(a)/N
if ave>=0 and ave%1>=0.5:
ave=int(ave)+1
elif ave<0 and -ave%1>=0.5:
ave=int(ave)-1
else:
ave=int(ave)
ans=0
for i in a:
ans+=(i-ave)**2
print(ans)
| p04031 | <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,206,583 |
s223529129 | p04031 | u021548497 | 1599440238 | Python | Python (3.8.2) | py | Accepted | 37 | 9172 | 174 | n = int(input())
a = list(map(int, input().split()))
ans = 1e9
for p in range(-100, 101):
sub = 0
for q in a:
sub += pow(p - q, 2)
ans = min(ans, sub)
print(ans)
| p04031 | <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,206,584 |
s472354023 | p04031 | u384793271 | 1599438826 | Python | Python (3.8.2) | py | Accepted | 35 | 9020 | 187 | n = int(input())
A = list(map(int, input().split()))
ans = float('inf')
for x in range(-100, 101, 1):
c = 0
for a in A:
c += (a - x) ** 2
ans = min(c, ans)
print(ans) | p04031 | <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,206,585 |
s283799665 | p04031 | u088553842 | 1599429898 | Python | Python (3.8.2) | py | Accepted | 35 | 9040 | 194 | n = int(input())
lst = list(map(int, input().split()))
m = 10 ** 10
for i in range(201):
a = i - 100
temp = 0
for j in range(n):
temp += ((lst[j] - a) ** 2)
m = min(m, temp)
print(m) | p04031 | <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,206,586 |
s866619016 | p04031 | u107639613 | 1599411195 | Python | PyPy3 (7.3.0) | py | Accepted | 66 | 61980 | 339 | import sys
def input(): return sys.stdin.readline().strip()
def main():
N = int(input())
A = list(map(int, input().split()))
c = sum(A) // N
ans = 10**10
for x in range(c, c + 2):
val = 0
for a in A: val += (x - a) ** 2
ans = min(ans, val)
print(ans)
if __name__ == "__m... | p04031 | <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,206,587 |
s874095991 | p04031 | u304612256 | 1599372607 | Python | Python (3.8.2) | py | Accepted | 34 | 9044 | 306 | from sys import stdin
input = stdin.readline
N = int(input())
A = list(map(int, input().split()))
if len(set(A)) != 1:
cost = 2**20
for i in range(-100, 101):
tc = 0
for a in A:
tc += (a-i)**2
if cost > tc:
cost = tc
else:
cost = 0
print(cost) | p04031 | <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,206,588 |
s711269765 | p04031 | u014333473 | 1599252294 | Python | Python (3.8.2) | py | Accepted | 33 | 9192 | 146 | input();a=list(map(int,input().split()));r=float('inf')
for i in range(min(a),max(a)+1):
n=0
for j in a:
n+=(j-i)**2
r=min(n,r)
print(r) | p04031 | <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,206,589 |
s872242609 | p04031 | u473905774 | 1599249772 | Python | PyPy3 (7.3.0) | py | Accepted | 72 | 64560 | 218 | n = int(input())
l = list(map(int,input().split(" ")))
cost_list = []
for i in range (-100,101):
cost = 0
for j in l:
cost += (j - i)**2
cost_list.append(cost)
cost_list.sort()
print(cost_list[0]) | p04031 | <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,206,590 |
s783564525 | p04031 | u235210692 | 1599178110 | Python | Python (3.8.2) | py | Accepted | 30 | 9084 | 204 | n=int(input())
a=[int(i) for i in input().split()]
ans=10000000000000000
for criterion in range(-100,101):
result=0
for i in a:
result+=(i-criterion)**2
ans=min(ans,result)
print(ans) | p04031 | <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,206,591 |
s529778398 | p04031 | u165388538 | 1599166057 | Python | Python (3.8.2) | py | Accepted | 36 | 9116 | 251 | n = int(input())
l = list(input().split())
sum = 0
min_sum = 10**10
num = 0
for i in range(-100,101):
for j in range(len(l)):
sum += (int(l[j]) - i)**2
if min_sum > sum:
min_sum = sum
num = i
sum = 0
print(min_sum) | p04031 | <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,206,592 |
s914125079 | p04031 | u506422818 | 1599104746 | Python | Python (3.8.2) | py | Accepted | 27 | 9140 | 222 | import math
n = int(input())
a = list(map(int,input().split()))
avg = sum(a)/n
x = math.floor(avg)
y = math.ceil(avg)
sumx = 0
sumy = 0
for i in a:
sumx += (i - x) ** 2
sumy += (i - y) ** 2
print(min([sumx,sumy])) | p04031 | <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,206,593 |
s809428173 | p04031 | u164776089 | 1599098884 | Python | Python (3.8.2) | py | Accepted | 26 | 9080 | 208 | n = int(input())
a = list(map(int,input().split()))
b = 0
for i in range(n):
b += a[i]
c = int(b/n)
d = c + 1
e = 0
f = 0
for i in range(n):
e += (a[i]-c)**2
f += (a[i]-d)**2
print(min(e,f))
| p04031 | <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,206,594 |
s138933497 | p04031 | u074220993 | 1599088635 | Python | Python (3.8.2) | py | Accepted | 41 | 10848 | 268 | N = int(input())
A = [int(x) for x in input().split()]
from statistics import mean
from math import floor, ceil
meanA = mean(A)
if meanA < floor(meanA) + 0.5:
meanA = floor(meanA)
else:
meanA = ceil(meanA)
ans = 0
for a in A:
ans += (a-meanA)**2
print(ans) | p04031 | <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,206,595 |
s406984053 | p04031 | u161134623 | 1599025745 | Python | Python (3.8.2) | py | Accepted | 38 | 9096 | 245 | n = int(input())
arr = list(map(int, input().split()))
mini = min(arr)
maxi = max(arr)
cost = 10000000000
for i in range(-100, 101+1):
add = 0
for j in range(n):
add = add + (arr[j] - i)**2
cost = min(cost, add)
print(cost) | p04031 | <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,206,596 |
s606740243 | p04031 | u940652437 | 1598993054 | Python | Python (3.8.2) | py | Accepted | 29 | 9180 | 163 | n=int(input())
a = list(map(int,input().split()))
_sum =sum(a) / n
s = round(_sum)
ans = 0
#print(s)
for i in range(n):
v =(a[i]-s)**2
ans += v
print(ans) | p04031 | <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,206,597 |
s116945267 | p04031 | u794448346 | 1598902905 | Python | Python (3.8.2) | py | Accepted | 29 | 9184 | 166 | N = int(input())
a = list(map(int,input().split()))
b = 0
for i in range(N):
b += a[i]
r = round(b/N)
ans = 0
for i in range(N):
ans += (a[i]-r)**2
print(ans) | p04031 | <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,206,598 |
s259238861 | p04031 | u980753441 | 1598837654 | Python | Python (3.8.2) | py | Accepted | 31 | 9132 | 160 | def cost(x):
cost = (x - ave)**2
return cost
n = input()
a = list(map(int, input().split()))
ave = round(sum(a)/int(n))
print(sum(list(map(cost, a)))) | p04031 | <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,206,599 |
s016516433 | p04031 | u980753441 | 1598835528 | Python | Python (3.8.2) | py | Accepted | 32 | 9180 | 191 | n = input()
a = list(map(int, input().split()))
ans = list()
for i in range(min(a), max(a)+1):
cost = 0
for num in a:
cost += (num - i)**2
ans.append(cost)
print(min(ans)) | p04031 | <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,206,600 |
s019635781 | p04031 | u909716307 | 1598835034 | Python | Python (3.8.2) | py | Accepted | 29 | 9016 | 161 | n=int(input())
l=list(map(int,input().split()))
ans=float('inf')
for v in range(min(l),max(l)+1):
c=sum([(a-v)**2 for a in l])
ans=min(ans,c)
print(ans)
| p04031 | <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,206,601 |
s273997776 | p04031 | u065079240 | 1598747185 | Python | Python (3.8.2) | py | Accepted | 33 | 9148 | 209 | N=int(input())
A=[int(x) for x in input().split()]
maxA=max(A)
minA=min(A)
ans=10**9
for i in range(minA,maxA+1):
kouho=0
for j in range(N):
kouho+=(i-A[j])**2
ans=min(ans,kouho)
print(ans) | p04031 | <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,206,602 |
s432528744 | p04031 | u589969467 | 1598650681 | Python | Python (3.8.2) | py | Accepted | 27 | 9124 | 241 | n = int(input())
a = list(map(int,input().split()))
a_u = round(sum(a)/n)
a_d = int(sum(a)/n)
ans_u = 0
ans_d = 0
for i in range(n):
ans_u += (a[i]-a_u)**2
ans_d += (a[i]-a_d)**2
print(min(ans_u,ans_d))
#print(round(-2.5),int(-2.5)) | p04031 | <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,206,603 |
s156610810 | p04031 | u780698286 | 1598630331 | Python | Python (3.8.2) | py | Accepted | 40 | 9124 | 198 | n = int(input())
a = list(map(int, input().split()))
ans = 10**10
for i in range(min(a), max(a)+1):
cnt = 0
for j in range(n):
cnt += (a[j]-i) ** 2
ans = min(ans, cnt)
print(ans) | p04031 | <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,206,604 |
s882841132 | p04031 | u120651703 | 1598625999 | Python | Python (3.8.2) | py | Accepted | 34 | 9176 | 357 | N = int(input())
int_list = [int(x) for x in input().split()]
# int_listの各整数をyに書き換えるときのコストの総和を計算
def calc_cost(int_list, y):
cost = 0
for x in int_list:
cost += (x - y)**2
return cost
cost_list = [calc_cost(int_list, y) for y in range(min(int_list), max(int_list)+1)]
print(min(cost_list)) | p04031 | <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,206,605 |
s336249884 | p04031 | u787059958 | 1598495601 | Python | Python (3.8.2) | py | Accepted | 34 | 9028 | 224 | N = int(input())
A = list(map(int, input().split()))
min_cost = 10 ** 9 + 7
for i in range(-100, 101):
cost = 0
for j in range(N):
cost += (A[j] - i) ** 2
min_cost = min(cost, min_cost)
print(min_cost)
| p04031 | <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,206,606 |
s095480767 | p04031 | u997134361 | 1598467261 | Python | Python (3.8.2) | py | Accepted | 29 | 9172 | 185 | n = int(input())
nums = list(map(int, input().split()))
def cost(x,y):
return (x-y)**2
avg = round(sum(nums)/len(nums))
res = 0
for n in nums:
res += cost(n, avg)
print(res)
| p04031 | <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,206,607 |
s716421696 | p04031 | u869790980 | 1598451291 | Python | PyPy2 (7.3.0) | py | Accepted | 57 | 64548 | 367 |
n = int(raw_input())
ais = map(int, raw_input().split())
ais.sort()
def f(ais):
return [sum(ais)/len(ais),sum(ais)/len(ais)+1,sum(ais)/len(ais)-1]
if len(ais) % 2:
return [ais[len(ais)/2]]
v = ais[len(ais)/2 -1] + ais[len(ais)/2]
return [v/2,v/2-1,v/2+1]
def g(ais,m):
s= 0
for ai in ais: s+=abs(ai - m) **2
... | p04031 | <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,206,608 |
s152651814 | p04031 | u998741086 | 1598418261 | Python | Python (3.8.2) | py | Accepted | 31 | 9168 | 247 | #!/usr/bin/env python
n = int(input())
a = list(map(int, input().split()))
ans = 1000100
ch = 0
for ch in range(min(a), max(a)+1):
tmp = 0
for i in range(n):
tmp += (a[i]-ch)**2
if tmp <= ans:
ans = tmp
print(ans)
| p04031 | <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,206,609 |
s399805956 | p04031 | u114722370 | 1598387460 | Python | Python (3.8.2) | py | Accepted | 34 | 9176 | 225 | inf = float('inf')
n = int(input())
arr = list(map(int, input().split()))
min_cost = inf
for i in range(-100, 101):
cost = 0
for j in arr:
cost += (j - i)**2
min_cost = min(min_cost, cost)
print(min_cost) | p04031 | <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,206,610 |
s054698501 | p04031 | u863723142 | 1598376195 | Python | Python (3.8.2) | py | Accepted | 24 | 9200 | 355 | num = int(input())
str_line = input().split(" ")
num_line = [int(n) for n in str_line]
ave = 0
for i in range(num):
ave += num_line[i]
if ave%num == 0:
ave //= num
else:
if ave%num <= num/2:
ave //= num
else:
ave = -(-ave//num)
wa = 0
for i in range(num):
temp = num_line[i] - ave... | p04031 | <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,206,611 |
s352889747 | p04031 | u670961163 | 1598363516 | Python | Python (3.8.2) | py | Accepted | 35 | 9128 | 322 | def main():
n = int(input())
inlis = list(map(int, input().split()))
ans = 10 ** 10
for kouho1 in range(-100,101):
tmp1 = 0
for i in range(n):
tmp1 += (inlis[i]- kouho1) ** 2
if tmp1 < ans:
ans = tmp1
print(ans)
if __name__ == "__main__":
main... | p04031 | <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,206,612 |
s478488556 | p04031 | u070423038 | 1598239363 | Python | Python (3.8.2) | py | Accepted | 25 | 9100 | 149 | N = int(input())
lst = list(map(int, input().split()))
avg = round(sum(lst) / N)
result = 0
for i in lst:
result += (i - avg)**2
print(result)
| p04031 | <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,206,613 |
s652433202 | p04031 | u935477635 | 1598203051 | Python | Python (3.8.2) | py | Accepted | 28 | 9076 | 234 | import sys
import math
def main():
input()
a = list(map(int, input().split()))
y = round(sum(a)/len(a))
ans = 0
for i in a:
ans += pow((i - y), 2)
print(ans)
if __name__ == '__main__':
main() | p04031 | <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,206,614 |
s046275019 | p04031 | u969708690 | 1598193853 | Python | Python (3.8.2) | py | Accepted | 33 | 9116 | 155 | maxa=(10)**11
N=int(input())
L=list(map(int,input().split()))
for i in range(-100,101):
R=[(i-y)**2 for y in L]
a=sum(R)
maxa=min(maxa,a)
print(maxa) | p04031 | <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,206,615 |
s502037479 | p04031 | u653837719 | 1598132456 | Python | PyPy3 (7.3.0) | py | Accepted | 64 | 64256 | 185 | n = int(input())
a = list(map(int, input().split()))
res = float('inf')
for i in range(-100, 101):
s = 0
for v in a:
s += (v - i) ** 2
res = min(res, s)
print(res) | p04031 | <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,206,616 |
s857621391 | p04031 | u955248595 | 1598083267 | Python | Python (3.8.2) | py | Accepted | 32 | 9128 | 158 | N = int(input())
A = [int(T) for T in input().split()]
Min = 10**9
for TN in range(min(A),max(A)+1):
Min = min(Min,sum((TN-TA)**2 for TA in A))
print(Min) | p04031 | <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,206,617 |
s273555408 | p04031 | u730769327 | 1598014336 | Python | PyPy3 (7.3.0) | py | Accepted | 73 | 61792 | 117 | n=int(input())
a=list(map(int,input().split()))
m=int(round(sum(a)/n,0))
ans=0
for i in a:
ans+=(i-m)**2
print(ans) | p04031 | <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,206,618 |
s111554428 | p04031 | u516554284 | 1597981872 | Python | Python (3.8.2) | py | Accepted | 33 | 9180 | 186 | n=int(input())
a=list(map(int,input().split()))
inf=float('inf')
ans=inf
for b in range(-100,101):
ch=0
for i in range(n):
ch+=(b-a[i])**2
ans=min(ans,ch)
print(ans) | p04031 | <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,206,619 |
s664438593 | p04031 | u190195462 | 1597976719 | Python | Python (3.8.2) | py | Accepted | 38 | 9192 | 453 | def keisan(N,A):
KAI = 0
A.sort
min = -100
max = 101
i = min
while i <= max:
kari = 0
j = 0
while j < N:
kari += (A[j]-i)**2
j += 1
if kari <= KAI or i == min:
KAI = kari
... | p04031 | <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,206,620 |
s922656524 | p04031 | u185948224 | 1597975789 | Python | Python (3.8.2) | py | Accepted | 34 | 9176 | 204 | n = int(input())
a = [int(x) for x in input().split()]
a.sort()
ans = []
for i in range(a[0], a[-1]+1):
cnt = 0
for j in range(n):
cnt += (a[j] - i)**2
ans.append(cnt)
print(min(ans)) | p04031 | <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,206,621 |
s210144315 | p04031 | u070201429 | 1597703538 | Python | PyPy3 (7.3.0) | py | Accepted | 66 | 62968 | 379 | n = int(input())
a = list(map(int, input().split()))
a.sort()
def cost(a, y):
ans = 0
for i in a:
ans += (i - y) * (i - y)
return ans
# binary search
left = a[0]
right = a[n-1]
while left < right:
center = (left + right) // 2
if cost(a, center) < cost(a, center+1):
right = cente... | p04031 | <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,206,622 |
s527059813 | p04031 | u739843002 | 1597643500 | Python | Python (3.8.2) | py | Accepted | 31 | 9216 | 246 | import math
N = int(input())
A = [int(a) for a in input().split(" ")]
ave = sum(A) / N
can1 = math.floor(ave)
can2 = math.ceil(ave)
cost1 = sum([(a - can1) ** 2 for a in A])
cost2 = sum([(a - can2) ** 2 for a in A])
print(min([cost1, cost2])) | p04031 | <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,206,623 |
s731587753 | p04031 | u512551187 | 1597597147 | Python | PyPy3 (7.3.0) | py | Accepted | 63 | 62156 | 192 | from math import *
n=int(input())
l=list(map(int,input().split()))
s=ceil(sum(l)/n)
ss=s-1
c=0
x=0
for i in range(n):
c+=(s-l[i])**2
for i in range(n):
x+=(ss-l[i])**2
print(min(c,x))
| p04031 | <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,206,624 |
s277253523 | p04031 | u172748267 | 1597479872 | Python | Python (3.8.2) | py | Accepted | 33 | 9168 | 169 | n=int(input())
a=[int(i)for i in input().split()]
cost=[]
for i in range(-100,101):
tmp=0
for j in a:
tmp+=(j-i)**2
cost.append(tmp)
print(min(cost)) | p04031 | <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,206,625 |
s041457410 | p04031 | u350093546 | 1597443122 | Python | PyPy3 (7.3.0) | py | Accepted | 68 | 63868 | 205 | n=int(input())
a=list(map(int,input().split()))
a.sort()
l=a[0]
r=a[-1]
ans=float('inf')
for pin in range(l,r+1):
cnt=0
for i in range(n):
cnt+=(a[i]-pin)**2
ans=min(ans,cnt)
print(ans) | p04031 | <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,206,626 |
s495114705 | p04031 | u813387707 | 1597416038 | Python | Python (3.8.2) | py | Accepted | 30 | 9180 | 237 | n = int(input())
a_list = [int(x) for x in input().split()]
a_sum = sum(a_list)
f = a_sum // n
c = (a_sum + n - 1) // n
b = f if abs(a_sum - f * n) < abs(a_sum - c * n) else c
ans = 0
for a in a_list:
ans += (a - b) ** 2
print(ans) | p04031 | <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,206,627 |
s010681218 | p04031 | u740909619 | 1597120888 | Python | Python (3.8.2) | py | Accepted | 34 | 9196 | 365 | # C - いっしょ
def main():
import math
_ = int(input())
a = list(map(int, input().split()))
t = float('inf')
for i in range(min(a), max(a)+1):
cnt = 0
for j in a:
cnt += (j-i)**2
else:
if cnt < t:
t = cnt
else:
print(t)
i... | p04031 | <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,206,628 |
s885795712 | p04031 | u401686269 | 1597084423 | Python | Python (3.8.2) | py | Accepted | 28 | 9192 | 260 | N=int(input())
a=list(map(int,input().split()))
def calc_cost(x,avg):
return (x-avg)**2
avg = sum(a)//N
delta = [-2,-1,0,1,2]
ans=10**20
for i in range(len(delta)):
val = sum(map(lambda x:calc_cost(x,avg+delta[i]),a))
ans = min(ans,val)
print(ans) | p04031 | <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,206,629 |
s772871095 | p04031 | u249987458 | 1597046558 | Python | Python (3.8.2) | py | Accepted | 35 | 8976 | 190 | n = int(input())
a = list(map(int, input().split()))
t = 10**9
for i in range(min(a),max(a)+1):
num = 0
for h in a:
num += (h-i)**2
if num <= t:
t = num
print(t) | p04031 | <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,206,630 |
s673079022 | p04031 | u074220993 | 1596999692 | Python | Python (3.8.2) | py | Accepted | 40 | 10900 | 227 | import math
import statistics
N = int(input())
A = [int(x) for x in input().split()]
avg = math.floor(statistics.mean(A))
a = 0
b = 0
for i in range(len(A)):
a += (A[i] - avg)**2
b += (A[i] - avg - 1)**2
print(min(a,b)) | p04031 | <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,206,631 |
s823073520 | p04031 | u303119576 | 1596981500 | Python | Python (3.8.2) | py | Accepted | 29 | 8920 | 143 | n = int(input())
a_list = list(map(int,input().split()))
mid = round(sum(a_list)/n)
ans = 0
for a in a_list:
ans += (a-mid) ** 2
print(ans) | p04031 | <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,206,632 |
s696498450 | p04031 | u844813573 | 1596853953 | Python | Python (3.8.2) | py | Accepted | 29 | 8876 | 143 | n = int(input())
a_list = list(map(int,input().split()))
mid = round(sum(a_list)/n)
ans = 0
for a in a_list:
ans += (a-mid) ** 2
print(ans) | p04031 | <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,206,633 |
s202395091 | p04031 | u146066372 | 1596849454 | Python | Python (3.8.2) | py | Accepted | 38 | 9068 | 264 | n=int(input())
a=list(map(int,input().split()))
# n=2
# a=[4,8]
minimum=10000000
for i in range(-100,101):
cost=0
for j in range(n):
cost+=(i-(a[j]))**2
if j==n-1:
if cost<minimum:
minimum=cost
print(minimum)
| p04031 | <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,206,634 |
s451917256 | p04031 | u894623942 | 1596832733 | Python | Python (3.8.2) | py | Accepted | 35 | 8808 | 213 | N = input()
list1 = list(map(int,input().split()))
list2 = []
for i in range(min(list1),max(list1)+1):
a = 0
for j in range(len(list1)):
a += (list1[j] - i)**2
list2.append(a)
print(min(list2)) | p04031 | <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,206,635 |
s945746274 | p04031 | u083184913 | 1596811886 | Python | Python (3.8.2) | py | Accepted | 36 | 9180 | 173 | N=int(input())
s=list(map(int,input().split()))
s_max=max(s)
s_min=min(s)
A=[]
for i in range(s_min,s_max+1):
b=0
for j in s:
b+=(j-i)**2
A.append(b)
print(min(A)) | p04031 | <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,206,636 |
s395282205 | p04031 | u500823377 | 1596768081 | Python | Python (3.8.2) | py | Accepted | 36 | 9112 | 153 | N = int(input())
a = list(map(int, input().split()))
b = []
for i in range(-100, 101):
t = 0
for j in a:
t += (j - i) ** 2
b.append(t)
print(min(b)) | p04031 | <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,206,637 |
s740974894 | p04031 | u155757809 | 1596672869 | Python | Python (3.8.2) | py | Accepted | 26 | 9160 | 141 | n = int(input())
a = [ int(x) for x in input().split() ]
avg = round(sum(a) / n)
cost = 0
for e in a:
cost += (e-avg)**2
print(cost)
| p04031 | <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,206,638 |
s492793363 | p04031 | u893836806 | 1596587741 | Python | Python (3.8.2) | py | Accepted | 42 | 9200 | 306 | N,*a = open(0).read().split()
N=int(N)
list1=list(map(int,a))
#print(N)
#print(list1)
a=[]
for i in range(-100,101):
int1=0
for n in range(N):
x = (list1[n]-i)
y = x**2
int1+=y
if n==N-1:
a.append(int1)
#print(a)
#print(max(a))
print(min(a)) | p04031 | <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,206,639 |
s295892908 | p04031 | u626228246 | 1596488814 | Python | Python (3.8.2) | py | Accepted | 39 | 10900 | 279 | import statistics
import math
n = int(input())
a = list(map(int,input().split()))
ans1,ans2 = 0,0
a_avr1 = math.ceil((statistics.mean(a)))
a_avr2 = math.floor((statistics.mean(a)))
for i in range(n):
ans1 += (a[i] - a_avr1)**2
ans2 += (a[i] - a_avr2)**2
print(min(ans1,ans2)) | p04031 | <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,206,640 |
s841546992 | p04031 | u123107676 | 1596384954 | Python | Python (3.8.2) | py | Accepted | 31 | 9004 | 209 | N = int(input())
a = list(map(int, input().split()))
avg = round(sum(a)/N)
sums = []
for i in range(min(a), avg+1):
s = 0
for j in range(N):
s += (i-a[j])**2
sums.append(s)
print(min(sums)) | p04031 | <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,206,641 |
s515317195 | p04031 | u372303722 | 1596384938 | Python | Python (3.8.2) | py | Accepted | 35 | 9180 | 310 |
N = int(input())
list = [int(a) for a in input().split()]
A = sum(list)//N
ans = 0
for k in range(N):
ans = ans + (list[k] - A) ** 2
for i in range(-100,100):
sum_new = 0
for j in range(N):
sum_new = sum_new + (list[j] - i) ** 2
if(ans > sum_new):
ans = sum_new
print(ans)
| p04031 | <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,206,642 |
s485808660 | p04031 | u671454079 | 1596382805 | Python | Python (3.8.2) | py | Accepted | 36 | 9076 | 222 | N = int(input())
l = list(map(int,input().split()))
l_ans = [[] for _ in range(201)]
for i in range(-100,101):
sum = 0
for j in range(N):
sum = sum + (i-l[j])**2
l_ans[i+100] = sum
print(min(l_ans)) | p04031 | <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,206,643 |
s841223197 | p04031 | u267718666 | 1596382607 | Python | Python (3.8.2) | py | Accepted | 25 | 9004 | 141 | N = int(input())
L = list(map(int, input().split()))[:N]
start = round(sum(L) / N)
f = lambda x: (x - start)**2
print(sum(list(map(f, L)))) | p04031 | <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,206,644 |
s706301903 | p04031 | u188827677 | 1596204832 | Python | Python (3.8.2) | py | Accepted | 29 | 9028 | 183 | n = int(input())
a = list(map(int, input().split()))
m = sum(a)//n
ans = float("inf")
for i in range(m, m+2):
t = 0
for j in a:
t += abs(j-i)**2
ans = min(t,ans)
print(ans) | p04031 | <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,206,645 |
s870118407 | p04031 | u396211450 | 1596016180 | Python | Python (3.8.2) | py | Accepted | 29 | 9156 | 168 | n=int(input())
l=list(map(int,input().split()))
k=[]
a=min(l)
b=max(l)
for i in range(a,b+1):
c=0
for j in range(n):
c=c+(l[j]-i)**2
k.append(c)
print(min(k)) | p04031 | <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,206,646 |
s664073142 | p04031 | u259190728 | 1596014389 | Python | Python (3.8.2) | py | Accepted | 36 | 9268 | 1,516 | from sys import stdin,stdout
import bisect
import math
def st():
return list(stdin.readline().strip())
def inp():
return int(stdin.readline())
def li():
return list(map(int,stdin.readline().split()))
def mp():
return map(int,stdin.readline().split())
def pr(n):
stdout.write(str(n)+"\n")
def... | p04031 | <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,206,647 |
s251975826 | p04031 | u075304271 | 1595911410 | Python | Python (3.8.2) | py | Accepted | 45 | 10260 | 400 | import math
import collections
import fractions
import itertools
import functools
import operator
def solve():
n = int(input())
a = list(map(int, input().split()))
cost = []
for i in range(-100, 101):
ramen = 0
for j in range(n):
ramen += abs(a[j]-i)**2
cost.append(r... | p04031 | <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,206,648 |
s144954985 | p04031 | u748311048 | 1595851169 | Python | Python (3.8.2) | py | Accepted | 30 | 9052 | 117 | n=int(input())
X=list(map(int, input().split()))
y=round(sum(X)/n)
cost=0
for x in X:
cost+=(x-y)**2
print(cost) | p04031 | <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,206,649 |
s247150979 | p04031 | u875113233 | 1595803616 | Python | Python (3.8.2) | py | Accepted | 34 | 9144 | 321 | def main():
n = int(input())
a = list(map(int,input().split()))
listcost = []
for i in range(min(a),max(a)+1):
cost = 0
for j in a:
if i != j:
cost += (i - j) ** 2
listcost.append(cost)
print(min(listcost))
if __name__=='__main__':
main(... | p04031 | <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,206,650 |
s862341650 | p04031 | u112065131 | 1595629576 | Python | Python (3.8.2) | py | Accepted | 35 | 9024 | 387 | # -*- coding: utf-8 -*-
def main():
N = int(input())
a = list(map(int, input().split()))
cost = 0
listCost = []
for i in range(min(a), max(a)+1):
for j in a:
if i != j:
cost += (i - j) ** 2
listCost.append(cost)
cost = 0
ans = min(li... | p04031 | <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,206,651 |
s257319833 | p04031 | u119148115 | 1595568044 | Python | PyPy3 (7.3.0) | py | Accepted | 67 | 61952 | 238 | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N = I()
a = LI()
x = sum(a)//N
y = x + 1
print(min(sum((i-x)**2 for i in a),sum((i-y)**2 for i in a)))
| p04031 | <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,206,652 |
s499988077 | p04031 | u465101448 | 1595512185 | Python | Python (3.8.2) | py | Accepted | 33 | 8952 | 241 | N = int(input())
A = list(map(int,input().split()))
def ans_one(i):
ans=0
for a in A:
ans += (a-i)**2
return ans
ans=10**20
for i in range(-102,103):
ans_ = ans_one(i)
if ans_ < ans:
ans =ans_
print(ans) | p04031 | <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,206,653 |
s369397828 | p04031 | u926046014 | 1595461638 | Python | PyPy3 (7.3.0) | py | Accepted | 64 | 61944 | 197 | n=int(input())
lst=list(map(int,input().split()))
ave=sum(lst)/n
if ave%1>=0.5:
import math
ave=math.ceil(ave)
else:
ave//=1
ans=0
for i in lst:
ans+=(abs(i-ave))**2
print(int(ans)) | p04031 | <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,206,654 |
s992286736 | p04031 | u065099501 | 1595449023 | Python | Python (3.8.2) | py | Accepted | 33 | 9096 | 177 | n = int(input())
a = list(map(int,input().split()))
ans=10**9
for i in range(-100,100+1):
const=0
for j in a:
const += (j-i)**2
ans=min(ans,const)
print(ans) | p04031 | <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,206,655 |
s044870186 | p04031 | u414920281 | 1595380568 | Python | Python (3.8.2) | py | Accepted | 34 | 9024 | 205 | n=int(input())
a=list(map(int,input().split()))
cost=float("inf")
for j in range(-100,101,1):
total=0
for i in range(n):
total+=(a[i]-j)**2
if total<cost:
cost=total
print(cost) | p04031 | <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,206,656 |
s279335307 | p04031 | u788068140 | 1595329032 | Python | Python (3.8.2) | py | Accepted | 28 | 9220 | 338 | import math
N = int(input())
ARR = list(map(int,input().split()))
def calculate(n, arr):
a1 = math.floor(sum(arr)/n)
a2 = math.ceil(sum(arr)/n)
result1 = 0
result2 = 0
for i in range(n):
result1 += pow(arr[i] - a1,2)
result2 += pow(arr[i] - a2,2)
print(min(result1,result2))
... | p04031 | <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,206,657 |
s903537736 | p04031 | u009348313 | 1595261451 | Python | PyPy3 (7.3.0) | py | Accepted | 65 | 63896 | 173 | n = int(input())
a = tuple(map(int,input().split()))
ans = float('inf')
for x in range(-100,101,1):
c = 0
for ai in a:
c += (x-ai)**2
ans = min(c,ans)
print(ans)
| p04031 | <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,206,658 |
s657017507 | p04031 | u904406968 | 1595128777 | Python | PyPy3 (7.3.0) | py | Accepted | 67 | 64316 | 178 | n = int(input())
arr =list(map(int , input().split()))
ans = 10001*10001
for i in range(-100 ,101):
tot =0
for j in arr:
tot = tot+(i-j)*(i-j)
ans = min(ans, tot)
print(ans) | p04031 | <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,206,659 |
s090406913 | p04031 | u501451051 | 1595088712 | Python | Python (3.8.2) | py | Accepted | 28 | 9000 | 246 | import math
n = int(input())
lis = list(map(int, input().split()))
avg1 = math.ceil(sum(lis)/len(lis))
avg2 = math.floor(sum(lis)/len(lis))
ans1 = 0
ans2 = 0
for i in lis:
ans1 += (i-avg1)**2
ans2 += (i-avg2)**2
print(min(ans1, ans2))
| p04031 | <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,206,660 |
s507193047 | p04031 | u456337115 | 1595043847 | Python | PyPy3 (7.3.0) | py | Accepted | 62 | 64472 | 201 | num = int(input())
l = list(map(int,input().split()))
min = 1000000
for n in range(-100,101):
sum = 0
for i in l:
if n !=i:
sum += (i-n)*(i-n)
if min > sum:
min = sum
print(min) | p04031 | <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,206,661 |
s323265180 | p04031 | u039002256 | 1595042183 | Python | Python (3.8.2) | py | Accepted | 28 | 9252 | 275 | import math
N = int(input())
A = list(map(int, input().split()))
ave = sum(A)//N
cost1 = 0
cost2 = 0
cost = []
for i in A:
cost1 += math.pow((i - ave), 2)
cost.append(cost1)
for i in A:
cost2 += math.pow((i - ave - 1), 2)
cost.append(cost2)
print(int(min(cost)))
| p04031 | <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,206,662 |
s576415212 | p04031 | u623231048 | 1595036434 | Python | Python (3.8.2) | py | Accepted | 33 | 9124 | 217 | n = int(input())
a = list(map(int,input().split()))
ans = -100
tmp = 10**10
for i in range(-100, 101):
t = 0
for j in a:
t += (j - i) ** 2
if t < tmp:
ans = i
tmp = t
print(tmp)
| p04031 | <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,206,663 |
s354271094 | p04031 | u833492079 | 1594960359 | Python | Python (3.8.2) | py | Accepted | 31 | 9156 | 176 | N = int(input())
A = [int(i) for i in input().split()]
ans = 200**2 * 100
for y in range(-100, 101):
a = 0
for x in A:
a += (x-y)**2
ans = min(ans, a)
print(ans)
| p04031 | <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,206,664 |
s996089106 | p04031 | u271064067 | 1594929789 | Python | Python (3.8.2) | py | Accepted | 38 | 9072 | 181 | n = int(input())
a = list(map(int, input().split()))
y = 1000000
for i in range(-100, 101):
x = 0
for m in a:
x += (i-m)**2
if y > x:
y = x
print(y) | p04031 | <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,206,665 |
s375365888 | p04031 | u968166680 | 1594891956 | Python | Python (3.8.2) | py | Accepted | 34 | 9128 | 434 | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
N, *A = map(int, read().split())
ans = INF
for x in range(-100, 101):
tmp = 0
for a in A:
tmp += (x - a) **... | p04031 | <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,206,666 |
s622863932 | p04031 | u543373102 | 1594875102 | Python | Python (3.8.2) | py | Accepted | 36 | 9164 | 189 | N = int(input())
an = list(map(int, input().split()))
cost = 10000*N
ans = 10000*N
for i in range(-100,100+1):
cost = sum([(j - i)**2 for j in an])
ans = min(ans, cost)
print(ans) | p04031 | <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,206,667 |
s859358608 | p04031 | u759412327 | 1594867726 | Python | Python (3.8.2) | py | Accepted | 26 | 9064 | 103 | N = int(input())
A = list(map(int,input().split()))
m = round(sum(A)/N)
print(sum((a-m)**2 for a in A)) | p04031 | <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,206,668 |
s132525578 | p04031 | u759412327 | 1594867671 | Python | Python (3.8.2) | py | Accepted | 33 | 9108 | 120 | N = int(input())
A = list(map(int,input().split()))
print(min(sum((a-n)**2 for a in A) for n in range(min(A),1+max(A)))) | p04031 | <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,206,669 |
s207175601 | p04031 | u453306058 | 1594820255 | Python | Python (3.8.2) | py | Accepted | 37 | 9112 | 186 | n = int(input())
a = list(map(int,input().split()))
ans = float('INF')
for i in range(-100,101):
s = 0
for j in range(n):
s += (a[j]-i)**2
ans = min(ans,s)
print(ans) | p04031 | <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,206,670 |
s257853811 | p04031 | u551857719 | 1594756171 | Python | Python (3.8.2) | py | Accepted | 29 | 9168 | 535 | #!/usr/bin/python
# -*- coding: UTF-8 -*-
import sys
def get_ints():
return map(int, sys.stdin.readline().strip().split())
def _main():
input()
an = list(get_ints())
t = 0
old = 1000000000
while 1:
ans = sq(t, an)
g = sq(t+1, an) - ans
t -= g / abs(g)
if old... | p04031 | <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,206,671 |
s081568551 | p04031 | u551857719 | 1594755488 | Python | Python (3.8.2) | py | Accepted | 32 | 9164 | 541 | #!/usr/bin/python
# -*- coding: UTF-8 -*-
import sys
def get_ints():
return map(int, sys.stdin.readline().strip().split())
def _main():
input()
an = list(get_ints())
t = 0
old = 1000000000
while 1:
ans = sq(t, an)
g = sq(t+1, an) - sq(t, an)
t -= g / abs(g)
... | p04031 | <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,206,672 |
s393537213 | p04031 | u767797498 | 1594712108 | Python | Python (3.8.2) | py | Accepted | 37 | 9992 | 1,236 | # -*- coding: utf-8 -*-
import io
import sys
import math
from decimal import Decimal, ROUND_HALF_UP
def format_multi_line_answer(lst):
ans = ""
ans += f"{len(lst)}\n" # Line count
for y in lst:
ans += f"{y}\n"
return ans
def solve(n,n_lst):
# implement process
#中央値を取り、四捨五入する
... | p04031 | <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,206,673 |
s694861077 | p04031 | u736546944 | 1594577218 | Python | PyPy3 (7.3.0) | py | Accepted | 69 | 61820 | 319 | n = int(input())
list_int = list(map(int, input().split()))
ave0 = int(sum(list_int)/n)
ave1 = ave0 + 1
ave2 = ave0 - 1
list_cost0 = [(i-ave0)**2 for i in list_int]
list_cost1 = [(i-ave1)**2 for i in list_int]
list_cost2 = [(i-ave2)**2 for i in list_int]
print(min([sum(list_cost0), sum(list_cost1), sum(list_cost2)])) | p04031 | <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,206,674 |
s988893060 | p04031 | u716117006 | 1594565313 | Python | Python (3.8.2) | py | Accepted | 32 | 9124 | 394 | def resolve():
N = int(input())
a_list = list(map(int, input().split()))
if len(set(a_list)) == 1:
print(0)
else:
# コストは最大でも10**6
min_cost = 10 ** 6 + 1
for x in range(-100, 101):
cost = sum([(a -x)**2 for a in a_list])
if cost < min_cost:
... | p04031 | <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,206,675 |
s811942883 | p04031 | u068727970 | 1594557013 | Python | Python (3.8.2) | py | Accepted | 40 | 9076 | 190 | N = int(input())
a = [int(x) for x in input().split()]
ans = []
for i in range(-100, 101, 1):
v = 0
for j in range(N):
v += (a[j] - i) ** 2
ans.append(v)
print(min(ans))
| p04031 | <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,206,676 |
s482205893 | p04031 | u332657092 | 1594512594 | Python | PyPy3 (7.3.0) | py | Accepted | 63 | 64328 | 216 | n = int(input())
A = list(map(int, input().split()))
min_cost = float("inf")
for num in range(-100, 101):
cost = 0
for a in A:
cost += (a - num) ** 2
min_cost = min(min_cost, cost)
print(min_cost) | p04031 | <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,206,677 |
s539197274 | p04031 | u370721525 | 1594498807 | Python | Python (3.8.2) | py | Accepted | 33 | 9192 | 236 | import math
N = int(input())
a = list(map(int, input().split()))
a.sort()
ans = math.inf
for i in range(a[0], a[-1]+1):
tmp = 0
for j in range(N):
tmp += (a[j]-i) ** 2
if ans >= tmp:
ans = tmp
else:
break
print(ans) | p04031 | <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,206,678 |
s782657393 | p04031 | u719886494 | 1594490841 | Python | Python (3.8.2) | py | Accepted | 28 | 9068 | 165 | n = int(input())
a = list(map(int,input().split()))
ave = sum(a)//n
b = c = 0
for i in range(n):
b += (a[i]-ave)**2
c += (a[i] - ave - 1)**2
print(min(b,c))
| p04031 | <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,206,679 |
s872464039 | p04031 | u359573942 | 1594369605 | Python | Python (3.8.2) | py | Accepted | 33 | 9152 | 176 | def sigma(a,r):
t=0
for i in a:
t+=(i-r)**2
return t
_=int(input())
a=list(map(int,input().split()))
s=min([sigma(a,r) for r in range(-100,101)])
print(s)
| p04031 | <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,206,680 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.