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 |
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
s530611187 | p04031 | u627600101 | 1581992882 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 205 | N=int(input())
a=list(map(int,input().split()))
avg=0
for j in range(N):
avg+=a[j]
avg=avg/N
t=int(avg)
if abs(t-avg)>abs(t+1-avg):
t=t+1
cost=0
for j in range(N):
cost+=(a[j]-t)**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,981 |
s767650529 | p04031 | u007263493 | 1581900717 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 181 | n = int(input())
a = list(map(int,input().split()))
ans = 100000000
for i in range(-100, 101):
s = 0
for j in a:
s += (j - i) **2
ans = min(ans , s)
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,982 |
s349240397 | p04031 | u052221988 | 1581873000 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 267 | n = int(input())
numlist = [int(i) for i in input().split()]
cost = 0
ave_f = sum(numlist) / n
ave_ch = sum(numlist) // n
if ave_f - ave_ch >= 0.5 :
ave_i = ave_ch + 1
else :
ave_i = ave_ch
for i in range(n) :
cost += (ave_i - numlist[i]) ** 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,983 |
s874920582 | p04031 | u353099601 | 1581825893 | Python | Python (3.4.3) | py | Accepted | 40 | 5076 | 273 | # C - いっしょ
from decimal import Decimal, ROUND_HALF_UP
N = int(input())
a = list(map(int, input().split()))
m = Decimal(sum(a) / N).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
#print(sum(a) / N)
#print(m)
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,984 |
s451077438 | p04031 | u020390084 | 1581824365 | Python | Python (3.4.3) | py | Accepted | 24 | 3064 | 601 | #!/usr/bin/env python3
import sys
def solve(N: int, a: "List[int]"):
min_cost = 10**9
for target in range(-100,101):
tmp = 0
for i in range(N):
tmp += (a[i]-target)**2
min_cost = min(min_cost,tmp)
print(min_cost)
return
def main():
def iterate_tokens():
... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,985 |
s368446150 | p04031 | u143212659 | 1581720498 | Python | Python (3.4.3) | py | Accepted | 23 | 3060 | 357 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
def main():
N = int(input())
A = list(map(int, input().split()))
result = sum([(a - max(A))**2 for a in A])
for i in range(min(A), max(A)):
tmp = sum([(i - a)**2 for a in A])
if result > tmp:
result = tmp
print(result)
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,986 |
s770567614 | p04031 | u746419473 | 1581714302 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 181 | n = int(input())
*a, = map(int, input().split())
ans = float("inf")
for i in range(-100, 101):
t = 0
for _a in a:
t += (i-_a)**2
ans = min(ans, t)
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,987 |
s296940999 | p04031 | u269408023 | 1581713595 | Python | Python (3.4.3) | py | Accepted | 29 | 3060 | 236 | def S(a,N,M):
m=0
for i in range(N):
m+=(a[i]-M)**2
return m
N=int(input())
a=[int(x) for x in input().split()]
m=S(a,N,-100)
for i in range(-99,101):
if m > S(a,N,i):
m=S(a,N,i)
print(m) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,988 |
s015825852 | p04031 | u534450736 | 1581711847 | Python | Python (3.4.3) | py | Accepted | 24 | 3064 | 236 | n = int(input())
A = list(map(int, input().split()))
minA = min(A)
maxA = max(A)
ans = float("inf")
for i in range(minA, maxA+1):
cost = 0
for a in A:
cost += (i - a)**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,206,989 |
s443180322 | p04031 | u953794676 | 1581709357 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 223 | n = int(input())
a = [int(e) for e in input().split()]
ans = float("inf")
MIN, MAX = min(a), max(a)
for i in range(MIN, MAX+1):
cost = 0
for j in a:
cost = cost + (i-j)**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,990 |
s930718146 | p04031 | u736729525 | 1581658679 | Python | Python (3.4.3) | py | Accepted | 20 | 3064 | 621 | N = int(input())
A = [int(x) for x in input().split()]
def solve(A):
def cost(x):
return sum((x -a)**2 for a in A)
l = min(A)
r = max(A)
l = -100
r = 100
while r - l >= 3:
d = (r - l) // 3
m1 = l + d
m2 = m1 + d
#print(cost(l), cost(r), "d=%d"%d, (l, m1,... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,991 |
s178125607 | p04031 | u344959886 | 1581633101 | Python | Python (3.4.3) | py | Accepted | 27 | 2940 | 190 | n = int(input())
a = list(map(int, input().split()))
aa = 10 ** 9
for i in range(min(a), max(a) + 1):
ans = 0
for j in a:
ans += (j - i) ** 2
aa = min(aa, ans)
print(aa)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,992 |
s221903783 | p04031 | u556610039 | 1581529359 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 147 | n = int(input())
a_i = list(map(int, input().split()))
ave = round(sum(a_i) / len(a_i))
ans = 0
for x in a_i:
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,993 |
s272278659 | p04031 | u670133596 | 1581505657 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 202 | N = int(input())
a = list(map(int, input().split()))
ans = float('INF')
for i in range(-100, 101):
sum = 0
for n in range(N):
sum += (a[n] - 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,994 |
s725480159 | p04031 | u103902792 | 1581389077 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 190 | n = int(input())
AS = list(map(int,input().split()))
cost = float('inf')
for i in range(min(AS),max(AS)+1):
c = 0
for a in AS:
c += (i-a)**2
if c < cost:
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,995 |
s836977922 | p04031 | u298297089 | 1581388772 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 215 | n = int(input())
a = list(map(int, input().split()))
ans = float('INF')
for i in range(min(a), max(a)+1):
cost = 0
for aa in a:
cost += (i - aa)**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,206,996 |
s935485484 | p04031 | u490553751 | 1581192116 | Python | Python (3.4.3) | py | Accepted | 53 | 5260 | 1,367 | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, asci... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,997 |
s191666775 | p04031 | u167988719 | 1581189015 | Python | Python (3.4.3) | py | Accepted | 23 | 3060 | 178 | _ = int(input())
A = list(map(int, input().split()))
mi, ma = min(A), max(A)
cost = 10**10
for x in range(mi, ma+1):
cost = min(cost, sum((x-a)**2 for a 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,206,998 |
s130118555 | p04031 | u083960235 | 1581106536 | Python | Python (3.4.3) | py | Accepted | 46 | 5320 | 1,367 | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, asci... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,206,999 |
s197330933 | p04031 | u732412551 | 1581016090 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 167 | N = int(input())
A = list(map(int, input().split()))
c = float("inf")
for m in range(sum(A)//N-1,sum(A)//N+2):
c = min(c, sum(map(lambda a: (a-m)**2, A)))
print(c) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,000 |
s484857258 | p04031 | u745812846 | 1580966895 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 149 | n = int(input())
A = list(map(int, input().split()))
def f(x):
return sum([(a_i-x)**2 for a_i in A])
print(min([f(x) for x 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,207,001 |
s781010340 | p04031 | u504836877 | 1580956493 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 171 | N = int(input())
A = [int(a) for a in input().split()]
x = int(sum(A)/N)
cnt1 = 0
cnt2 = 0
for a in A:
cnt1 += (a-x)**2
cnt2 += (a-x-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,002 |
s498256465 | p04031 | u885440767 | 1580943981 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 204 | n = int(input())
l = list(map(int,input().split()))
a1 = 0
a2 = 0
c1 = int(sum(l)/n)
c2 = c1 + 1
for i in range(len(l)):
a1 = a1 + (c1-l[i])**2
a2 = a2 + (c2-l[i])**2
ans = min(a1,a2)
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,003 |
s048787607 | p04031 | u572193732 | 1580927740 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 207 | N = int(input())
a = list(map(int, input().split()))
ans = 10**10
for i in range(-100, 101):
tmp = 0
for j in range(N):
tmp += (i - a[j]) ** 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,207,004 |
s470672629 | p04031 | u743164083 | 1580776369 | Python | Python (3.4.3) | py | Accepted | 29 | 3060 | 239 | n = int(input())
nums = list(map(int, input().split()))
nums_kazu = len(nums)
nums_sum = 0
average = 0
ans = 0
for i in nums:
nums_sum += i
average = round(nums_sum/nums_kazu)
for i in nums:
ans += abs(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,005 |
s445016247 | p04031 | u572142121 | 1580759910 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 156 | N=int(input())
A=list(map(int,input().split()))
b=sum(A)//N
a=b+1
c=b+1
x=0
y=0
z=0
for i in A:
x+=(a-i)**2
y+=(b-i)**2
z+=(c-i)**2
print(min(x,y,z)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,006 |
s224881321 | p04031 | u686230543 | 1580705603 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 218 | n = int(input())
a = list(map(int, input().split()))
mean = sum(a) / n
if mean >= -0.5:
common = int(mean + 0.5)
else:
common = int(mean - 0.5)
cost = 0
for i in range(n):
cost += (a[i] - common) ** 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,007 |
s063254828 | p04031 | u072717685 | 1580701278 | Python | Python (3.4.3) | py | Accepted | 36 | 5080 | 223 | import statistics
n = int(input())
a = [int(i) for i in input().split()]
m = int(((sum(a)/n)*2 + 1) //2)
# m = statistics.mean(a)
# m = int(m) + 1 if m % 1 > 0.5 else int(m)
r = 0
for i in a:
r += (i - m)**2
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,207,008 |
s110879155 | p04031 | u906481659 | 1580511914 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 337 | N = int(input())
a = list(map(int, input().split()))
import math
#残差最小化の解
x = sum(a)/N
x_large = math.ceil(x)
x_small = math.floor(x)
#大きい残差と小さい残差を計算
sum_large = 0
sum_small = 0
for i in a:
sum_large += (x_large-i)**2
sum_small += (x_small-i)**2
#最小残差
print(min(sum_large,sum_small)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,009 |
s547268198 | p04031 | u113971909 | 1580506238 | Python | Python (3.4.3) | py | Accepted | 23 | 3060 | 195 | N = int(input())
A = list(map(int,input().split()))
def dist(x):
ret = 0
for i in A:
ret+=(x-i)**2
return ret
ans = dist(100)
for X in range(-100,100):
ans=min(ans,dist(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,207,010 |
s156571120 | p04031 | u736995123 | 1580444256 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 249 | n = int(input())
s = [int(c) for c in input().split()]
def solution(s):
cost = 0
mean = round(sum(s)/len(s))
for i in s:
cost += abs(i-mean) ** 2
#print(f"DEBUG >> {mean} {i} {cost}")
return cost
print(solution(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,011 |
s046320259 | p04031 | u560867850 | 1580401494 | Python | Python (3.4.3) | py | Accepted | 30 | 3572 | 301 | import math
import sys
from functools import reduce
input = sys.stdin.readline
def fullsearch(a):
for i in range(-100, 101):
yield reduce(lambda total, x: (x - i) ** 2 + total, a, 0)
def main():
input()
A = [int(c) for c in input().split()]
print(min(fullsearch(A)))
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,012 |
s489601315 | p04031 | u219197917 | 1580401299 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 143 | n = int(input())
a = [int(i) for i in input().split()]
s = sum(a)
x = round(s / n)
y = sum([ai**2 for ai in a])
print(y - 2 * x * s + n * x**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,013 |
s874291468 | p04031 | u063073794 | 1580352957 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 185 | n=int(input())
c=list(map(int,input().split()))
minans=1000000000
for j in range(-101,101):
ans=0
for i in range(n):
ans+=(c[i]-j)**2
minans=min(ans,minans)
print(minans)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,014 |
s896429698 | p04031 | u644360640 | 1580233325 | Python | Python (3.4.3) | py | Accepted | 23 | 2940 | 187 | n = int(input())
a = list(map(int,input().split()))
a.sort()
ans = 10**9
for i in range(a[0],a[len(a)-1]+1):
temp = sum([(abs(j-i))**2 for j in a])
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,015 |
s309801723 | p04031 | u170183831 | 1580164784 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 163 | def solve(n, A):
ave = round(sum(A) / n)
return sum((a - ave) ** 2 for a in A)
_n = int(input())
_A = list(map(int, input().split()))
print(solve(_n, _A)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,016 |
s420688384 | p04031 | u989345508 | 1580156360 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 198 | n=int(input())
a=[int(i) for i in input().split()]
ans=10000000000000
for i in range(-100,101):
ans_sub=0
for j in range(n):
ans_sub+=(a[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,207,017 |
s149957726 | p04031 | u098012509 | 1580080158 | Python | Python (3.4.3) | py | Accepted | 22 | 3060 | 348 | import sys
input = sys.stdin.readline
def main():
N = int(input())
A = [int(x) for x in input().split()]
ans = float("inf")
for j in range(-101, 101):
tmp = 0
for i in A:
tmp += (i - j) ** 2
ans = min(ans, tmp)
print(ans)
if __name__ == '__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,018 |
s004293457 | p04031 | u578953945 | 1579974669 | Python | Python (3.4.3) | py | Accepted | 28 | 3064 | 410 | def pow_k(x, n):
"""
O(log n)
"""
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K *= x
x *= x
n //= 2
return K * x
N=int(input())
L=list(map(int,input().split()))
import sys
ans = sys.maxsize
for i in range(-100,101):
m_diffs = 0
fo... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,019 |
s289362279 | p04031 | u811967730 | 1579824142 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 163 | N = int(input())
a = list(map(int, input().split()))
average = (sum(a) + N // 2) // N
cost = 0
for i in range(N):
cost += (average - a[i]) ** 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,020 |
s124477562 | p04031 | u506287026 | 1579759264 | Python | Python (3.4.3) | py | Accepted | 21 | 3060 | 328 | n = int(input())
nums = sorted([int(i) for i in input().split()])
# n = 3
# nums = [1, 1, 3]
median = nums[n//2]
mean = sum(nums) // n
ans = 10 ** 10
for diff in range(min(median, mean), max(median, mean)+2):
diff_sum = 0
for num in nums:
diff_sum += (num - diff) ** 2
ans = min(ans, diff_sum)
pri... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,021 |
s749227597 | p04031 | u531436689 | 1579752003 | Python | Python (3.4.3) | py | Accepted | 47 | 5460 | 772 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque
sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7
DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,022 |
s932361809 | p04031 | u071868443 | 1579671884 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 222 | N = int(input())
nolist = list(map(int, input().split()))
minimum = 10**9
for i in range(min(nolist), max(nolist)+1):
cost = sum((i-nolist[j])**2 for j in range(N))
if cost < minimum:
minimum = cost
print(minimum)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,023 |
s587000575 | p04031 | u823044869 | 1579619547 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 284 | n = int(input())
dList = list(map(int,input().split()))
sD = sum(dList)/n
ig = int(sD)
po = sD-int(sD)
ad = 0
if abs(po) >= 0.5:
if sD >= 0:
ad = ig + 1
else:
ad = ig -1
else:
ad = ig
result = 0
for i in range(len(dList)):
result += (dList[i]-ad)**2
print(result)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,024 |
s664274393 | p04031 | u355865104 | 1579576851 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 358 |
if __name__ == "__main__":
N = int(input())
a_str = list(map(int, input().split(" ")))
min_a = min(a_str)
max_a = max(a_str)
min = float("inf")
ans = 0
for i in range(min_a, max_a):
temp = sum(list(map(lambda x: (x - i)**2, a_str)))
if min > temp:
min = temp
... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,025 |
s793710222 | p04031 | u149991748 | 1579571701 | Python | Python (3.4.3) | py | Accepted | 23 | 3060 | 207 | n = int(input())
a = list(map(int,input().split()))
cost = []
for i in range(-100,101):
cc = 0
for j in range(n):
cc += (i - a[j])*(i - a[j])
cost.append(cc)
cost.sort()
print(cost[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,026 |
s865886245 | p04031 | u638006405 | 1579560276 | Python | Python (3.4.3) | py | Accepted | 24 | 3064 | 300 | n = int(input())
a = [int(i) for i in input().split(' ')]
num_of_equal = sum([1 for i, j in zip(a[:-1], a[1:]) if i == j]) + 1
if num_of_equal == len(a): print(0)
else:
answer = []
for y in range(min(a), max(a)+1):
answer.append(sum([(x - y)**2 for x in a]))
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,207,027 |
s530986321 | p04031 | u106342872 | 1579387500 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 245 | n = int(input())
a = input().split()
a = list(map(int,a))
ave1 = sum(a) // len(a)
ave2 = ave1 + 1
cost1 = 0
for i in range(n):
cost1 += (a[i] - ave1)**2
cost2 = 0
for i in range(n):
cost2 += (a[i] - ave2)**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,028 |
s443283406 | p04031 | u548303713 | 1579289472 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 208 | n=int(input())
num=list(map(int,input().split()))
ans=10000000
for i in range(min(num),max(num)+1):
cost=0
for j in range(n):
cost+=((num[j]-i)**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,029 |
s893258551 | p04031 | u314089899 | 1579233983 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 349 | #043c
N = int(input()) #N <= 100
a_list = list(map(int, input().split())) #-100 <= ai <= 100
#ループ数は200*100 = 20000.総当たりでOK
min_cost = 111*(200**2)
for y in range(min(a_list),max(a_list) + 1):
cost = 0
for x in a_list:
cost += (x - y)**2
if cost < min_cost:
min_cost = cost
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,207,030 |
s316831116 | p04031 | u095426154 | 1579203895 | Python | Python (3.4.3) | py | Accepted | 39 | 5404 | 269 | # coding: utf-8
from statistics import mean
N=int(input())
A=list(map(int,input().split()))
a1=int(mean(A))
a2=a1+1
ans=10**9
tmp=0
for i in range(N):
tmp+=(A[i]-a1)**2
ans=min(ans,tmp)
tmp=0
for i in range(N):
tmp+=(A[i]-a2)**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,207,031 |
s310350979 | p04031 | u580697892 | 1579203667 | Python | Python (3.4.3) | py | Accepted | 27 | 3060 | 240 | # coding: utf-8
N = int(input())
A = list(map(int, input().split()))
A.sort()
ans = float("inf")
for i in range(A[0], A[-1]+1):
med = i
tmp = 0
for j in range(N):
tmp += (A[j] - med)**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,207,032 |
s493451517 | p04031 | u202570162 | 1579178676 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 101 | n=int(input())
a=[int(i) for i in input().split()]
x=round(sum(a)/n)
print(sum((x-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,207,033 |
s308413422 | p04031 | u867848444 | 1579058905 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 197 | n=int(input())
a=list(map(int,input().split()))
ans=float('inf')
num=-100
while num!=101:
kari=0
for i in range(n):
kari+=(num-a[i])**2
num+=1
ans=min(ans,kari)
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,034 |
s777580269 | p04031 | u671211357 | 1579056687 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 213 | import math
N=int(input())
A=list(map(int,input().split()))
ans = []
AV=sum(A)//N
for j in range(AV-10,AV+11):
kouho=[]
for i in A:
kouho.append((i-j)**2)
ans.append(sum(kouho))
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,035 |
s955496144 | p04031 | u225388820 | 1579054227 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 152 | n=int(input())
a=list(map(int,input().split()))
s=sum(a)//n
t=s+1
ans1=0
ans2=0
for i in a:
ans1+=(i-s)**2
ans2+=(i-t)**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,036 |
s269784479 | p04031 | u761989513 | 1579053896 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 131 | n = int(input())
a = list(map(int, input().split()))
b = round(sum(a) / n)
ans = 0
for i in a:
ans += (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,207,037 |
s691924474 | p04031 | u576917603 | 1578864486 | Python | Python (3.4.3) | py | Accepted | 19 | 3188 | 784 | n=int(input())
a=list(map(int,input().split()))
def custom_round(number, ndigits=0):
if type(number) == int:#整数ならそのまま返す
return number
d_point = len(str(number).split('.')[1])#小数点以下が何桁あるか定義
if ndigits >= d_point:#求める小数点以下の値が引数より大きい場合はそのまま返す
return number
c = (10 ** d_point) * 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,038 |
s550358722 | p04031 | u994521204 | 1578761881 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 275 | n=int(input())
A=list(map(int,input().split()))
A.sort()
p=n//2
q=n//2-1
ave=sum(A)//n
ave2=ave+1
ans1=0
ans2=0
ans3=0
ans4=0
for i in range(n):
ans1+=(A[i]-A[q])**2
ans2+=(A[i]-A[p])**2
ans3+=(A[i]-ave)**2
ans4+=(A[i]-ave2)**2
print(min(ans1,ans2,ans3,ans4)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,039 |
s333738231 | p04031 | u386089355 | 1578499207 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 145 | n = int(input())
ls = list(map(int, input().split()))
x = round(sum(ls) / n)
ans = 0
for i in range(n):
ans += (ls[i] - x) ** 2
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,040 |
s106367791 | p04031 | u797994565 | 1578433001 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 221 | N = int(input())
A = list(map(int,input().split()))
min_cost = 10**18
for i in range(min(A),max(A)+1):
cost = 0
for e in A:
cost += (e-i)**2
if cost < min_cost:
min_cost = cost
print(min_cost)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,041 |
s279232809 | p04031 | u152638361 | 1578419765 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 171 | import math
N = int(input())
a = list(map(int,input().split()))
ave = math.ceil(sum(a)/N-0.4999999999999999)
ans = 0
for i in range(N):
ans += (a[i]-ave)**2
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,042 |
s942632247 | p04031 | u348868667 | 1578369490 | Python | Python (3.4.3) | py | Accepted | 40 | 5204 | 242 | from decimal import Decimal, ROUND_HALF_UP, ROUND_HALF_EVEN
N = int(input())
a = list(map(int,input().split()))
ave = Decimal(str(sum(a)/N)).quantize(Decimal("0"),rounding=ROUND_HALF_UP)
cost = 0
for i in a:
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,207,043 |
s114600491 | p04031 | u452269253 | 1578278218 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 358 | N = int(input())
A = [int(i) for i in input().split()]
ave = sum(A)//len(A)
def cost(A,ave):
return sum(map(lambda x: (x - ave)**2, A))
c = cost(A, ave)
c1 = cost(A,ave+1)
if c < c1:
while c < c1:
ave -= 1
c, c1 = cost(A, ave), c
print(c1)
else:
while c > c1:
ave += 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,044 |
s807363117 | p04031 | u444238096 | 1578277070 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 189 | N = int(input())
mylist = list(map(int, input().split()))
s = sum(mylist)
N = len(mylist)
mean = round(s/N)
ans=0
for i in range(N):
ans=ans+(mylist[i]-mean)*(mylist[i]-mean)
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,045 |
s047991603 | p04031 | u047816928 | 1578248665 | Python | Python (3.4.3) | py | Accepted | 21 | 3060 | 169 | N = int(input())
A = list(map(int, input().split()))
ans = 10**10
for y in range(-100, 101):
cost = sum([(x-y)*(x-y) for x in A])
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,046 |
s901049524 | p04031 | u350836088 | 1578197758 | Python | Python (3.4.3) | py | Accepted | 36 | 5084 | 228 | from statistics import mean
import math
n = int(input())
a = list(map(int,input().split()))
m = mean(a)
u = math.ceil(m)
l = math.floor(m)
ans = 0
can = 0
for i in a:
ans += (i-u)**2
can += (i-l)**2
print(min(ans,can)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,047 |
s876287667 | p04031 | u906077984 | 1578176972 | Python | Python (3.4.3) | py | Accepted | 24 | 3060 | 228 | N = int(input())
a = list(map(int,input().split()))
min_num = min(a)
max_num = max(a)
ans = []
for num in range(min_num,max_num+1):
count = 0
for i in a:
count += (i-num)**2
ans.append(count)
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,048 |
s985946166 | p04031 | u648212584 | 1578172520 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 373 | import sys
input = sys.stdin.buffer.readline
def main():
N = int(input())
a = list(map(int,input().split()))
x = sum(a)/N - sum(a)//N
if 0 <= x < 0.5:
ch = sum(a)//N
else:
ch = -(-sum(a)//N)
ans = 0
for i in range(N):
ans += (ch-a[i]) ** 2
prin... | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,049 |
s482762352 | p04031 | u492447501 | 1578039368 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 235 | N = int(input())
*A, = map(int, input().split())
min = float("inf")
for y in range(-100, 101, 1):
sum = 0
for a in range(len(A)):
sum = sum + (A[a]-y)**2
if min > sum:
min = sum
ans = y
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,207,050 |
s577658067 | p04031 | u677121387 | 1577996987 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 201 | n = int(input())
a = [int(i) for i in input().split()]
ans = 10**9
for i in range(min(a),max(a)+1):
cost = 0
for j in range(n):
cost += (a[j]-i)**2
ans = min(cost, ans)
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,051 |
s246805663 | p04031 | u677121387 | 1577996033 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 137 | n = int(input())
a = [int(i) for i in input().split()]
b = round(sum(a)/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,207,052 |
s833708030 | p04031 | u263226212 | 1577994778 | Python | Python (3.4.3) | py | Accepted | 21 | 3192 | 161 | # -*- coding: utf-8 -*-
N = int(input())
A = list(map(int, input().split()))
ave = round(sum(A) / N)
ans = 0
for a in A:
ans += (a - ave) ** 2
print(ans)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,053 |
s496073671 | p04031 | u735069283 | 1577853949 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 192 | N = int(input())
A =[int(x) for x in input().split()]
result=float('inf')
for i in range(min(A),max(A)+1):
s=0
for j in range(N):
s += (i-A[j])**2
result=min(result,s)
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,207,054 |
s834598644 | p04031 | u143903328 | 1577848813 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 247 | N = int(input())
##N, M = map(int, input().split())
D = list(map(int, input().split()))
if sum(D) > 0:
target = int(sum(D) / N + 0.5)
else:
target = int(sum(D) / N - 0.5)
ans = 0
for i in D:
ans += (target - i)*(target - i)
print(ans) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,055 |
s566170986 | p04031 | u300579805 | 1577660850 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 223 | N = int(input())
A = list(map(int, input().split()))
min_a = min(A)
max_a = max(A)
ans = float('inf')
for i in range(min_a,max_a+1):
num = 0
for a in A:
num += (a-i)**2
ans = min(ans,num)
print(ans)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,056 |
s888273750 | p04031 | u683134447 | 1577568454 | Python | Python (3.4.3) | py | Accepted | 24 | 2940 | 208 | n = int(input())
al = list(map(int,input().split()))
min_a = float("inf")
for i in range(-100, 101):
tmp = 0
for a in al:
tmp += (i - a) ** 2
if tmp < min_a:
min_a = tmp
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,207,057 |
s177240099 | p04031 | u401452016 | 1577505741 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 198 | #ABC 043C いっしょ
import sys
n =int(sys.stdin.readline())
A = list(map(int, sys.stdin.readline().split()))
ave = round(sum(A)/n)
#print(ave)
ans =0
for a in A:
ans += (a-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,058 |
s727083130 | p04031 | u581187895 | 1577476565 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 212 | N = int(input())
A = list(map(int, input().split()))
if set(A) == 1:
print(0)
exit()
ans = 1<<60
for i in range(-100, 101):
cost = 0
for a in A:
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,059 |
s024257265 | p04031 | u327532412 | 1577474454 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 176 | n = int(input())
*a, = map(int, input().split())
atai = round(sum(a) / n)
ans = 0
for x in a:
if x == atai:
pass
else:
ans += (x - atai) ** 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,060 |
s359787155 | p04031 | u560301743 | 1577416553 | Python | Python (3.4.3) | py | Accepted | 23 | 3060 | 320 | def solve(n: int, values: list) -> int:
min_cost = 10000 * n
for target in range(-100, 100 + 1):
cost = sum([(v - target) ** 2 for v in values])
if cost < min_cost:
min_cost = cost
return min_cost
N = int(input())
values = list(map(int, input().split()))
print(solve(N, values)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,061 |
s604929401 | p04031 | u426572476 | 1577416161 | Python | Python (3.4.3) | py | Accepted | 44 | 5172 | 228 | import math
import fractions
n = int(input())
a = [int(i) for i in input().split()]
ans = 10 ** 6
for i in range(min(a), max(a) + 1):
cost = 0
for j in a:
cost += (i - j) ** 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,062 |
s785777993 | p04031 | u810457760 | 1577324079 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 121 | n = int(input())
a = list(map(int, input().split()))
s = round(sum(a)/n)
ans = 0
for i in a:
ans += (i-s)**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,063 |
s025729849 | p04031 | u008357982 | 1577275558 | Python | Python (3.4.3) | py | Accepted | 25 | 2940 | 182 | n = int(input())
a = list(map(int, input().split()))
ans = 2 * 10**6
for i in range(-100, 101):
x = 0
for j in a:
x += abs(i - j)**2
ans = min(ans, x)
print(ans)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,064 |
s213049694 | p04031 | u540761833 | 1577233031 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 184 | N = int(input())
a = list(map(int,input().split()))
x = sum(a)//N
x1 = x + 1
ans1 = 0
ans2 = 0
for i in range(N):
ans1 += (a[i]-x)**2
ans2 += (a[i]-x1)**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,065 |
s847323497 | p04031 | u371132735 | 1577222493 | Python | Python (3.4.3) | py | Accepted | 20 | 3060 | 273 | def calc_cost(i,an):
ans = 0
for a in an:
ans += (i-a)*(i-a)
return ans
n = int(input())
an = list(map(int,input().split()))
ans = 0
cost = 0
pre = 10000000000
for i in range(min(an),max(an)):
x = calc_cost(i,an)
if pre > x:
ans = x
pre = 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,207,066 |
s875518264 | p04031 | u171065106 | 1577166808 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 144 | n = int(input())
a = list(map(int, input().split()))
mean = round(sum(a)/len(a))
costs = 0
for i in a:
costs += (i-mean)**2
print(costs)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,067 |
s193645080 | p04031 | u768896740 | 1577153867 | Python | Python (3.4.3) | py | Accepted | 26 | 3064 | 306 | n = int(input())
a = list(map(int, input().split()))
if len(set(a)) == 1:
print(0)
exit()
mi = min(a)
ma = max(a)
min_sum = 1000000000000000000
for i in range(mi, ma+1):
sum = 0
for j in range(n):
sum += (a[j] - i)**2
if sum < min_sum:
min_sum = sum
print(min_sum)
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,068 |
s044128535 | p04031 | u892538842 | 1577145745 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 230 | n = int(input())
s = list(map(int, input().split()))
total = sum(s)
lower_mean = total // n
upper_mean = total // n + 1
r1 = sum([(x-lower_mean) ** 2 for x in s])
r2 = sum([(x-upper_mean) ** 2 for x in s])
r = min(r1, r2)
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,207,069 |
s870460524 | p04031 | u710659690 | 1577137489 | Python | Python (3.4.3) | py | Accepted | 22 | 3064 | 268 | N = int(input())
A = list(map(int, input().split()))
I1 = sum(A)//N
I0 = I1 - 1
I2 = I1 + 1
cost0 = 0
cost1 = 0
cost2 = 0
for a in A:
cost0 = cost0 + (a-I0)*(a-I0)
cost1 = cost1 + (a-I1)*(a-I1)
cost2 = cost2 + (a-I2)*(a-I2)
print(min(min(cost1, cost2), cost0)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,070 |
s643931372 | p04031 | u488884575 | 1576789471 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 342 | N = int(input())
A = list(map(int, input().split(" ")))
# 割り切れる
if sum(A)%len(A) == 0:
avrA = sum(A)/len(A)
# 割り切れない
else:
if (sum(A) / len(A)) < (sum(A) // len(A) + 0.5):
avrA = sum(A) // len(A)
else:
avrA = sum(A) // len(A) +1
dst = 0
for i in A:
dst += (i-avrA)**2
print(int(dst))
#print(int(avrA)) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,071 |
s858637188 | p04031 | u186206732 | 1576643661 | Python | Python (3.4.3) | py | Accepted | 23 | 3060 | 302 | # ABC043 C
import math
n = int(input())
a = list(map(int, input().split()))
def cost(l,N):
total = 0
for i in l:
total += (i-N)**2
return total
ans = 100000000
for i in range(-100,101):
check = cost(a,i)
if check < ans:
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,207,072 |
s878994515 | p04031 | u202688141 | 1576541286 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 307 | number = int(input())
number_list = list(map(int, input().split()))
num = 0
for i in number_list:
num += i
ex = num // number
cost_list = []
def cul(ex):
cost = 0
for i in number_list:
cost += (ex - i)**2
cost_list.append(cost)
cul(ex)
cul(ex+1)
cul(ex-1)
print(min(cost_list))
| p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</var> equal <strong>integers</strong> by transforming some of them.</p>
<p>He may transform each integer at most ... | 2
4 8
| 8
| 1,207,073 |
s121454731 | p04031 | u669770658 | 1576511349 | Python | Python (3.4.3) | py | Accepted | 25 | 3060 | 260 | N = int(input())
a = [int(i) for i in input().split()]
li_ans = []
ans = 0
for j in range(min(a), max(a)):
for k in a:
ans += abs(k - j) ** 2
li_ans.append(ans)
ans = 0
if len(li_ans) == 0:
print(0)
else:
print(min(li_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,074 |
s510967779 | p04031 | u778720350 | 1576449067 | Python | Python (3.4.3) | py | Accepted | 17 | 2940 | 135 | n = int(input())
a = list(map(int, input().split(' ')))
r = round(sum(a) / len(a))
w = 0
for ae in a:
w += pow(ae - r, 2)
print(w) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,075 |
s332842939 | p04031 | u860819641 | 1576442454 | Python | Python (3.4.3) | py | Accepted | 17 | 3064 | 216 | N=int(input())
li = list(map(int,input().split()))
import math
av=sum(li)/N
if av-math.floor(av)<0.5:
m=math.floor(av)
else:
m=math.floor(av)+1
squaresum=0
for i in li:
squaresum+=(i-m)**2
print(squaresum) | p04031 | <span class="lang-en">
<p>Score : <var>200</var> points</p>
<div class="part">
<section>
<h3>Problem Statement</h3><p>Evi has <var>N</var> integers <var>a_1,a_2,..,a_N</var>. His objective is to have <var>N</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,076 |
s339348178 | p04031 | u309141201 | 1576437599 | Python | Python (3.4.3) | py | Accepted | 18 | 3060 | 333 | N = int(input())
a = list(map(int, input().split()))
A = 0
B = 0
for i in range(N): # AとBの計算
A += a[i] * a[i]
B += a[i]
# print(A - ((B * B) / N))
for Y in range(-100, 101):
temp = A - 2 * Y * B + N * Y * Y
if Y == -100:
ans = temp
else:
if temp <= ans:
ans = temp
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,207,077 |
s570347410 | p04031 | u905582793 | 1576420056 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 173 | n=int(input())
a=list(map(int,input().split()))
avg=sum(a)//n
ans=10**18
for i in (avg-1,avg,avg+1):
ansc=0
for j in a:
ansc+=(j-i)**2
ans=min(ans,ansc)
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,078 |
s732688574 | p04031 | u752907799 | 1576400526 | Python | Python (3.4.3) | py | Accepted | 22 | 2940 | 201 | N = int(input())
a = list(map(int, input().split()))
ans = (200**2)*N
for i in range(-100, 101):
tmp = 0
for b in a:
tmp += (b-i)*(b-i)
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,207,079 |
s509708101 | p04031 | u852798899 | 1576376752 | Python | Python (3.4.3) | py | Accepted | 17 | 3060 | 208 | n = int(input())
a = list(map(int, input().split()))
mid = sum(a)//len(a)
ans1 = 0
ans2 = 0
for i in a:
ans1 += pow(abs(i - mid),2)
ans2 += pow(abs(i - (mid+1)),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,080 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.