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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s906437170 | p04031 | u886274153 | 1545824151 | Python | Python (3.4.3) | py | Accepted | 26 | 3060 | 305 | def cost(a, b):
c = 0
for ai in a:
c += (ai-b)**2
return c
def findcmin(a):
cmin = cost(a, max(a))
for b in range(min(a), max(a)):
if cost(a, b) < cmin:
cmin = cost(a, b)
return cmin
n = input()
a = [int(i) for i in input().split()]
print(findcmin(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,207,481 |
s885398703 | p04031 | u886274153 | 1545823870 | Python | Python (3.4.3) | py | Accepted | 26 | 3060 | 297 | def cost(a, b):
c = 0
for ai in a:
c += (ai-b)**2
return c
def findcmin(a):
cmin = cost(a, 100)
for b in range(-100, 100):
if cost(a, b) < cmin:
cmin = cost(a, b)
return cmin
n = input()
a = [int(i) for i in input().split()]
print(findcmin(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,207,482 |
s818020276 | p04031 | u049420296 | 1545792447 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 211 | n = int(input())
a = list(map(int, input().split()))
ans = 1000000000
for i in range(-100, 101):
cost = 0
for j in range(n):
cost += (a[j] - i) * (a[j] - i)
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,207,483 |
s009046064 | p04031 | u052332717 | 1545753668 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 201 | n = int(input())
A = list(map(int,input().split()))
A.sort()
ans = 1000000000
for x in range(A[0],A[n-1]+1):
a = 0
for item in A:
a += (x-item)**2
ans = min(a,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,207,484 |
s018585263 | p04031 | u385167811 | 1545597457 | Python | Python (3.4.3) | py | Accepted | 19 | 3316 | 231 | N = int(input())
temp = input().rstrip().split(" ")
list1 = []
for i in range(N):
list1.append(int(temp[i]))
list1.sort()
avg = round(sum(list1) / len(list1))
ans = 0
for i in range(N):
ans += (list1[i] - avg)**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,207,485 |
s187536446 | p04031 | u643840641 | 1545575393 | Python | Python (3.4.3) | py | Accepted | 26 | 3060 | 190 | n = int(input())
a = list(map(int, input().split()))
a.sort()
ans = 10**7
for i in range(a[0], a[n-1]+1):
cost = 0
for j in range(n):
cost += (a[j]-i)**2
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,207,486 |
s238303500 | p04031 | u546074985 | 1545407257 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 217 | num = int(input())
A = list(map(int, input().split()))
cost = 100 ** 100
tmp = 0
for x1 in range(-100, 101):
for x2 in range(num):
tmp += (A[x2] - x1) ** 2
cost = min(tmp, cost)
tmp = 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,207,487 |
s904779615 | p04031 | u589726284 | 1545257082 | Python | Python (3.4.3) | py | Accepted | 27 | 2940 | 214 | N = int(input())
a = list(map(int, input().split()))
cost = 100 ** 100
temp = 0
for x in range(-100, 101):
for y in range(N):
temp += (x - a[y]) ** 2
cost = min(temp, cost)
temp = 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,207,488 |
s161312018 | p04031 | u887207211 | 1545192465 | Python | Python (3.4.3) | py | Accepted | 25 | 3064 | 219 | N = int(input())
A = list(map(int,input().split()))
if(A.count(A[0]) == N):
print(0)
exit()
num = []
x = 0
for i in range(min(A),max(A)):
for a in A:
x += (a - i)**2
num.append(x)
x = 0
print(min(num)) | 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,207,489 |
s263245718 | p04031 | u323680411 | 1545184849 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 215 | import sys
n = int(input())
a = [int(x) for x in input().split()]
ans = sys.maxsize
for k in range(min(a), max(a) + 1):
cnt = 0
for ai in a:
cnt += (ai - 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,207,490 |
s961908747 | p04031 | u201234972 | 1545183720 | Python | Python (3.4.3) | py | Accepted | 26 | 2940 | 196 | N = int( input())
A = list( map( int, input().split()))
ans = 10**6
for a in range(-100, 101):
cost = 0
for j in range(N):
cost += (A[j]-a)**2
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,207,491 |
s689545526 | p04031 | u880373275 | 1545170246 | Python | Python (3.4.3) | py | Accepted | 23 | 2940 | 259 | def main():
_ = input()
aa = sorted(map(int, input().split()))
cost_min = 1 << 30
for x in range(aa[0], aa[-1] + 1):
cost_min = min(cost_min, sum((x - a) ** 2 for a in aa))
print(cost_min)
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,207,492 |
s431923461 | p04031 | u513081876 | 1544756865 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 135 | N = int(input())
A = list(map(int, input().split()))
ave = int(round(sum(A)/N, 0))
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,207,493 |
s118396814 | p04031 | u599547273 | 1544693644 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 167 | N = int(input())
A = list(map(int, input().split(" ")))
min_num = 100**2*N
for i in range(-100, 101):
min_num = min(min_num, sum((a-i)**2 for a in A))
print(min_num) | 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,207,494 |
s804661351 | p04031 | u427344224 | 1544502329 | Python | Python (3.4.3) | py | Accepted | 27 | 3060 | 218 | n = int(input())
a_list = list(map(int, input().split()))
min_list = []
for i in range(-100, 101):
r = 0
for a in a_list:
num = abs(i-a)**2
r += num
min_list.append(r)
print(min(min_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,207,495 |
s459335856 | p04031 | u952708174 | 1544479257 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 322 | def c_be_together(N, A):
a_sum = sum(A)
option = (a_sum // N, (a_sum + N - 1) // N) # 平均値の小数切り捨て|切り上げ
ans = min(sum([(a - opt)**2 for a in A]) for opt in option) # コストを計算
return ans
N = int(input())
A = [int(i) for i in input().split()]
print(c_be_together(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,207,496 |
s445165323 | p04031 | u952708174 | 1544478627 | Python | Python (3.4.3) | py | Accepted | 19 | 3188 | 290 | def c_be_together(N, A):
a_sum = sum(A)
option = (a_sum // N, (a_sum + N - 1) // N)
ans = float('inf')
for opt in option:
ans = min(ans, sum([(a - opt)**2 for a in A]))
return ans
N = int(input())
A = [int(i) for i in input().split()]
print(c_be_together(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,207,497 |
s354891637 | p04031 | u695811449 | 1544433655 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 177 | N=int(input())
A=list(map(int,input().split()))
ANS=10**12
for c in range(-100,101):
COST=sum([(A[i]-c)**2 for i in range(N)])
if COST<ANS:
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,207,498 |
s569746798 | p04031 | u140251125 | 1544023742 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 247 | # input
n = int(input())
A = list(map(int, input().split()))
ans1 = sum(A) // n + (sum(A) % n != 0)
ans2 = ans1 - 1
cost1 = 0
cost2 = 0
for i in range(n):
cost1 += (A[i] - ans1) ** 2
cost2 += (A[i] - ans2) ** 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,207,499 |
s901394144 | p04031 | u761529120 | 1543976029 | Python | Python (3.4.3) | py | Accepted | 28 | 2940 | 190 | N = int(input())
a = input().split(" ")
sum_a = []
for j in range(-100, 101):
result = 0
for i in a:
result += (int(i) - j) ** 2
sum_a.append(result)
print(min(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,207,500 |
s125355816 | p04031 | u557437077 | 1543214444 | Python | Python (3.4.3) | py | Accepted | 25 | 3064 | 348 | n = int(input())
a = [int(i) for i in input().split()]
minCost = 10000*1000
for i in range(101):
cost = 0
for j in range(len(a)):
cost += (i - a[j])**2
if cost < minCost:
minCost = cost
cost = 0
for j in range(len(a)):
cost += (i + a[j]) ** 2
if cost < minCost:
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,207,501 |
s056418850 | p04031 | u513081876 | 1543184869 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 199 | N = int(input())
A = [int(i) for i in input().split()]
che1 = sum(A)//N
che2 = sum(A)//N + 1
ans1 = 0
ans2 = 0
for i in A:
ans1 += (i-che1)**2
ans2 += (i-che2)**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,207,502 |
s376050633 | p04031 | u029329478 | 1543162632 | Python | Python (3.4.3) | py | Accepted | 22 | 2940 | 282 | N = int(input())
A = list(map(int, input().split()))
min_cost = 40000000
target = 0
for i in range(-100, 101):
sum_cost = 0
for a in A:
num = a-i
sum_cost += num*num
if sum_cost < min_cost:
target = i
min_cost = sum_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,207,503 |
s182758734 | p04031 | u813450984 | 1542999438 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 192 | n = int(input())
nums = list(map(int, input().split()))
ans = float('inf')
for i in range(-100, 101):
temp = 0
for num in nums:
temp += (num - 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,207,504 |
s505400340 | p04031 | u060392346 | 1542915642 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 130 | n = int(input())
a = list(map(int, input().split()))
m = round(sum(a) / n)
cost = 0
for i in a:
cost += (i-m) ** 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,207,505 |
s650848299 | p04031 | u415905784 | 1542597245 | Python | Python (3.4.3) | py | Accepted | 23 | 2940 | 164 | N = int(input())
A = [int(x) for x in input().split()]
cost = N * 200 ** 2
for i in range(-100, 101):
cost = min(sum([(i - a) ** 2 for a in A]), cost)
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,207,506 |
s861921943 | p04031 | u001024152 | 1542385466 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 204 | N = int(input())
a = list(map(int, input().split()))
ans = (200**2)*100
for y in range(-100, 100+1): # yに統一
cost = 0
for x in a:
cost += (y-x)**2
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,207,507 |
s910653256 | p04031 | u255280439 | 1542309583 | Python | Python (3.4.3) | py | Accepted | 37 | 4692 | 3,133 | import sys
import math
import collections
import itertools
import array
import inspect
# Set max recursion limit
sys.setrecursionlimit(1000000)
# Debug output
def chkprint(*args):
names = {
id(v): k
for k, v in inspect.currentframe().f_back.f_locals.items()
}
print(', '.join(
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,207,508 |
s336460322 | p04031 | u782098901 | 1541980910 | Python | Python (3.4.3) | py | Accepted | 18 | 2940 | 150 | N = int(input())
A = list(map(int, input().split()))
avg = round(sum(A) / N)
ans = 0
for i, a in enumerate(A):
ans += (a - avg) ** 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,207,509 |
s162545491 | p04031 | u404676457 | 1541650532 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 211 | n = int(input())
a = list(map(int, input().split()))
a.sort()
minc = 100000000
for i in range(a[0], a[-1] + 1):
count = 0
for j in a:
count += (i - j)** 2
minc = min(minc, count)
print(minc) | 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,207,510 |
s495686488 | p04031 | u500279510 | 1541364421 | Python | Python (3.4.3) | py | Accepted | 26 | 3060 | 211 | n = int(input())
a = list(map(int,input().split()))
ans = []
for i in range(min(a), max(a)+1):
c = 0
for j in range(len(a)):
cc = (a[j] - i) ** 2
c += cc
ans.append(c)
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,207,511 |
s323540889 | p04031 | u199295501 | 1541338646 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 257 | # -*- coding: utf-8 -*-
N = int(input())
an = list(map(int, input().split()))
sub = []
heikin = [sum(an)//len(an), sum(an)//len(an)+1]
for hei in heikin:
s_sub = 0
for a in an:
s_sub += (hei - a)**2
sub.append(s_sub)
print(min(sub))
| 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,207,512 |
s027598217 | p04031 | u943657163 | 1541269179 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 154 | n = int(input())
A = [int(_) for _ in input().split()]
m = round(sum(A)/n)
ans = 0
for a in A:
if a == m: continue
ans += (a - 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,207,513 |
s965990438 | p04031 | u059727354 | 1541096732 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 190 | n = int(input())
a = list(map(int, input().split()))
ans = 1e9
for y in range(-100, 101):
cost = 0
for x in a:
cost += (y - x) ** 2
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,207,514 |
s054362602 | p04031 | u294000907 | 1540875673 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 307 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import math
n = int(input())
a = list(map(int, input().split()))
c1 = 0
c2 = 0
t1 = int(math.ceil(sum(a)/n))
t2 = int(sum(a)//n)
for i in range(0,n):
if a[i]!=t1:
c1=c1+(t1-a[i])*(t1-a[i])
if a[i]!=t2:
c2=c2+(t2-a[i])*(t2-a[i])
print(min(c1,c2))
| 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,207,515 |
s851657443 | p04031 | u240793404 | 1540823036 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 253 | n = int(input())
a = list(map(int,input().split()))
dif = max(a) - min(a)
ans = -1
for i in range(dif+1):
cost = 0
target = min(a) + i
for j in a:
cost += (j - target) **2
if ans == -1 or ans > cost:
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,207,516 |
s972348510 | p04031 | u288601503 | 1540789013 | Python | Python (3.4.3) | py | Accepted | 94 | 3060 | 245 | n=int(input())
a=list(map(int,input().split()))
mini=[]
for i in range(max(a)-min(a)+1):
mini.append(int(0))
for j in range(n):
mini[i]=mini[i]+(i+min(a)-a[j])**2
if min(mini)<mini[i]:
break
print(min(mini)) | 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,207,517 |
s026167580 | p04031 | u733321071 | 1540754838 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 223 | # -*- coding: utf-8 -*-
import math
N = int(input())
a = list(map(int, input().split()))
n_sum = []
num_sum = []
for n in range(-100, 101):
num_sum.append(sum(list(map(lambda x: (x - n)**2, a))))
print(min(num_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,207,518 |
s823383449 | p04031 | u754553095 | 1540521032 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 137 | a=int(input())
b=input().split(" ")
i1=0
i2=0
i3=0
for i in b:
i1+=int(i)
i2=round(i1/a)
for i in b:
i3+=(int(i)-i2)**2
print(i3) | 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,207,519 |
s902259410 | p04031 | u459697504 | 1540271278 | Python | Python (3.4.3) | py | Accepted | 23 | 3064 | 802 | #! /usr/bin/python3
""" いっしょ / Be Together """
N = int(input())
a = list(map(int, input().split()))
# 1≦N≦100, −100≦ai≦100
test = False
def calc_cost(l):
""" コストを全探索してリストで返す関数 """
cost = []
max_l = max(l)
min_l = min(l)
for i in range(min_l, max_l + 1):
temp_cost = 0
for x 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,207,520 |
s960087841 | p04031 | u681150536 | 1540270223 | Python | Python (3.4.3) | py | Accepted | 19 | 3060 | 385 | def main():
N = int(input())
A = list(map(int, input().split()))
m = min(A)
M = max(A)
Result = 0
for a in A:
Result += (a-m) * (a-m)
for i in range(m+1, M+1):
Result_tmp = 0
for a in A:
Result_tmp += (a - i) * (a - i)
Result = min(Result_tmp, 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,207,521 |
s670009443 | p04031 | u681150536 | 1540270117 | Python | Python (3.4.3) | py | Accepted | 20 | 3060 | 343 | def main():
N = int(input())
A = list(map(int, input().split()))
m = min(A)
M = max(A)
Result = 100000000
for i in range(m, M+1):
Result_tmp = 0
for a in A:
Result_tmp += (a - i) * (a - i)
Result = min(Result_tmp, Result)
print(Result)
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,207,522 |
s519899800 | p04031 | u681150536 | 1540270062 | Python | Python (3.4.3) | py | Accepted | 19 | 3060 | 341 | def main():
N = int(input())
A = list(map(int, input().split()))
m = min(A)
M = max(A)
Result = 1 << 30
for i in range(m, M+1):
Result_tmp = 0
for a in A:
Result_tmp += (a - i) * (a - i)
Result = min(Result_tmp, Result)
print(Result)
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,207,523 |
s934301858 | p04031 | u832039789 | 1539901491 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 183 | n = int(input())
a = list(map(int,input().split()))
res = float('inf')
for i in range(-100,101):
tmp = 0
for j in a:
tmp += (i-j)**2
res = min(res,tmp)
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,207,524 |
s831162482 | p04031 | u940102677 | 1539752575 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 122 | n = int(input())
a = list(map(int, input().split()))
r = (2*sum(a)+n)//(2*n)
s = 0
for x in a:
s += (x-r)*(x-r)
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,207,525 |
s278224604 | p04031 | u620480037 | 1539660532 | Python | Python (3.4.3) | py | Accepted | 21 | 3316 | 198 | N=int(input())
A=list(map(int,input().split()))
Ave=int(sum(A)/N)
cnt1=0
for i in range(N):
cnt1+=(A[i]-Ave)**2
cnt2=0
for j in range(N):
cnt2+=(A[j]-(Ave+1))**2
print(min(cnt1,cnt2))
| 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,207,526 |
s552794329 | p04031 | u848647227 | 1539654495 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 173 | x = int(input())
ar = list(map(int,input().split(" ")))
count = 0
for a in ar:
count += a
c = round(count / x)
cost = 0
for a in ar:
cost += (a - c) ** 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,207,527 |
s854019149 | p04031 | u513081876 | 1539396821 | Python | Python (3.4.3) | py | Accepted | 23 | 2940 | 160 | N = int(input())
a = sorted(map(int, input().split()))
cost = 10**9
for y in range(a[0], a[-1]+1):
cost = min(cost, sum([(x-y)**2 for x in a]))
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,207,528 |
s648764350 | p04031 | u595353654 | 1539391160 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 336 | # -*- coding: utf-8 -*-
from sys import stdin
def shisha(f):
if f - int(f) >= 0.5:
return int(f) + 1
else:
return int(f)
N = int(stdin.readline().rstrip())
a = [int(x) for x in stdin.readline().rstrip().split()]
ans = 0
near = shisha(sum(a)/N)
for i in range(N):
ans += (a[i] - near) ** 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,207,529 |
s205493411 | p04031 | u017810624 | 1539130402 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 159 | n=int(input())
a=list(map(int,input().split()))
l=[]
for i in range(min(a),max(a)+1):
c=0
for j in range(n):
c+=(a[j]-i)**2
l.append(c)
print(min(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,207,530 |
s939338110 | p04031 | u233152254 | 1538969366 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 257 | N = int(input())
A = [int(x) for x in input().split()]
A_min = min(A)
A_max = max(A)
ans = N * (A_max - A_min) ** 2
for p in range(A_min, A_max + 1):
cost = 0
for a in A:
cost += (a - p) ** 2
if cost < ans:
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,207,531 |
s124820728 | p04031 | u474270503 | 1538775530 | Python | Python (3.4.3) | py | Accepted | 23 | 3060 | 234 | N=int(input())
a=list(map(int, input().split()))
sumlist=[]
for i in range(min(a),max(a)+1):
sum=0
for j in range(N):
sum+=(a[j]-i)*(a[j]-i)
sumlist.append((sum,i))
print(sorted(sumlist, key=lambda x: x[0])[0][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,207,532 |
s583096355 | p04031 | u596276291 | 1538610618 | Python | Python (3.4.3) | py | Accepted | 33 | 4072 | 907 | from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursi... | 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,207,533 |
s129785122 | p04031 | u426108351 | 1538592511 | Python | Python (3.4.3) | py | Accepted | 26 | 2940 | 211 | N = int(input())
a = list(map(int, input().split()))
ans = 1000000000000
for i in range(-100, 101):
sum = 0
for j in range(N):
sum += (i - a[j])**2
if ans > sum:
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,207,534 |
s830208395 | p04031 | u136090046 | 1538413327 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 128 | n = int(input())
array = [int(x) for x in input().split()]
tmp = round(sum(array)/n)
print(sum([(x-tmp)**2 for x in array]))
| 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,207,535 |
s288805435 | p04031 | u785220618 | 1538152632 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 154 | round = lambda x: int((x*2+1)//2)
n = int(input())
A = list(map(int, input().split()))
target = round(sum(A) / n)
print(sum([(a-target)**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,207,536 |
s140187364 | p04031 | u883048396 | 1538094435 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 349 |
iN = int(input())
aA = [int(x) for x in input().split()]
#i2M = (min(aA) + max(aA)) // 2
iMM = sum(aA) // len(aA)
#if i2M < iMM :
# iLM = i2M
# iUM = iMM + 1
#else:
# iLM = iMM
# iUM = i2M + 1
iLM = iMM
iUM = iMM + 1
aR = []
for iM in range(iLM,iUM+1):
aR.append(0)
for iA in aA:
aR[-1] += (... | 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,207,537 |
s656608462 | p04031 | u883048396 | 1538093977 | Python | Python (3.4.3) | py | Accepted | 21 | 3060 | 320 | iN = int(input())
aA = [int(x) for x in input().split()]
i2M = (min(aA) + max(aA)) // 2
iMM = sum(aA) // len(aA)
if i2M < iMM :
iLM = i2M
iUM = iMM + 1
else:
iLM = iMM
iUM = i2M + 1
aR = []
for iM in range(iLM,iUM+1):
aR.append(0)
for iA in aA:
aR[-1] += (iA - iM) ** 2
print(min(aR))
| 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,207,538 |
s682766481 | p04031 | u589087860 | 1537834923 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 338 | n = int(input())
a = list(map(int, input().split()))
a.sort()
#print(a)
l = len(a)
s = sum(a)
#print(s)
target = 0
ans = 0
#if s % 2 == 1:
# target = int(s / n) + 1
#else:
# target = int(s / n)
#print(target)
target = round(s / n)
for i in range(l):
ans = ans + (target - a[i]) * (target - ... | 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,207,539 |
s393955053 | p04031 | u853900545 | 1537720756 | Python | Python (3.4.3) | py | Accepted | 18 | 3188 | 152 | n = int(input())
a = list(map(int,input().split()))
m = .0
m = sum(a)/n
m1 = []
m1 = round(m)
s = 0
for i in range(n):
s += (a[i]-m1)**2
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,207,540 |
s364532449 | p04031 | u608088992 | 1537556663 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 156 | N = int(input())
A = [int(_) for _ in input().split()]
average = int(round(sum(A)/N, ))
ans = 0
for i in range(N):
ans += (A[i] - average)**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,207,541 |
s763818744 | p04031 | u457901067 | 1537507673 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 237 | from math import floor, ceil
N = int(input())
A = list(map(int, input().split()))
avg = sum(A) / N
ans1 = 0
ans2 = 0
x1 = floor(avg)
x2 = ceil(avg)
for a in A:
ans1 += (a - x1) ** 2
ans2 += (a - x2) ** 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,207,542 |
s635544210 | p04031 | u140342018 | 1537473805 | Python | Python (3.4.3) | py | Accepted | 48 | 5652 | 154 | n = int(input())
a = list(map(int, input().split()))
from statistics import mean
m = round(mean(a))
cost = 0
for i in a:
cost += (i-m)**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,207,543 |
s071608082 | p04031 | u667024514 | 1537446347 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 232 | import math
cou = 0
co = 0
n = int(input())
lis = list(map(int,input().split()))
ave1 = math.ceil(sum(lis)/n)
ave2 = math.floor(sum(lis)/n)
for i in range(n):
cou += (lis[i]-ave1) ** 2
co += (lis[i]-ave2) ** 2
print(min(cou,co)) | 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,207,544 |
s275154234 | p04031 | u505420467 | 1537399078 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 136 | import math
n=int(input())
a=list(map(int,input().split()))
ave=round(sum(a)/n,0)
ans=0
for i in a:
ans+=(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,207,545 |
s379534829 | p04031 | u611249982 | 1537166789 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 194 | #!/usr/bin/python3
# -*- coding: utf-8 -*-
n = int(input())
a = [int(i) for i in input().split()]
x = round(sum(a) / n, 0)
d = 0
for ai in a:
d += (x - ai) ** 2
print('{:.0f}'.format(d))
| 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,207,546 |
s641981356 | p04031 | u787562674 | 1536558493 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 244 | N = int(input())
input_list = [int(i) for i in input().split()]
ans = 10 ** 20
for i in range(min(input_list), max(input_list)+1):
ans1 = 0
for input in input_list:
ans1 += (i - input) ** 2
ans = min(ans, ans1)
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,207,547 |
s735147010 | p04031 | u214617707 | 1536497775 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 205 | n = int(input())
a = list(map(int, input().split()))
num = float("inf")
for i in range(-101, 101, 1):
rec = 0
for j in range(n):
rec += (i - a[j]) ** 2
num = min(num, rec)
print(num)
| 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,207,548 |
s118861121 | p04031 | u863841238 | 1536181281 | Python | Python (3.4.3) | py | Accepted | 18 | 3188 | 130 | n = int(input())
a = list(map(int,input().split()))
avg = round(sum(a)/n)
ans = 0
for i in a:
ans += (i-avg)**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,207,549 |
s322446647 | p04031 | u653642801 | 1535767704 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 133 | n = int(input())
a = list(map(int, input().split()))
ave = round(sum(a)/n)
ans = 0
for i in a:
ans += (ave - i)**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,207,550 |
s700653577 | p04031 | u944209426 | 1535673702 | Python | Python (3.4.3) | py | Accepted | 26 | 3060 | 179 | n=int(input())
a=list(map(int, input().split()))
a.sort()
ans=[]
for x in range(-100, 101):
t=0
for i in range(n):
t+=(a[i]-x)**2
ans.append(t)
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,207,551 |
s359020510 | p04031 | u136090046 | 1535218058 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 229 | import math
n = int(input())
array = [int(x) for x in input().split()]
tmp = math.ceil(sum(array)/n)
tmp2 = math.floor(sum(array)/n)
print(min(sum([pow(abs(x-tmp2),2) for x in array]), sum([pow(abs(x-tmp),2) for x in array]))) | 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,207,552 |
s508293378 | p04031 | u588341295 | 1535176538 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 239 | # -*- coding: utf-8 -*-
N = int(input())
aN = list(map(int, input().split()))
ans = float('inf')
for i in range(min(aN), max(aN)+1):
sum1 = 0
for j in range(N):
sum1 += (aN[j] - i) ** 2
ans = min(sum1, 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,207,553 |
s617225804 | p04031 | u761989513 | 1534566907 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 100 | n=int(input())
a=list(map(int,input().split()))
x=0
for i in a:
x+=(i-round(sum(a)/n))**2
print(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,207,554 |
s312356357 | p04031 | u761989513 | 1534566652 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 131 | n = int(input())
a = list(map(int, input().split()))
ave = round(sum(a) / n)
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,207,555 |
s185784797 | p04031 | u756569003 | 1534462899 | Python | Python (3.4.3) | py | Accepted | 21 | 2940 | 217 | N = map(int, input().split())
a = list(map(int, input().split()))
ans = 9999999999
for i in range(-100, 101):
sumof = 0
for j in a:
sumof += (i - j)*(i - j)
ans = min(ans, sumof)
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,207,556 |
s253602195 | p04031 | u832039789 | 1534417138 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 163 | n=int(input())
a=list(map(int,input().split()))
res = float('inf')
for i in range(-100,101):
tmp = 0
for j in a:
tmp += (j-i)**2
res = min(res,tmp)
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,207,557 |
s430052004 | p04031 | u270681687 | 1534415870 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 198 | n = int(input())
a = list(map(int, input().split()))
ans = 10**9
for m in range(-100, 101):
cost = 0
for i in range(n):
cost += (a[i] - m) ** 2
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,207,558 |
s752451120 | p04031 | u631277801 | 1534415583 | Python | Python (3.4.3) | py | Accepted | 19 | 3188 | 256 | from math import floor, ceil
n = int(input())
a = list(map(int, input().split()))
target_f = floor(sum(a)/n)
target_c = ceil(sum(a)/n)
ans_f = sum([(ai - target_f)**2 for ai in a])
ans_c = sum([(ai - target_c)**2 for ai in a])
print(min(ans_f, ans_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,207,559 |
s286851380 | p04031 | u692632484 | 1534415407 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 166 | N=int(input())
a=[int(i) for i in input().split()]
INF=9999999999
res=INF
for y in range(-100,101):
tmp=0
for x in a:
tmp+=(x-y)**2
res=min(res,tmp)
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,207,560 |
s922931810 | p04031 | u761320129 | 1534415341 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 191 | N = int(input())
src = list(map(int,input().split()))
ans = float('inf')
for i in range(-100,101):
cost = 0
for a in src:
cost += (a-i)**2
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,207,561 |
s858116208 | p04031 | u759651152 | 1534217397 | Python | Python (3.4.3) | py | Accepted | 19 | 3188 | 469 | #-*-coding:utf-8-*-
def main():
n = int(input())
a_list = list(map(int, input().split()))
threshold = round(sum(a_list) / n)
#threshold1 = -(-sum(a_list) // n)
#threshold2 = sum(a_list) // n
ans = 0
#ans1 = 0
#ans2 = 0
for i in a_list:
ans += (i - threshold) ** 2
#an... | 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,207,562 |
s015966158 | p04031 | u759651152 | 1534217171 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 360 | #-*-coding:utf-8-*-
def main():
n = int(input())
a_list = list(map(int, input().split()))
threshold1 = -(-sum(a_list) // n)
threshold2 = sum(a_list) // n
ans1 = 0
ans2 = 0
for i in a_list:
ans1 += (i - threshold1) ** 2
ans2 += (i - threshold2) ** 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,207,563 |
s707418798 | p04031 | u653642801 | 1533783604 | Python | Python (3.4.3) | py | Accepted | 54 | 5788 | 256 | from statistics import mean
def main():
n = int(input())
a = list(map(int,input().split()))
ave = mean(a)
ave = round(ave)
ans =0
for i in a:
ans += (i-ave)**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,207,564 |
s500559865 | p04031 | u419686324 | 1533781861 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 200 | N = int(input())
A = [int(x) for x in input().split()]
target = sum(A) / len(A)
if target > 0:
target += 0.5
else:
target -= 0.5
target = int(target)
print(sum((x - target) ** 2 for x 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,207,565 |
s622454420 | p04031 | u006657459 | 1533781211 | Python | Python (3.4.3) | py | Accepted | 23 | 2940 | 181 | N = int(input())
a = list(map(int, input().split()))
best = float('inf')
for r in range(-100, 101):
cost = sum([(ai - r)**2 for ai in a])
best = min(cost, 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,207,566 |
s167818871 | p04031 | u006657459 | 1533781159 | Python | Python (3.4.3) | py | Accepted | 23 | 3060 | 181 | N = int(input())
a = list(map(int, input().split()))
best = float('inf')
for r in range(-100, 101):
cost = sum([(ai - r)**2 for ai in a])
best = min(cost, 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,207,567 |
s745339720 | p04031 | u769852547 | 1533781122 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 163 | import sys
n = int(input())
a = list(map(int, input().split()))
total = round(sum(a)/n)
cost = 0
for i in a:
cost += (total - i)**2
print(cost)
sys.exit(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,207,568 |
s245424614 | p04031 | u373274281 | 1533781097 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 170 | n = int(input())
A = list(map(int, input().split()))
x = sum(A)//n
y = x + 1
xs = 0
ys = 0
for a in A:
xs += (a - x) ** 2
ys += (a - y) ** 2
print(min(xs, ys))
| 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,207,569 |
s330417619 | p04031 | u373274281 | 1533780896 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 170 | n = int(input())
A = list(map(int, input().split()))
x = sum(A)//n
y = x + 1
xs = 0
ys = 0
for a in A:
xs += (a - x) ** 2
ys += (a - y) ** 2
print(min(xs, ys))
| 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,207,570 |
s082746119 | p04031 | u439396449 | 1533780671 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 229 | N = int(input())
A = [int(x) for x in input().split()]
m1 = sum(A) // N
cost1 = 0
for i in range(N):
cost1 += (A[i] - m1)** 2
m2 = m1 + 1
cost2 = 0
for i in range(N):
cost2 += (A[i] - m2) ** 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,207,571 |
s130423273 | p04031 | u278864208 | 1533683464 | Python | Python (3.4.3) | py | Accepted | 40 | 5392 | 305 | import statistics
N = int(input())
a = list(input().split())
a = [int(i) for i in a]
res = []
for i in range(min(int(statistics.mean(a)),int(statistics.median(a))), max(int(statistics.mean(a))+1,int(statistics.median(a))+1+1)):
res.append(0)
for j in a:
res[-1] += (j-i)**2
print(min(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,207,572 |
s668835983 | p04031 | u826263061 | 1533421695 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 223 | # -*- coding: utf-8 -*-
"""
Created on Sat Aug 4 18:19:03 2018
@author: maezawa
"""
n = int(input())
a = list(map(int, input().split()))
mean_a = round(sum(a)/n)
ans = 0
for i in a:
ans += (i-mean_a)**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,207,573 |
s247970533 | p04031 | u690536347 | 1533356946 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 165 | f=lambda x:lambda y:(x-y)**2
N=int(input())
l=list(map(int,input().split()))
m=[]
for i in range(min(l),max(l)+1):
g=f(i)
m.extend([sum(map(g,l))])
print(min(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,207,574 |
s503174582 | p04031 | u780364430 | 1533188131 | Python | Python (3.4.3) | py | Accepted | 23 | 2940 | 148 | input()
a = list(map(int, input().split()))
cost = []
for i in range(min(a), max(a)+1):
cost.append(sum([(j-i)**2 for j 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,207,575 |
s055652807 | p04031 | u115682115 | 1533177642 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 129 | N = int(input())
a = list(map(int,input().split()))
mid = round(sum(a)/N,0)
sum=0
for i in a:
sum+=(i-mid)**2
print(int(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,207,576 |
s669659524 | p04031 | u631277801 | 1533115920 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 211 | from math import floor, ceil
N = int(input())
A = list(map(int ,input().split()))
mean = sum(A)/N
fl = 0
cl = 0
for a in A:
fl += (floor(mean) - a)**2
cl += (ceil(mean) - a)**2
print(min(fl,cl)) | 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,207,577 |
s628182120 | p04031 | u004025573 | 1533008026 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 218 | n = int(input())
a = list(map(int, input().split()))
K1 = sum(a)//n
K2 = K1+1
ans1 = 0
ans2 = 0
for i in a:
ans1+=(K1-i)*(K1-i)
ans2+=(K2-i)*(K2-i)
if ans1<ans2:
print(ans1)
else:
print(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,207,578 |
s269776330 | p04031 | u858523893 | 1532724650 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 241 | N = int(input())
a = [int(x) for x in input().split()]
min_df = 10**100
for i in range(min(a), max(a) + 1) :
sum_over = 0
for j in a :
sum_over += (i - j) ** 2
min_df = min(min_df, sum_over)
print(min_df) | 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,207,579 |
s743213605 | p04031 | u562935282 | 1532303032 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 174 | n = int(input())
a = list(map(int, input().split()))
ret = float('inf')
for i in range(min(a), max(a) + 1):
ret = min(ret, sum(list((i - x) ** 2 for x in a)))
print(ret) | 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,207,580 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.