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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s042691111 | p04031 | u397953026 | 1594353150 | Python | Python (3.8.2) | py | Accepted | 29 | 9116 | 164 | n = int(input())
a = list(map(int,input().split()))
ave = sum(a)//n
b = c = 0
for i in range(n):
b += (a[i]-ave)**2
c += (a[i] - ave - 1)**2
print(min(b,c)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,681 |
s138214254 | p04031 | u886907961 | 1594283194 | Python | Python (3.8.2) | py | Accepted | 40 | 10760 | 131 | import statistics
n=int(input())
a=list(map(int,input().split()))
num=round(statistics.mean(a))
print(sum([(num-i)**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,682 |
s051144011 | p04031 | u786020649 | 1594247058 | Python | Python (3.8.2) | py | Accepted | 27 | 9120 | 156 | n=int(input())
integers=list(map(int,input().split()))
sql=[x**2 for x in integers]
s=sum(integers)
t=sum(sql)
m=min(s%n, n-s%n)
print((m**2-s**2)//n+t) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,683 |
s494816805 | p04031 | u007381711 | 1594237486 | Python | Python (3.8.2) | py | Accepted | 42 | 10932 | 286 | # -*- coding:utf-8 -*-
import sys,math,statistics
input = sys.stdin.readline
n = int(input())
a = [int(_) for _ in input().split()]
c1 = math.floor(statistics.mean(a))
c2 = math.ceil(statistics.mean(a))
a1 = sum([(i-c1)**2 for i in a])
a2 = sum([(i-c2)**2 for i in a])
print(min(a1,a2)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,684 |
s764217958 | p04031 | u693173434 | 1594130426 | Python | Python (3.8.2) | py | Accepted | 32 | 9156 | 169 | n=int(input())
a=list(map(int,input().split()))
mn=10**18
for i in range(-100,101):
sm=0
for k in range(n):
sm+=(a[k]-i)**2
mn=min(sm,mn)
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,685 |
s917564735 | p04031 | u036104576 | 1594097612 | Python | Python (3.8.2) | py | Accepted | 38 | 9416 | 504 | import sys
import itertools
# import numpy as np
import time
import math
import heapq
from collections import defaultdict
sys.setrecursionlimit(10 ** 7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
# map(int, input().split()... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,686 |
s124065144 | p04031 | u875769753 | 1594044686 | Python | PyPy3 (7.3.0) | py | Accepted | 67 | 61800 | 139 | N = int(input())
ls = list(map(int,input().split()))
ave = int((sum(ls)/N*2+1)//2)
cost = 0
for i in ls:
cost += (i-ave)**2
print(cost) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,687 |
s121983400 | p04031 | u520018621 | 1593672911 | Python | Python (3.8.2) | py | Accepted | 34 | 9124 | 160 | n = int(input())
arr = list(map(int, input().split()))
ans = 10**18
for y in range(-100, 101):
ans = min(ans, sum([(x - y) ** 2 for x in arr]))
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,688 |
s839264636 | p04031 | u917558625 | 1593665778 | Python | Python (3.8.2) | py | Accepted | 36 | 9132 | 168 | N=int(input())
a=list(map(int,input().split()))
ans=10**9
for i in range(-100,101):
bns=0
for j in range(N):
bns+=(abs(a[j]-i)**2)
ans=min(ans,bns)
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,689 |
s368279157 | p04031 | u159335277 | 1593642471 | Python | Python (3.8.2) | py | Accepted | 32 | 9004 | 133 | n = int(input())
a = list(map(int, input().split()))
print(min(sum(map(lambda x: (x - i) * (x - i), a)) for i in range(-100, 101)))
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,690 |
s696026995 | p04031 | u699089116 | 1593576376 | Python | PyPy3 (7.3.0) | py | Accepted | 70 | 63784 | 198 | n = int(input())
A = list(map(int, input().split()))
ans = float("INF")
for i in range(min(A), max(A)+1):
tmp = 0
for a in A:
tmp += (i - a) ** 2
ans = min(tmp, 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,691 |
s056853613 | p04031 | u345710188 | 1593573487 | Python | Python (3.8.2) | py | Accepted | 32 | 9080 | 256 | N = int(input())
a = list(map(int, input().split()))
x = 100
count1 = 0
for i in a:
count1 += (i - x)**2
for X in range(-100, 100):
count = 0
for i in a:
count += (i - X)**2
if count < count1:
count1 = count
print(count1)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,692 |
s741456382 | p04031 | u663263525 | 1593483526 | Python | PyPy3 (7.3.0) | py | Accepted | 71 | 63588 | 216 | n = int(input())
a = list(map(int, input().split()))
mn = min(a)
mx = max(a)
ans = 10000000
for i in range(mn, mx+1):
p = 0
for j in a:
p += (j-i) * (j-i)
if ans > p:
ans = p
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,693 |
s038851793 | p04031 | u679817762 | 1593378536 | Python | Python (3.8.2) | py | Accepted | 39 | 9172 | 679 | #入力
N = int(input())
lst = input().split()
#整数値化
for i in range(len(lst)):
lst[i] = int(lst[i])
#ソート
lst.sort()
#コスト計算関数
def get_cost(x, y):
return (x - y) ** 2
costs = []
#コスト計算
for i in range(lst[0], lst[-1]): #入力値の最小値から最大値まで
cost = 0
for j in lst:
cost = cost + get_cost(j, i)
costs.append(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,694 |
s674880293 | p04031 | u643679148 | 1593347373 | Python | Python (3.8.2) | py | Accepted | 34 | 9172 | 371 | def main():
n = int(input())
a = list(map(int, input().split()))
n_min, n_max = min(a), max(a)
ans = []
if n_min == n_max:
return 0
for y in range(n_min, n_max+1):
cost = 0
for x in a:
cost += (x-y)**2
ans.append(cost)
return min(ans)
if __nam... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,695 |
s382501728 | p04031 | u017050982 | 1593305533 | Python | Python (3.8.2) | py | Accepted | 27 | 9260 | 190 | N = int(input())
A = list(map(int,input().rstrip().split(" ")))
ave = 0
ans = 0
for i in A:
ave += i
ave /= N
ave = (ave + 0.5) // 1
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,206,696 |
s108439857 | p04031 | u278855471 | 1593276948 | Python | Python (3.8.2) | py | Accepted | 36 | 9128 | 221 | N = int(input())
a = sorted(list(map(int, input().split())))
answer = 10000000
for i in range(a[0], a[-1] + 1):
cost = 0
for num in a:
cost += ((num - i) ** 2)
answer = min(answer, cost)
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,697 |
s019607054 | p04031 | u169138653 | 1593224429 | Python | Python (3.8.2) | py | Accepted | 33 | 9160 | 178 | n=int(input())
a=list(map(int,input().split()))
ans=10**18
for num in range(-100,101):
cnt=0
for i in range(n):
cnt+=(num-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,698 |
s844386604 | p04031 | u697615293 | 1593094925 | Python | Python (3.8.2) | py | Accepted | 32 | 9104 | 200 | a = int(input())
b = list(map(int,input().split()))
ans = 4000000
for i in range(-100,101):
ans_sub = 0
for j in range(a):
ans_sub += (b[j]-i)**2
ans = min(ans,ans_sub)
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,699 |
s161194956 | p04031 | u981898278 | 1593033963 | Python | Python (3.8.2) | py | Accepted | 36 | 9188 | 330 | N = int(input())
a = list(map(int, input().split()))
min_val = None
stacks = 0
for i in range(-100, 101):
cost_stack = 0
for j in range(len(a)):
cost_stack += (a[j] - i) ** 2
if min_val == None:
min_val = cost_stack
elif cost_stack < min_val:
min_val = cost_stack
print... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,700 |
s881756944 | p04031 | u793430793 | 1592977509 | Python | Python (3.8.2) | py | Accepted | 29 | 9096 | 160 | #ABC043C
n=int(input())
a = list(map(int, input().split()))
h=round(sum(a)/len(a))
sum_a=0
for i in range(len(a)):
sum_a=sum_a+(a[i]-h)**2
print(int(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,701 |
s144236263 | p04031 | u014333473 | 1592951100 | Python | Python (3.8.2) | py | Accepted | 41 | 10788 | 131 | import statistics
n=int(input())
a=list(map(int,input().split()))
num=round(statistics.mean(a))
print(sum([(num-i)**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,702 |
s245883775 | p04031 | u530786533 | 1592940266 | Python | Python (3.8.2) | py | Accepted | 29 | 9192 | 259 | n = int(input())
a = list(map(int, input().split()))
x = sum(a) / n
y = sum(a) // n
if x == y:
cand = [y]
else:
cand = [y, y+1]
cost = 10**18
for ave in cand:
c = 0
for i in range(n):
c += (a[i]-ave)**2
cost = min(cost, c)
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,703 |
s783106594 | p04031 | u583507988 | 1592935565 | Python | Python (3.8.2) | py | Accepted | 34 | 9104 | 189 | n = int(input())
a = list(map(int, input().split()))
b = min(a)
c = max(a)
ans = []
for i in range(b, c+1):
res = 0
for j in a:
res += (j - i)**2
ans.append(res)
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,704 |
s967506249 | p04031 | u790012205 | 1592905060 | Python | Python (3.8.2) | py | Accepted | 36 | 9064 | 170 | N = int(input())
A = list(map(int, input().split()))
C = 10 ** 9
for i in range(-100, 101):
c = 0
for a in A:
c += (i - a) ** 2
C = min(C, c)
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,705 |
s005040274 | p04031 | u411203878 | 1592747830 | Python | PyPy3 (7.3.0) | py | Accepted | 63 | 64412 | 187 | n=int(input())
t = list(map(int,input().split()))
ans = 10000000000
for i in range(-100, 101):
memo = 0
for j in t:
memo += (i-j)**2
ans = min(ans, memo)
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,706 |
s204784996 | p04031 | u309716323 | 1592678278 | Python | PyPy3 (7.3.0) | py | Accepted | 67 | 62376 | 365 | import math
def read_int():
return int(input().strip())
def read_ints():
return list(map(int, input().strip().split(' ')))
def solve():
N = read_int()
A = read_ints()
avg = sum(A)/N
cost = lambda M: sum(abs(a-M)**2 for a in A)
return min(cost(math.floor(avg)), cost(math.ceil(avg)))
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,707 |
s712766284 | p04031 | u951289777 | 1592595243 | Python | Python (3.8.2) | py | Accepted | 40 | 10976 | 193 | from statistics import mean
n = int(input())
num_list = list(map(int, input().split()))
m = mean(num_list)
m = round(m)
cost = 0
for num in num_list:
cost += (num - 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,206,708 |
s131436218 | p04031 | u188827677 | 1592593667 | Python | Python (3.8.2) | py | Accepted | 27 | 9072 | 122 | n = int(input())
a = list(map(int, input().split()))
m = round(sum(a)/n)
ans = 0
for i in a:
ans += (i-m)**2
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,709 |
s250903075 | p04031 | u131411061 | 1592577737 | Python | Python (3.8.2) | py | Accepted | 34 | 9336 | 195 | import copy
N = int(input())
a = list(map(int,input().split()))
res = 1e+9
for i in range(min(a),max(a)+1):
tmp = copy.copy(a)
res = min(res,sum(map(lambda x:(x-i)**2,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,206,710 |
s255526984 | p04031 | u934119021 | 1592405248 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 167 | n = int(input())
a = list(map(int, input().split()))
l = []
for i in range(min(a), max(a) + 1):
c = 0
for e in a:
c += (e - 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,206,711 |
s520155170 | p04031 | u274883254 | 1592371568 | Python | Python (3.4.3) | py | Accepted | 23 | 2940 | 210 | n = int(input())
A = list(map(int, input().split()))
ans = 1000000000
for i in range(-101, 101):
tmp = 0
for j in range (n):
tmp += (i - A[j]) * (i - A[j])
ans = min(ans, tmp)
print(ans)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,712 |
s649921784 | p04031 | u991567869 | 1592337123 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 183 | n = int(input())
a = list(map(int, input().split()))
ans = 10**9
for i in range(-101, 101):
ref = 0
for j in a:
ref += (i - j)**2
ans = min(ans, ref)
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,713 |
s069689697 | p04031 | u013513417 | 1592276049 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 178 | N=int(input())
S=list(map(int,input().split()))
D=[]
for i in range(-101,102):
goukei=0
for j in range(N):
goukei+=(S[j]-i)**2
D.append(goukei)
print(min(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,206,714 |
s078156875 | p04031 | u434966508 | 1592180220 | Python | Python (3.4.3) | py | Accepted | 26 | 3064 | 233 | n = int(input())
a = list(map(int, input().split()))
a_min = min(a)
a_max = max(a)
a_sum = []
for i in range(a_min, a_max + 1):
num=0
for j in range(n):
num += (a[j] - i) ** 2
a_sum.append(num)
print(min(a_sum)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,715 |
s070807045 | p04031 | u047197186 | 1592152162 | Python | Python (3.4.3) | py | Accepted | 24 | 3064 | 262 | n = int(input())
a_lst = list(map(int, input().split()))
max_ = max(a_lst)
min_ = min(a_lst)
res = 0
for num in range(min_, max_+1):
cost = 0
for a in a_lst:
cost += (a - num) ** 2
if res != 0:
res = min(res, cost)
else:
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,716 |
s400305531 | p04031 | u939026953 | 1592010595 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 165 | ans = 10 ** 9
n = int(input())
A = list(map(int,input().split()))
for i in range(-100,101):
X = 0
for j in A:
X += (j - i) ** 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,717 |
s537423279 | p04031 | u939026953 | 1592010293 | Python | Python (3.4.3) | py | Accepted | 26 | 3060 | 175 | ans = 10 ** 9
n = int(input())
A = list(map(int,input().split()))
for i in range(-100,101):
X = 0
for j in range(n):
X += (A[j] - i) ** 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,718 |
s280412610 | p04031 | u750651325 | 1591911819 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 322 | # -*- coding: utf-8 -*-
"""
Created on Thu Jun 11 17:09:47 2020
@author: sd18016
"""
N = int(input())
a = [int(i) for i in input().split()]
ans = 100010001000
for i in range(-100, 101):
total = 0
for j in a:
total += (j - i)**2
ans = min(ans, total)
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,719 |
s845196097 | p04031 | u203383537 | 1591905317 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 201 | n = int(input())
a = list(map(int,input().split()))
ans = 100010001000
for i in range(-100,101):
total = 0
for j in a:
total += (j-i)**2
ans = min(ans,total)
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,720 |
s793316944 | p04031 | u820839927 | 1591828984 | Python | Python (3.4.3) | py | Accepted | 26 | 3188 | 217 | import os, sys, re, math
N = int(input())
a = [int(s) for s in input().split(' ')]
ret = float('inf')
for i in range(-100,101):
s = 0
for aj in a:
s += (aj - i) ** 2
ret = min(ret,s)
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,206,721 |
s663145777 | p04031 | u272525952 | 1591688278 | Python | Python (3.4.3) | py | Accepted | 32 | 2940 | 173 | n=int(input())
l=list(map(int,input().split()))
cost=[]
for i in range(-100,101):
count=0
for j in l:
count+=(j-i)**2
cost.append(count)
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,722 |
s595087375 | p04031 | u065099501 | 1591651626 | Python | Python (3.4.3) | py | Accepted | 28 | 3064 | 349 | N = int(input())
A = list(map(int, input().split(' ')))
ans = []
if A.count(A[0]) == len(A):
print(0)
exit(0)
for i in range(-100,101):
cost = 0
for j in range(N):
if A[j] == i:
continue
else:
cost += (A[j] - i)**2
ans.append(cost)
import heapq
heapq.heapify(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,723 |
s286377604 | p04031 | u293825440 | 1591642034 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 297 | N = int(input())
a = list(map(int,input().split()))
def minimize(list):
min = 1000000
for i in range(-100,101):
num = 0
for j in range(len(list)):
num = num + (int(list[j]) - i)**2
if min >= num:
min = num
return min
print(minimize(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,724 |
s310183780 | p04031 | u811436126 | 1591504149 | Python | Python (3.4.3) | py | Accepted | 23 | 3060 | 190 | n = int(input())
a = sorted(list(map(int, input().split())))
ans = 10 ** 10
for i in range(min(a), max(a) + 1):
val = sum([(x - i) ** 2 for x in a])
ans = min(ans, val)
print(ans)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,725 |
s564236761 | p04031 | u587589241 | 1591501584 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 187 | n=int(input())
a=list(map(int,input().split()))
ans=10000000
for i in range(-100,101):
tmp=0
for j in range(n):
tmp+=(a[j]-i)**2
if tmp<ans:
ans=tmp
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,726 |
s505296097 | p04031 | u587589241 | 1591501439 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 187 | n=int(input())
a=list(map(int,input().split()))
ans=10000000
for i in range(-101,102):
tmp=0
for j in range(n):
tmp+=(a[j]-i)**2
if tmp<ans:
ans=tmp
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,727 |
s328544042 | p04031 | u892487306 | 1591418061 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 352 | def main():
N = int(input())
A = list(map(int, input().split(' ')))
sum_A = sum(A)
left, right = sum_A // N, sum_A // N + 1
loss_1 = sum([(a - left) ** 2 for a in A])
loss_2 = sum([(a - right) ** 2 for a in A])
if loss_1 < loss_2:
print(loss_1)
else:
print(loss_2)
if __... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,728 |
s647898986 | p04031 | u757274384 | 1591363356 | Python | Python (3.4.3) | py | Accepted | 21 | 3064 | 213 | # -*- coding : utf-8 -*-
N = int(input())
L = list(map(int, input().split()))
L.sort()
m = min(L)
M = max(L)
A = []
for i in range(m,M+1):
k=0
for j in L:
k += (j-i)*(j-i)
A.append(k)
print(min(A)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,729 |
s903430917 | p04031 | u822179469 | 1591325788 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 206 | n = int(input())
a = list(map(int,input().split()))
stock =[]
for x in range(-100,101):
total = 0
for i in range(n):
total = total + (x-a[i])**2
stock.append(total)
print(min(stock)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,730 |
s495389241 | p04031 | u294385082 | 1591309273 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 219 | from math import ceil,floor
ansc,ansf = 0,0
n = int(input())
a = list(map(int,input().split()))
gp = sum(a)/len(a)
c = ceil(gp)
f = floor(gp)
for i in a:
ansc += (i-c)**2
ansf += (i-f)**2
print(min(ansc,ansf)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,731 |
s370059346 | p04031 | u446601167 | 1591187789 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 257 | N = int(input())
A = list(map(int,input().split()))
mean = sum(A)//len(A)
def std_div(mean, A):
total = 0
for x in A:
total += (mean-x)**2
return total
min1 = std_div(mean,A)
min2 = std_div(mean+1,A)
ans = min(min1,min2)
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,732 |
s335496703 | p04031 | u178079174 | 1591153139 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 182 | N = int(input())
A = list(map(int,input().split()))
MIN = float('inf')
for i in range(-100,101):
tmp = 0
for a in A:
tmp += (a-i)**2
MIN = min(MIN,tmp)
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,733 |
s092367134 | p04031 | u029000441 | 1591145709 | Python | Python (3.4.3) | py | Accepted | 22 | 3316 | 887 | 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, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from 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,734 |
s214312169 | p04031 | u029000441 | 1591145564 | Python | Python (3.4.3) | py | Accepted | 29 | 3316 | 886 | 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, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from 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,735 |
s810799513 | p04031 | u212831449 | 1591117743 | Python | Python (3.4.3) | py | Accepted | 18 | 3064 | 292 | import math
n = int(input())
s = list(map(int,input().split()))
b = c = 0
for i in s:
b += i
c += i**2
if b%n == 0:
print(int(c-b**2/n))
else:
koho1 = math.floor(b/n)
koho2 = math.ceil(b/n)
ans = min(n*(koho1**2)-2*b*koho1+c,n*(koho2**2)-2*b*koho2+c)
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,736 |
s700979702 | p04031 | u922449550 | 1591047668 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 206 | N = int(input())
A = list(map(int, input().split()))
ans = float('inf')
for target in range(-100, 101):
cost = 0
for j, a in enumerate(A):
cost += (target - 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,206,737 |
s634130880 | p04031 | u759412327 | 1591029689 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 105 | N = int(input())
A = list(map(int,input().split()))
m = round(sum(A)/N)
print(sum([(a-m)**2 for a in A])) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,738 |
s558833586 | p04031 | u759412327 | 1591029415 | Python | Python (3.4.3) | py | Accepted | 23 | 3060 | 155 | N = int(input())
A = list(map(int,input().split()))
cost = []
for n in range(min(A),max(A)+1):
cost.append(sum([(a-n)**2 for a 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,739 |
s962817064 | p04031 | u349444371 | 1591019009 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 184 | n=int(input())
a=list(map(int,input().split()))
ans=10**18
for i in range(min(a),max(a)+1):
x=0
for j in range(n):
x+=(a[j]-i)**2
if ans>x:
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,740 |
s190727849 | p04031 | u935077683 | 1590857751 | Python | Python (3.4.3) | py | Accepted | 23 | 2940 | 149 | n = int(input())
l = [int(i)for i in input().split()]
r = float("inf")
for i in range(-100, 101):
r = min(r, sum((n - i)**2 for n in l))
print(r) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,741 |
s528404919 | p04031 | u435721973 | 1590817496 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 225 | count = int(input())
sum_n = 0
sum_list = []
li = list(map(int, input().split(" ")))
for i in range(min(li),max(li) + 1):
for j in li:
sum_n += (i - j)**2
sum_list.append(sum_n)
sum_n = 0
print(min(sum_list)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,742 |
s989311775 | p04031 | u099187672 | 1590645772 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 176 | n = int(input())
l = [int(i) for i in input().split()]
val = float("inf")
for i in range(-100,101):
new = 0
for j in l:
new += (i-j)**2
val = min(val,new)
print(val)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,743 |
s163814325 | p04031 | u781262926 | 1590631235 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 101 | n, *A = map(int, open(0).read().split())
m = round(sum(A) / n)
print(sum(map(lambda x: (x-m)**2, 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,744 |
s855263975 | p04031 | u883866798 | 1590615406 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 185 | N = int(input())
S = list(map(int,input().split()))
ave = round(sum(S) / len(S))
ans = 0
for i in S:
if i == ave:
continue
else:
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,745 |
s407054299 | p04031 | u497952650 | 1590585559 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 177 | N = int(input())
a = list(map(int,input().split()))
ans = 1e10
for i in range(-100,101):
tmp = 0
for j in a:
tmp += (i-j)**2
ans = min(ans,tmp)
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,746 |
s664469193 | p04031 | u114920558 | 1590464469 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 178 | N = int(input())
A = list(map(int, input().split()))
ans = 10**9
for i in range(-100, 101):
tmp = 0
for j in range(N):
tmp += (i-A[j])**2
ans = min(ans, tmp)
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,747 |
s176301775 | p04031 | u032484849 | 1590463562 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 164 | n=int(input())
a=list(map(int,input().split()))
ans=float("inf")
for i in range(-100,101):
k=0
for j in a:
k+=(j-i)**2
ans=min(ans,k)
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,748 |
s410828738 | p04031 | u443736699 | 1590458799 | Python | Python (3.4.3) | py | Accepted | 27 | 3064 | 271 | N = int(input())
b = input().split()
a = list(map((lambda x: int(x)), b))
_max = max(a)
_min = min(a)
result = 20000 * N
for i in range(_min,_max+1,1):
_result = 0
for j in a:
_result += (i - int(j))**2
if _result <= result:
result = _result
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,749 |
s635056754 | p04031 | u221888299 | 1590457535 | Python | Python (3.4.3) | py | Accepted | 24 | 3064 | 436 | n = int(input())
a = sorted(list(map(int,input().split())))
sum = 0
List_sum = []
Counter = []
Count_num = (a[-1] - a[0])+1
for i in range(Count_num):
Counter.append(a[0]+i)
if Counter[-1] == a[-1]:
break
if len(set(a)) == 1:
print(0)
else:
for i in Counter:
for j in a:
sum +... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,750 |
s407195443 | p04031 | u540290227 | 1590436570 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 136 | n = int(input())
a = list(map(int, input().split()))
mean = round(sum(a) / n)
ans = 0
for i in a:
ans = ans + (i-mean)**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,751 |
s286126059 | p04031 | u203843959 | 1590365464 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 226 | N=int(input())
alist=list(map(int,input().split()))
min_answer=float("inf")
for i in range(min(alist),max(alist)+1):
answer=0
for a in alist:
answer+=(a-i)**2
min_answer=min(answer,min_answer)
print(min_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,752 |
s650151716 | p04031 | u460386402 | 1590357125 | Python | Python (3.4.3) | py | Accepted | 26 | 3060 | 169 | n=int(input())
a=list(map(int,input().split()))
ans=1000000
for i in range(-100,101):
cou=0
for j in range(n):
cou+=(a[j]-i)**2
ans=min(ans,cou)
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,753 |
s563552033 | p04031 | u294721290 | 1590249696 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 186 | N = int(input())
A = list(map(int,input().split()))
ans=10000000
for i in range(-100, 101):
sum=0
for a in range(len(A)):
sum+=(A[a]-i)**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,754 |
s344366101 | p04031 | u459150945 | 1590197661 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 194 | n = int(input())
an = list(map(int, input().split()))
ans = float('inf')
for i in range(-100, 101):
check = 0
for a in an:
check += (a-i)**2
ans = min(ans, check)
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,755 |
s552785981 | p04031 | u920543723 | 1590122490 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 131 | n = int(input())
A = [int(i) for i in input().split()]
ave = round(sum(A) / n)
ans = 0
for x in A:
ans += (x-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,756 |
s073221506 | p04031 | u883040023 | 1590092923 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 212 | n = int(input())
A = list(map(int,input().split()))
ans = float("inf")
for i in range(min(A),max(A)+1):
cost = 0
for j in A:
cost += (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,206,757 |
s215938172 | p04031 | u751843916 | 1590077162 | Python | Python (3.4.3) | py | Accepted | 26 | 3064 | 190 | n=int(input())
a=list(map(int,input().split()))
min_cost=10000000000
for x in range(-100,101):
i=0
for y in a:
i+=(y-x)**2
min_cost=min(min_cost,i)
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,758 |
s181507678 | p04031 | u695079172 | 1590030566 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 291 |
def main():
n = int(input())
a_s = list(map(int,input().split()))
answer = 999999999999999999999999999999999
for i in range(-100,101):
temp = sum([(a-i) ** 2 for a in a_s ])
answer = min(answer,temp)
print(answer)
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,759 |
s579386098 | p04031 | u801049006 | 1590030074 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 180 | n = int(input())
a = list(map(int, input().split()))
ans = float("inf")
for y in range(-100, 101):
res = 0
for x in a:
res += (x - y)**2
ans = min(ans, res)
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,760 |
s322236521 | p04031 | u801049006 | 1590029441 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 244 | n = int(input())
a = list(map(int, input().split()))
decimal = sum(a) / len(a) - sum(a) // len(a)
if decimal >= 0.5:
m = sum(a) // len(a) + 1
else:
m = sum(a) // len(a)
ans = 0
for i in range(n):
ans += (a[i] - m)**2
print(ans)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,761 |
s082962557 | p04031 | u489959379 | 1590029138 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 381 | import sys
sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7
def resolve():
n = int(input())
A = list(map(int, input().split()))
res = f_inf
for y in range(-100, 101):
cost = 0
for i in range(n):
cost += pow(abs(A[i] - y), 2)
res = min(res, cos... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,762 |
s503687864 | p04031 | u285891772 | 1590017097 | Python | Python (3.4.3) | py | Accepted | 45 | 5148 | 971 | import sys, re
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2
from collections import deque, defaultdict, Counter
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter, mul... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,763 |
s417338658 | p04031 | u871980676 | 1589930485 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 169 | N=int(input())
a = list(map(int,input().split()))
res = 10**18
for val in range(-100,101):
tmp = sum([(val-val2)**2 for val2 in a])
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,206,764 |
s747787682 | p04031 | u982591663 | 1589912988 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 241 | N = int(input())
A = list(map(int, input().split()))
max_A = max(A)
min_A = min(A)
ans = 10**9
for y in range(min_A, max_A+1):
tmp = 0
for a in A:
xsuby = a - y
tmp += xsuby ** 2
ans = min(ans, tmp)
print(ans)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,765 |
s392795544 | p04031 | u227085629 | 1589856214 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 202 | n = int(input())
a = list(map(int,input().split()))
asum = sum(a)
a2sum = 0
for m in a:
a2sum += m**2
x1 = asum//n
x2 = x1+1
z1 = n*x1**2-2*asum*x1+a2sum
z2 = n*x2**2-2*asum*x2+a2sum
print(min(z1,z2)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,766 |
s191054228 | p04031 | u038815010 | 1589855828 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 151 | ans=0
n=int(input())
res=0
a=list(map(int,input().split()))
b=sum(a)//n
c=b+1
for i in a:
ans+=abs(i-b)**2
res+=abs(i-c)**2
print(min(ans,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,767 |
s713447238 | p04031 | u888100977 | 1589849030 | Python | Python (3.4.3) | py | Accepted | 27 | 3060 | 200 | n = int(input())
a = list(map(int, input().split()))
ans = float('inf')
for i in range(-100, 101):
dummy = 0
for a_i in a:
dummy += pow((a_i-i), 2)
ans = min(ans, dummy)
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,768 |
s257254223 | p04031 | u902151549 | 1589794832 | Python | Python (3.4.3) | py | Accepted | 88 | 8148 | 3,579 | # coding: utf-8
import re
import math
from collections import defaultdict
from collections import deque
from fractions import Fraction
import itertools
from copy import deepcopy
import random
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
#@lru_cache(maxsize=None)
readline... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,769 |
s014780259 | p04031 | u902151549 | 1589794760 | Python | Python (3.4.3) | py | Accepted | 60 | 6748 | 3,647 | # coding: utf-8
import re
import math
from collections import defaultdict
from collections import deque
from fractions import Fraction
import itertools
from copy import deepcopy
import random
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
#@lru_cache(maxsize=None)
readline... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,770 |
s074071442 | p04031 | u902151549 | 1589794471 | Python | Python (3.4.3) | py | Accepted | 61 | 6620 | 3,625 | # coding: utf-8
import re
import math
from collections import defaultdict
from collections import deque
from fractions import Fraction
import itertools
from copy import deepcopy
import random
import time
import os
import queue
import sys
import datetime
from functools import lru_cache
#@lru_cache(maxsize=None)
readline... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,771 |
s872108195 | p04031 | u679089074 | 1589745023 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 141 | N = int(input())
an = list(map(int,input().split()))
ave = round((sum(an)/N),0)
ans = 0
for i in an:
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,206,772 |
s334972042 | p04031 | u953110527 | 1589665447 | Python | Python (3.4.3) | py | Accepted | 19 | 3064 | 148 | N = int(input())
a = list(map(int,input().split()))
b = sum(a)
b = int((b+0.5*N) // N)
ans = 0
for i in range(N):
ans += (a[i]-b)**2
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,773 |
s049196033 | p04031 | u480300350 | 1589655540 | Python | Python (3.4.3) | py | Accepted | 18 | 3064 | 3,050 | #!/usr/bin/env python3
import sys
import math
# from string import ascii_lowercase, ascii_upper_case, ascii_letters, digits, hexdigits
# import re # re.compile(pattern) => ptn obj; p.search(s), p.match(s), p.finditer(s) => match obj; p.sub(after, s)
# from operator import itemgetter ... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,774 |
s205994650 | p04031 | u896847891 | 1589651679 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 175 | n = int(input())
a = list(map(int, input().split()))
ans = 10000000
for i in range(-100, 101):
sm = 0
for x in a:
sm += (x-i) ** 2
ans = min(ans, sm)
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,775 |
s788831026 | p04031 | u662430503 | 1589598905 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 192 | def main():
n=int(input())
num = list(map(int,input().split()))
ave=round(sum(num)/len(num))
ans=0
for i in range(0,len(num)):
ans+=(ave-num[i])*(ave-num[i])
print(ans)
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,776 |
s960722183 | p04031 | u427984570 | 1589509565 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 143 | n = int(input())
l = list(map(int,input().split()))
m = round(sum(l)/len(l))
ans = 0
for i in range(len(l)):
ans += (m - l[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,206,777 |
s310340954 | p04031 | u844895214 | 1589504297 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 453 | from sys import stdin
def S(): return stdin.readline().rstrip()
def I(): return int(stdin.readline().rstrip())
def LS(): return list(stdin.readline().rstrip().split())
def LI(): return list(map(int,stdin.readline().rstrip().split()))
def cost(x,y):
return pow(x-y,2)
n = I()
a = LI()
sum = 0
for i in range(n):
... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,778 |
s904137268 | p04031 | u127499732 | 1589493723 | Python | Python (3.4.3) | py | Accepted | 27 | 3316 | 380 | def main():
from collections import Counter
n, *a = map(int, open(0).read().split())
c = Counter(a)
d = list(c.keys())
x, y = min(d), max(d)
ans = float("Inf")
for i in range(x, y + 1):
tmp = 0
for k, v in c.items():
tmp += (k - i) ** 2 * v
ans = 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,779 |
s847015418 | p04031 | u513081876 | 1589465693 | Python | PyPy3 (7.3.0) | py | Accepted | 68 | 62108 | 273 | n = int(input())
a = [int(i) for i in input().split()]
num = int(sum(a) / len(a))
check = [num -3, num - 2, num -1, num, num + 1, num + 2, num +3]
ans = float('inf')
for i in check:
cnt = 0
for j in a:
cnt += (i - j) ** 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,780 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.