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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s369011683 | p04031 | u047485390 | 1589399531 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 194 | n = int(input())
a = list(map(int, input().split()))
a.sort()
b = []
for i in range(a[0], a[n-1]+1) :
ans = 0
for j in range(len(a)) :
ans = ans + (a[j]-i)**2
b.append(ans)
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,781 |
s877830384 | p04031 | u408958033 | 1589330563 | Python | Python (3.4.3) | py | Accepted | 26 | 3060 | 365 | def cin():
return map(int,input().split())
def cino(test=False):
if not test:
return int(input())
else:
return input()
def cina():
return list(map(int,input().split()))
a = cino()
l = cina()
ans = 10**18
for i in range(-100,101):
cost = 0
for j in range(len(l)):
cost += (i-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,782 |
s785488984 | p04031 | u379142263 | 1589301711 | Python | Python (3.4.3) | py | Accepted | 29 | 3316 | 361 | import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7
MAX = 10**18
n = int(input())
a = list(map(int,input().split()))
ans = MAX
for i in range(-100,101):
cost = 0
for j in range(n):
cost += (i-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,783 |
s337514382 | p04031 | u126844573 | 1589123346 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 134 | n = int(input())
a = sorted(map(int, input().split()))
ave = round(sum(a) / n)
ans = sum(map(lambda x: (ave - x) ** 2, 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,784 |
s392212968 | p04031 | u696444274 | 1589053094 | Python | Python (3.4.3) | py | Accepted | 22 | 3060 | 364 | n = int(input())
# n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
# abc = [int(input()) for i in range(5)]
if min(a) == max(a):
print(0)
exit()
ans = (max(a)*max(a))*n
for i in range(min(a), max(a)+1):
total = 0
for j in range(n):
total += (a[j]-i)*(a[j]-i)
if to... | 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,785 |
s434059125 | p04031 | u927870520 | 1588909975 | Python | Python (3.4.3) | py | Accepted | 18 | 3064 | 599 | N=int(input())
a=list(map(int,input().split()))
def change(a,x):
sum=0
for i in a:
sum+=(x-i)**2
return sum
def binarysearch(left,right,a):
if right-left<=1:
return min(change(a,left),change(a,right))
else:
center=left+(right-left)//2
if change(a,center)<=change(a,ce... | 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,786 |
s601321455 | p04031 | u202826462 | 1588903388 | Python | Python (3.4.3) | py | Accepted | 18 | 3064 | 224 | n = int(input())
a = list(map(int,input().split()))
avg1 = sum(a) // n
avg2 = (sum(a) // n) + 1
ans1 = 0
ans2 = 0
for i in range(n):
ans1 += abs(a[i] - avg1) ** 2
ans2 += abs(a[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,787 |
s535571556 | p04031 | u394040864 | 1588889229 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 321 | n = int(input())
As = list(map(int, input().split()))
total = 0
for i in range(n):
total += As[i]
# detect optimal number
ave = total / n
if ave != int(ave):
if ave >= int(ave)+0.5:
ave = int(ave)+1
else:
ave = int(ave)
ans = 0
for i in range(n):
ans += (ave-As[i])**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,788 |
s623923447 | p04031 | u730257868 | 1588859222 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 287 | n = int(input())
a = list(map(int, input().split()))
i = 0
m = 100
M = -100
s = 0
while i < n:
s += a[i]
i+=1
s1 = s//n
s2 = s1 + 1
i = 0
x1 = 0
x2 = 0
while i < n:
x1 += (s1-a[i])**2
x2 += (s2-a[i])**2
i+=1
if x1<x2:
ans = x1
else:
ans = x2
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,789 |
s339645986 | p04031 | u835283937 | 1588742075 | Python | Python (3.4.3) | py | Accepted | 30 | 3060 | 293 | def main():
N = int(input())
A = [int(a) for a in input().split()]
cost = 10**10
for a in range(-200, 201):
c = 0
for i in range(N):
c += (a - A[i])**2
if c < cost:
cost = c
print(cost)
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,790 |
s212259847 | p04031 | u551109821 | 1588716496 | Python | Python (3.4.3) | py | Accepted | 25 | 3064 | 282 | N = int(input())
a = list(map(int,input().split()))
ans = []
avg = 0
if (max(a)+min(a))%2 == 0:
avg = (max(a)+min(a))/2
else:
avg = (max(a)+min(a))/2+1
for i in range(-100,101,1):
sum = 0
for j in a:
sum += (j-i)**2
ans.append(sum)
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,791 |
s992295740 | p04031 | u106181248 | 1588714773 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 178 | n = int(input())
li = list(map(int,input().split()))
x = int(sum(li)/len(li))
y = sum(li)/len(li)
if y-x > 0.5:
x += 1
ans = 0
for i in li:
ans += (i-x)**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,792 |
s150182784 | p04031 | u712445873 | 1588706737 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 226 | N = int(input())
number = list(map(int, input().split()))
total_a = 0
total_b = 0
average = sum(number)//len(number)
for i in number:
total_a += (average-i)**2
total_b += (average+1-i)**2
print(min(total_a, total_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,793 |
s744165691 | p04031 | u588785393 | 1588704558 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 267 | from math import ceil, floor
n = int(input())
ls = list(map(int, input().split()))
sqsm = 0
for i in range(n):
sqsm += ls[i] * ls[i]
sm = sum(ls)
x1 = floor(sm / n)
x2 = ceil(sm / n)
print(min(sqsm + n * x1 * x1 - 2 * sm * x1, sqsm + n * x2 * x2 - 2 * sm * x2))
| 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,794 |
s276661451 | p04031 | u788337030 | 1588702091 | Python | Python (3.4.3) | py | Accepted | 25 | 3064 | 256 | n = int(input())
a = list(map(int, input().split()))
max = max(a)
min = min(a)
cost_min = n * (max - min)**2
for m in range(min, max+1):
cost = 0
for x in a:
cost += (x - m)**2
if cost < cost_min:
cost_min = cost
print(cost_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,795 |
s348187843 | p04031 | u586206420 | 1588694763 | Python | Python (3.4.3) | py | Accepted | 35 | 5148 | 246 | import statistics as st
import math
int(input())
s = list(map(int, input().split()))
md = math.floor(st.mean(s))
mu = md + 1
sd = 0
su = 0
for i in range(0, len(s)):
sd = sd + (s[i] - md) ** 2
su = su + (s[i] - mu) ** 2
print(min(sd, su)) | 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,796 |
s760431512 | p04031 | u952708174 | 1588620412 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 214 | def c_be_together():
N = int(input())
A = [int(i) for i in input().split()]
a_ave = sum(A) // N
return min(sum([(a - option)**2 for a in A]) for option in (a_ave, a_ave + 1))
print(c_be_together()) | 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,797 |
s092830491 | p04031 | u151785909 | 1588606152 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 191 | n = int(input())
x = list(map(int,input().split()))
ave = sum(x)//n
sum1=0
sum2=0
for i in range(n):
sum1+=(x[i]-ave)*(x[i]-ave)
sum2+=(x[i]-ave-1)*(x[i]-ave-1)
print(min(sum1,sum2))
| 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,798 |
s450246772 | p04031 | u287132915 | 1588552372 | Python | Python (3.4.3) | py | Accepted | 26 | 3060 | 199 | n = int(input())
a = list(map(int, input().split()))
ans = 10**9
for num in range(-100, 101):
temp = 0
for i in range(n):
temp += (num - a[i])**2
ans = min(ans, temp)
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,799 |
s296716008 | p04031 | u106797249 | 1588542548 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 349 | def resolve():
N = int(input())
A = sorted(list(map(int, input().split())))
start, end = min(A), max(A)
mincost = float("inf")
for i in range(start, end+1):
_cost = 0
for a in A:
_cost += abs(a-i)**2
mincost = min(mincost, _cost)
print(mincost)
if '__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,800 |
s708484255 | p04031 | u898058223 | 1588447260 | Python | Python (3.4.3) | py | Accepted | 27 | 3060 | 187 | n=int(input())
a=list(map(int,input().split()))
mins=100**2*n
for i in range(min(a),max(a)+1):
sum=0
for j in range(n):
sum+=abs(a[j]-i)**2
if sum<mins:
mins=sum
print(mins) | 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,801 |
s695769829 | p04031 | u417959834 | 1588363967 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 548 | #! python3
import math
def main():
N = int(input())
alist = [int(num) for num in input().split()]
ans1 = 0
ans2 = 0
m = sum(alist) / N
if sum(alist) % N == 0:
ans = 0
for i in range(N):
ans += (alist[i] - m)**2
else:
mu = math.floor(m)
mo = math.... | 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,802 |
s731957579 | p04031 | u940533000 | 1588279014 | Python | Python (3.4.3) | py | Accepted | 18 | 3064 | 257 | N = int(input())
a = list(map(int, input().split()))
a = sorted(a)
x = sum(a)
if x > 0:
x = int(x/N+0.5)
else:
x = int(x/N-0.5)
total = 0
if a[0] == x and a[-1] == x:
print(0)
else:
for i in range(N):
total += (x-a[i])**2
print(int(total)) | 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,803 |
s626695331 | p04031 | u431068320 | 1588261110 | Python | Python (3.4.3) | py | Accepted | 22 | 2940 | 258 | if __name__ == '__main__':
n = int(input())
lst = list(map(int, input().split()))
ans = (50*100)*(50*100)
for i in range(-100,101):
mn = 0
for c in lst:
mn += (i-c)*(i-c)
ans = min(ans,mn)
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,804 |
s178880697 | p04031 | u431068320 | 1588261061 | Python | Python (3.4.3) | py | Accepted | 21 | 2940 | 258 | if __name__ == '__main__':
n = int(input())
lst = list(map(int, input().split()))
ans = (50*101)*(50*101)
for i in range(-100,101):
mn = 0
for c in lst:
mn += (i-c)*(i-c)
ans = min(ans,mn)
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,805 |
s248678997 | p04031 | u189326411 | 1588226053 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 215 | n = int(input())
lst = list(map(int, input().split()))
M = max(lst)
m = min(lst)
ans = float("INF")
for i in range(m,M+1):
num = 0
for j in lst:
num += (i-j)**2
ans = min(ans, num)
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,806 |
s616016283 | p04031 | u007550226 | 1588222484 | Python | Python (3.4.3) | py | Accepted | 20 | 3060 | 212 | n= int(input())
a= list(map(int,input().split()))
maxa,mina=max(a),min(a)
if maxa==mina:print(0)
else:
gmin=9999999
for c in range(mina,maxa+1):gmin=min(gmin,sum([(c-b)*(c-b) for b in a]))
print(gmin) | 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,807 |
s803324693 | p04031 | u096294926 | 1588210990 | Python | Python (3.4.3) | py | Accepted | 33 | 3060 | 468 | # N =int(input())
# a = list(map(int,input().split()))
# ans = (10**9)
# for av in range(min(a),max(a)+1):
# Sum = 0
# for i in range(N):
# Sum += (a[i]-av)**2
# if Sum < ans:
# ans = Sum
# print(ans)
N =int(input())
a = list(map(int,input().split()))
b = list(set(a))
ans = (10**9)
for av... | 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,808 |
s709350377 | p04031 | u096294926 | 1588210925 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 209 | N =int(input())
a = list(map(int,input().split()))
ans = (10**9)
for av in range(min(a),max(a)+1):
Sum = 0
for i in range(N):
Sum += (a[i]-av)**2
if Sum < ans:
ans = Sum
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,809 |
s163430630 | p04031 | u652656291 | 1588205938 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 180 | n = int(input())
a = list(map(int,input().split()))
ans =10**8
for i in range(-100,101):
cost = 0
for k in a:
cost += (k-i)**2
ans = min(cost,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,810 |
s082100106 | p04031 | u726872801 | 1588187896 | Python | Python (3.4.3) | py | Accepted | 30 | 3572 | 409 | import sys
import heapq, math
from itertools import zip_longest, permutations, combinations, combinations_with_replacement
from itertools import accumulate, dropwhile, takewhile, groupby
from functools import lru_cache
from copy import deepcopy
N = int(input())
A = list(map(int, input().split()))
ans = 1 << 28
for 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,811 |
s767475750 | p04031 | u948522631 | 1588185995 | Python | Python (3.4.3) | py | Accepted | 25 | 3064 | 179 | n = int(input())
a = list(map(int,input().split()))
ans =10**8
for i in range(-100,101):
cost = 0
for k in a:
cost += (k-i)**2
ans = min(cost,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,812 |
s026432610 | p04031 | u103178403 | 1588184520 | Python | Python (3.4.3) | py | Accepted | 18 | 2940 | 101 | n=int(input())
a=[int(i)for i in input().split()]
b=round(sum(a)/n)
print(sum([(i-b)**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,813 |
s139452196 | p04031 | u746428948 | 1588111401 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 257 | n = int(input())
a = list(map(int,input().split()))
ans = 1000000
a = sorted(a)
for i in range(a[0],a[n-1]+1):
counter = 0
for j in range(n):
dif = abs(a[j] - i)
dif *= dif
counter += dif
ans = min(ans,counter)
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,814 |
s338706407 | p04031 | u196507615 | 1588110028 | Python | Python (3.4.3) | py | Accepted | 35 | 5080 | 225 | from statistics import mean
import math
n=int(input())
arr=[int(x) for x in input().split()]
a=math.ceil(mean(arr))
b=math.floor(mean(arr))
s1=0
s2=0
for x in arr:
s1=s1+((x-a)**2)
s2=s2+((x-b)**2)
print(min(s1,s2))
| 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,815 |
s485698034 | p04031 | u192154323 | 1588080466 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 234 | n = int(input())
a_ls = list(map(int, input().split()))
small = sum(a_ls)//n
big = small + 1
ans = float('inf')
for goal in [big, small]:
Sum = 0
for a in a_ls:
Sum += (goal - a) ** 2
ans = min(ans, Sum)
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,816 |
s877869652 | p04031 | u321035578 | 1588075521 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 216 | n=int(input())
a = list(map(int,input().split()))
ans = 10**7
for i in range(102):
p = 0
m = 0
for j, aa in enumerate(a):
p += (aa-i)**2
m += (aa+i)**2
ans = min(ans,p,m)
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,817 |
s156288283 | p04031 | u691446391 | 1588062872 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 206 | n = int(input())
arr = list(map(int,input().split()))
add = sum(arr)
if add>0:
x = int(add/n + 0.5)
else:
x = int(add/n - 0.5)
ans = 0
for i in range(len(arr)):
ans += ((x-arr[i])*(x-arr[i]))
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,818 |
s140571945 | p04031 | u277312083 | 1588015408 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 213 | n = int(input())
a = list(map(int, input().split()))
cmin = ((max(a) - min(a)) ** 2) * n
for x in range(min(a), max(a) + 1):
c = 0
for i in a:
c += (i - x) ** 2
cmin = min(c, cmin)
print(cmin)
| 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,819 |
s257866350 | p04031 | u614984376 | 1587948586 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 197 | n=int(input())
a=list(map(int,input().split()))
flag=[]
for i in range(-100,101):
sum=0
for j in a:
sum+=((i-j)**2)
flag.append(sum)
ans=min(flag)
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,820 |
s235004082 | p04031 | u171803978 | 1587945792 | Python | Python (3.4.3) | py | Accepted | 25 | 3064 | 369 | n = int(input())
a_list = list(map(int, input().split()))
a_list.sort()
cost = 0
min_cost=0
for i in range(a_list[0], a_list[-1]):
for j in range(len(a_list)):
cost = cost + (a_list[j] - i)**2
if i == a_list[0]:
min_cost=cost
min_cost = 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,821 |
s810346427 | p04031 | u308918401 | 1587941779 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 181 | n=int(input())
a=[]
a=list(map(int,input().split()))
ave=sum(a)/n
if ave<int(ave)+0.5:
ave=int(ave)
else:
ave=int(ave)+1
ans=0
for i in range(n):
ans+=(a[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,822 |
s913124269 | p04031 | u724687935 | 1587870538 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 193 | N = int(input())
A = list(map(int, input().split()))
ans = float('inf')
for k in range(-100, 101):
cnt = 0
for a in A:
cnt += pow(a - k, 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,823 |
s629118020 | p04031 | u760391419 | 1587834846 | Python | Python (3.4.3) | py | Accepted | 18 | 2940 | 135 | N = int(input())
A = [int(x) for x in input().split()]
average = round(sum(A) / N)
ans = 0
for x in A: ans += (average-x)**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,824 |
s708332156 | p04031 | u027685417 | 1587807094 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 244 | from math import floor, ceil
n = int(input())
A = list(map(int, input().split()))
x = sum(A) / n
if abs(floor(x) - x) < abs(ceil(x) - x):
x = floor(x)
else:
x = ceil(x)
answer = 0
for a in A:
answer += (a - x)**2
print(answer)
| 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,825 |
s487987745 | p04031 | u969850098 | 1587794808 | Python | Python (3.4.3) | py | Accepted | 23 | 3064 | 310 | import sys
readline = sys.stdin.readline
def main():
N = int(readline())
A = list(map(int, readline().rstrip().split()))
ans = 10 ** 7
for i in range(min(A), max(A)+1):
c = sum([(a-i)**2 for a in A])
ans = min(ans, c)
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,826 |
s722551021 | p04031 | u915647268 | 1587793883 | Python | Python (3.4.3) | py | Accepted | 18 | 2940 | 148 | n = int(input())
a = [int(i) for i in input().split()]
m = sum(a) / len(a)
num = round(m)
loss = 0
for n in a:
loss += (n - num)**2
print(loss)
| 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,827 |
s576833992 | p04031 | u189479417 | 1587751214 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 188 | N = int(input())
A = list(map(int,input().split()))
ans = float('inf')
for i in range(-100, 101):
cnt = 0
for a in A:
cnt += (a - 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,828 |
s242138308 | p04031 | u011062360 | 1587684309 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 245 | n = int(input())
list_A = list(map(int, input().split()))
ans = pow(10, 10)
for num in range(-100, 101):
list_B = list(map(lambda x:(x-num)**2, list_A))
sum_value = sum(list_B)
if ans > sum_value:
ans = sum_value
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,829 |
s358951791 | p04031 | u365858785 | 1587631800 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 194 | n=int(input())
lis=list(map(int,input().split()))
ave=0
ans=0
for i in lis:
ave+=i
ave/=n
if ave>=int(ave)+0.5:
ave=int(ave)+1
else:
ave=int(ave)
for i in lis:
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,830 |
s922996965 | p04031 | u959225525 | 1587527602 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 197 | n=int(input())
a=list(map(int,input().split()))
ma=max(a)
mi=min(a)
ans=10**9
for i in range(mi,ma+1):
tm=0
for j in a:
tm+=(j-i)**2
else:
ans=min(ans,tm)
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,831 |
s330842081 | p04031 | u870518235 | 1587521935 | Python | Python (3.4.3) | py | Accepted | 26 | 2940 | 233 | N = int(input())
A = list(map(int,input().split()))
R = []
for i in range(min(A), max(A)):
cost = 0
for j in range(len(A)):
cost += (i - A[j])**2
R.append(cost)
if R == []:
print(0)
else:
print(min(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,832 |
s142088492 | p04031 | u519923151 | 1587502979 | Python | Python (3.4.3) | py | Accepted | 26 | 3060 | 279 | N = int(input())
Alist = list(map(int, input().split()))
mina = min(Alist)
maxa = max(Alist)
costlist =list()
for i in range(mina,maxa+1):
res = 0
for j in Alist:
temp = (j-i)**2
res = res + temp
costlist.append(res)
res = min(costlist)
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,833 |
s323089573 | p04031 | u541610817 | 1587496668 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 254 | def main():
N = int(input())
A = [int(_) for _ in input().split()]
ret = 10 ** 10
for tar in range(-100, 101):
cc = 0
for a in A:
cc += (tar - a) ** 2
ret = min(ret, cc)
print(ret)
return
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,834 |
s911600902 | p04031 | u141419468 | 1587487072 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 148 | import math
n = int(input())
a = list(map(int, input().split()))
X = round(sum(a) / n)
P = 0
for i in range(n):
P += (X - a[i])**2
print(P) | 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,835 |
s175770117 | p04031 | u288430479 | 1587418926 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 160 | n = int(input())
l = list(map(int,input().split()))
a = sum(l)//n
b = a+1
s = 0
m = 0
for i in l:
s += (i-a)**2
for j in l:
m += (j-b)**2
print(min(s,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,836 |
s018241465 | p04031 | u318024671 | 1587333982 | Python | Python (3.4.3) | py | Accepted | 22 | 2940 | 245 | N = int(input())
a = list(map(int, input().split()))
mincost = 10000000000000000000
for i in range(-100, 101):
cost = 0
for j in a:
cost += (j - i) * (j - i)
if cost < mincost:
mincost = cost
print(mincost)
| 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,837 |
s722024397 | p04031 | u385309449 | 1587328253 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 213 | n = int(input())
a = list(map(int,input().split()))
for i in range(min(a),max(a)+1):
cnt = 0
for j in a:
cnt += (j-i)**2
if i == min(a):
ans = cnt
else:
if cnt < ans:
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,838 |
s052477772 | p04031 | u987829317 | 1587321496 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 182 | N = int(input())
a = list(map(int, input().split()))
mean = sum(a) / len(a)
#print(mean)
tar = round(mean)
#print(tar)
score = 0
for x in a:
score += (x-tar)*(x-tar)
print(score) | 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,839 |
s840043370 | p04031 | u576432509 | 1587319728 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 201 | n=int(input())
a=list(map(int,input().split()))
asummin=40000*100
for i in range(-100,101,1):
asum=0
for ii in range(n):
asum+=(a[ii]-i)**2
asummin=min(asummin,asum)
print(asummin) | 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,840 |
s026980596 | p04031 | u686036872 | 1587267950 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 199 | N = int(input())
A = list(map(int, input().split()))
ans = float("inf")
for i in range(min(A), max(A)+1):
x = 0
for j in range(N):
x += (i-A[j])**2
ans = min(ans, x)
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,841 |
s956283722 | p04031 | u145600939 | 1587238867 | Python | Python (3.4.3) | py | Accepted | 26 | 2940 | 146 | n = int(input())
A = list(map(int,input().split()))
ans = [0]*201
for a in A:
for i in range(201):
ans[i] += (i-100 - a)**2
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,842 |
s602273157 | p04031 | u201802797 | 1587231694 | Python | Python (3.4.3) | py | Accepted | 22 | 3060 | 198 | data=int(input())
nim=list(map(int,input().split()))
mike=2000000000000
for i in range(-100,101):
counter=0
for j in nim:
counter+=(i-j)*(i-j)
if counter<mike:
mike=counter
print(mike) | 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,843 |
s228693879 | p04031 | u340781749 | 1587192481 | Python | Python (3.4.3) | py | Accepted | 26 | 2940 | 209 | n = int(input())
aaa = list(map(int, input().split()))
ans = 10 ** 10
for x in range(-100, 101):
curr_cost = 0
for a in aaa:
curr_cost += (x - a) ** 2
ans = min(ans, curr_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,844 |
s893432312 | p04031 | u014730000 | 1587170097 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 286 | def solve(N, vals):
result = float("inf")
for i in range(-100, 101):
curCost = 0
for val in vals:
curCost += (i - val) ** 2
result = min(result, curCost)
print(result)
N = int(input())
a = list(map(int, input().split()))
solve(N, 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,845 |
s406710858 | p04031 | u843135954 | 1587169799 | Python | Python (3.4.3) | py | Accepted | 25 | 3188 | 336 | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
nn = lambda: list(stdin.readline().split())
ns = lambda: stdin.readline().rstrip()
n = ni()
a = na()
ans = 1000000000000
for y in range(-100,101):
c = 0
for i in a:
c += (y-i)**2
ans = min(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,846 |
s149381221 | p04031 | u230621983 | 1587051912 | Python | Python (3.4.3) | py | Accepted | 18 | 3064 | 212 | import math
n, *a = map(int, open(0).read().split())
y1 = math.ceil(sum(a)/n)
y2 = sum(a)//n
ans1 = 0
ans2 = 0
for i in range(n):
ans1 += (a[i] - y1) ** 2
ans2 += (a[i] - y2) ** 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,847 |
s558192405 | p04031 | u068595072 | 1587022844 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 243 | import math
n = int(input())
a = list(map(int, input().rstrip().split()))
s = sum(a)
t1 = 0
t2 = 0
mean1 = s // n
mean2 = mean1 + 1
for x in a:
t1 += math.pow(abs(x - mean1), 2)
t2 += math.pow(abs(x - mean2), 2)
print(int(min(t1, t2))) | 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,848 |
s681382018 | p04031 | u667472448 | 1586977877 | Python | Python (3.4.3) | py | Accepted | 50 | 5588 | 259 | from decimal import Decimal, ROUND_HALF_UP
n = int(input())
x = list(map(int, input().split()))
num = Decimal(str(sum(x)/n)).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
num = int(num)
cost=0
for i in range(n):
cost += (x[i]-num)*(x[i]-num)
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,849 |
s671074228 | p04031 | u568789901 | 1586920075 | Python | Python (3.4.3) | py | Accepted | 29 | 2940 | 227 | N=int(input())
A=list(map(int,input().split()))
ans=10**9
def sum(x):
r=0
for i in range(0,N):
r+=(A[i]-x)**2
return r
for j in range(-100,101):
if sum(j)<=ans:
ans=sum(j)
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,850 |
s812306762 | p04031 | u384124931 | 1586877989 | Python | Python (3.4.3) | py | Accepted | 18 | 2940 | 167 | N = int(input())
A = list(map(int, input().split()))
c = float("inf")
for m in range(sum(A)//N-1,sum(A)//N+2):
c = min(c, sum(map(lambda a: (a-m)**2, A)))
print(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,851 |
s024620415 | p04031 | u305018585 | 1586829074 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 129 | import math
n= int(input())
x = list(map(int, input().split()))
y = sum(x)*1.0/n
z =round(y)
print(sum([(i-z)**2 for i in 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,852 |
s506697007 | p04031 | u863442865 | 1586785412 | Python | Python (3.4.3) | py | Accepted | 27 | 3316 | 754 | def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby
#from itertools import product
from bisect import bisect_left,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,853 |
s499546867 | p04031 | u891217808 | 1586728046 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 156 | n = int(input())
ns = list(map(int, input().split()))
res = float('inf')
for i in range(-100, 101):
res = min(res, sum((i-j)**2 for j in ns))
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,854 |
s792832302 | p04031 | u230717961 | 1586726409 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 391 | def solve(s):
sum1 = 0
sum2 = 0
length = 0
for i in s.split():
x = int(i)
sum1 += x**2
sum2 += x
length += 1
score = 10**8
for y in range(100,-101, -1):
tmp = sum1 - sum2*2*y + length*(y**2)
score = min(tmp, score)
return score
if __name__ ... | 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,855 |
s797729402 | p04031 | u576432509 | 1586711276 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 226 |
n=int(input())
a=list(map(int,input().split()))
amin=min(a)
amax=max(a)
smin=(amax**2)*n
for y in range(amin,amax+1):
ssum=0
for i in range(n):
ssum=ssum+(a[i]-y)**2
smin=min(smin,ssum)
print(smin)
| 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,856 |
s066143347 | p04031 | u254871849 | 1586709408 | Python | Python (3.4.3) | py | Accepted | 20 | 2940 | 196 | import sys
n, *a = map(int, sys.stdin.read().split())
def main():
x = round(sum(a) / n)
s = 0
for i in range(n):
s += pow(x - a[i], 2)
print(s)
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,857 |
s394161143 | p04031 | u006817280 | 1586655300 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 250 |
def solve(n, arr):
s = sum(arr)
k = int(round(s / len(arr), 0))
cost = 0
for num in arr:
cost += (k-num) ** 2
return cost
n = int(input().strip())
arr = list(map(int, input().strip().split()))
print(solve(n, arr))
| 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,858 |
s086193247 | p04031 | u032798323 | 1586647790 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 197 | N = int(input())
a = list(map(int,input().split()))
ave = sum(a)/N
if ave - int(ave) >= 0.5:
ave = int(ave)+1
else:
ave =int(ave)
a = [(a[i]-ave)**2 for i in range(N)]
print(sum(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,859 |
s791840908 | p04031 | u172296140 | 1586639760 | Python | Python (3.4.3) | py | Accepted | 19 | 3064 | 270 | class atcorder:
N=int(input())
add = list(map(int,input().split()))
total=0
for i in range(N):
total+=add[i]
y=total/N
i=0
total=0
for i in range(N):
total+=(add[i]-round(y))**2
print(int(total)) | 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,860 |
s462097060 | p04031 | u156815136 | 1586617592 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 1,234 | #
# Written by NoKnowledgeGG @YlePhan
# ('ω')
#
#import math
#mod = 10**9+7
#import itertools
#import fractions
#import numpy as np
#mod = 10**4 + 7
"""def kiri(n,m):
r_ = n / m
if (r_ - (n // m)) > 0:
return (n//m) + 1
else:
return (n//m)"""
""" n! mod m 階乗
mod = 1e9 + 7
N = 10000000
fac = [0] * N
def 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,861 |
s884085967 | p04031 | u553855746 | 1586541378 | Python | Python (3.4.3) | py | Accepted | 22 | 3316 | 536 | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**6)
############ ---- Input Functions ---- ############
def in_int():
return (int(input()))
def in_list():
return (list(map(int, input().split())))
def in_str():
s = input()
return (list(s[:len(s) - 1]))
def in_ints():
return (ma... | 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,862 |
s804833485 | p04031 | u060736237 | 1586387358 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 189 | n = int(input())
a = list(map(int, input().split()))
work = sum(a)/n
work = int(work) if work-int(work)<0.5 else int(work)+1
result = 0
for el in a:
result += (work-el)**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,863 |
s645904749 | p04031 | u489959379 | 1586363996 | Python | Python (3.4.3) | py | Accepted | 28 | 3060 | 228 | n = int(input())
A = list(map(int, input().split()))
res = float("inf")
for x in range(min(A), max(A) + 1):
cost = 0
for j in range(n):
y = A[j]
cost += pow(x - y, 2)
res = min(res, cost)
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,864 |
s449169282 | p04031 | u747602774 | 1586357823 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 181 | n = int(input())
a = list(map(int,input().split()))
ans = 10**9
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,865 |
s472753984 | p04031 | u747602774 | 1586355544 | Python | Python (3.4.3) | py | Accepted | 26 | 2940 | 181 | n = int(input())
a = list(map(int,input().split()))
ans = 10**6
for i in range(-105,106):
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,866 |
s363117081 | p04031 | u114233208 | 1586338525 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 164 | N = int(input())
A = list(map(int, input().split(' ')))
target = round(sum(A)/len(A))
min_cost = 0
for each in A:
min_cost += (each-target)**2
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,867 |
s199584267 | p04031 | u471539833 | 1586181769 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 178 | N=int(input())
a=list(map(int,input().split()))
avg=sum(a)//len(a)
cost1=0
cost2=0
for i in range(len(a)):
cost1+=(a[i]-avg)**2
cost2+=(a[i]-avg-1)**2
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,868 |
s938459135 | p04031 | u038408819 | 1586146357 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 235 | N = int(input())
a = list(map(int, input().split()))
min_ = 10 ** 9
for i in range(-100, 101):
scr = 0
for j in range(N):
scr += (i - a[j])**2
#min_ = min(min_, scr)
if min_ > scr:
min_ = scr
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,869 |
s115241696 | p04031 | u281303342 | 1586109487 | Python | Python (3.4.3) | py | Accepted | 26 | 3060 | 521 | # python 3.4.3
import sys
input = sys.stdin.readline
# -------------------------------------------------------------
# library
# -------------------------------------------------------------
# -------------------------------------------------------------
# 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,870 |
s107344849 | p04031 | u760794812 | 1586108432 | Python | Python (3.4.3) | py | Accepted | 18 | 3064 | 216 | n = int(input())
A = list(map(int,input().split()))
ave1 = sum(A)//len(A)
ave2 = ave1+1
Ans1 = 0
Ans2 = 0
for i in range(n):
Ans1 += (A[i] - ave1)**2
Ans2 += (A[i] - ave2)**2
Answer = min(Ans1,Ans2)
print(Answer) | 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,871 |
s193478480 | p04031 | u266964556 | 1586067936 | Python | Python (3.4.3) | py | Accepted | 24 | 3064 | 255 | n = int(input())
*L, =map(int, input().split())
x = 0
ans = 0
min_L = min(L)
max_L = max(L)
for i in range(min_L,max_L):
x = sum([((L[j])-i)**2 for j in range(len(L))])
if i == min(L):
ans = x
if x - ans < 0:
ans = x
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,872 |
s081932843 | p04031 | u190406011 | 1586047102 | Python | Python (3.4.3) | py | Accepted | 24 | 3316 | 203 | import sys
n = int(input())
a_ls = [int(i) for i in sys.stdin.readline().split()]
best = 10**18
for i in range(-100,101):
score = sum([(i-a)**2 for a in a_ls])
best = min(score, best)
print(best) | 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,873 |
s794778185 | p04031 | u755180064 | 1586034106 | Python | Python (3.4.3) | py | Accepted | 21 | 3064 | 536 | url = "https://atcoder.jp/contests/abc043/tasks/arc059_a"
def main():
all = int(input())
num_li = list(map(int, input().split()))
n = sum(num_li) // all + 1
end = min(num_li)
ans = 10000000
for i in range(n, end - 1, -1):
tmp = 0
for v in num_li:
if v == 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,874 |
s474346394 | p04031 | u996434204 | 1586022646 | Python | Python (3.4.3) | py | Accepted | 28 | 3060 | 263 | n = int(input())
a = [int(x) for x in input().split()]
mn = 10**10
for i in range(-100,101):
count = 0
for j in range(n):
if a[j] != i:
tmp = (a[j] - i)**2
count += tmp
if count < mn:
mn = count
print(mn)
| 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,875 |
s867932034 | p04031 | u133936772 | 1586021455 | Python | Python (3.4.3) | py | Accepted | 18 | 3188 | 97 | n=int(input())
l=list(map(int,input().split()))
m=round(sum(l)/n)
print(sum((i-m)**2 for i in 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,876 |
s132952963 | p04031 | u086172144 | 1585968243 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 149 | n=int(input())
a=sorted(map(int,input().split()))
m=1000000
for i in range(a[0],a[-1]+1):
s=sum(map(lambda j:(j-i)**2,a))
if m>s:m=s
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,877 |
s125379835 | p04031 | u870297120 | 1585964871 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 200 | N = int(input())
nums = list(map(int, input().split(' ')))
temp = 0
cost = []
for i in range(-100, 101):
for j in nums:
temp += (j-i)**2
cost.append(temp)
temp = 0
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,878 |
s637565491 | p04031 | u151005508 | 1585941374 | Python | Python (3.4.3) | py | Accepted | 23 | 3060 | 153 | N = int(input())
a = list(map(int, input().split()))
cost=[]
for t in range(-100, 101):
cost.append(sum([(val-t)**2 for val in a]))
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,879 |
s666914786 | p04031 | u708019102 | 1585892119 | Python | Python (3.4.3) | py | Accepted | 27 | 3060 | 199 | N = int(input())
l = [int(x) for x in input().split()]
cost = 1000000000000
for i in range(-100,101):
co = 0
for j in range(N):
co += (i - l[j]) ** 2
if cost > co:
cost = co
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,880 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.