input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n = int(eval(input()))
a = list(map(int, input().split()))
A = 0
B = 0
while(True):
mx = max(a)
if mx == -1: break
mx_idx = a.index(mx)
a[mx_idx] = -1
A += mx
mx = max(a)
if mx == -1: break
mx_idx = a.index(mx)
a[mx_idx] = -1
B += mx
print((A-B)) | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
a.reverse()
A = 0
B = 0
i = 0
while(True):
A += a[i]
i += 1
if i==n: break
B += a[i]
i += 1
if i==n: break
print((A-B)) | p03434 |
N=int(eval(input()))
L=list(map(int,input().split()))
L.sort(reverse=True)
Bob, Alice=0,0
for i in range(0,N,2):
Alice=Alice+L[i]
for i in range(1,N,2):
Bob=Bob+L[i]
print((Alice-Bob)) | N=int(eval(input()))
A=list(map(int,input().split()))
A.sort(reverse=True)
Alice=0
Bob=0
for i in range(N):
if i%2==0:
Alice += A[i]
else:
Bob += A[i]
print((Alice-Bob)) | p03434 |
n=int(eval(input()))
a=[int(i)for i in input().split()]
a.sort()
alice=0
bob=0
for i in range(n):
if i%2==0:
alice+=a.pop(-1)
else:
bob+=a.pop(-1)
print((alice-bob)) | n=int(eval(input()))
a=sorted([int(i)for i in input().split()])
res=0
for i in range(n):
tmp=a.pop(-1)
if i%2==0:
res+=tmp
else:
res-=tmp
print(res) | p03434 |
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse =True)
a = 0
b = 0
for i in range(len(A)):
if i%2==0:
a += A[i]
else:
b += A[i]
print((a-b)) | N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse =True)
a = sum(A[::2])
b = sum(A[1::2])
print((a-b)) | p03434 |
n = int(eval(input()))
l = list(map(int, input().split()))
l.sort(reverse=True)
a = 0
b = 0
for i, num in enumerate(l):
if i % 2 == 0:
a += num
else:
b += num
print((a-b))
| n = int(eval(input()))
l = list(map(int, input().split()))
l.sort(reverse=True)
a = sum(l[::2])
b = sum(l[1::2])
print((a-b))
| p03434 |
n = int(eval(input()))
nums = [int(x) for x in input().split()]
nums.sort(reverse=True)
print((sum(nums[::2]) - sum(nums[1::2]))) | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
alice = 0
bob = 0
turn = 0
for i in range(n):
if turn % 2 == 0:
alice += a[i]
turn += 1
else:
bob += a[i]
turn += 1
print((alice - bob)) | p03434 |
n = int(eval(input()))
a = list(map(int, input().split()))
al, bo = [], []
for i in range(n):
if i % 2 == 0:
al.append(max(a))
a.remove(max(a))
elif i % 2 == 1:
bo.append(max(a))
a.remove(max(a))
print((sum(al)-sum(bo)))
| n = int(eval(input()))
a = list(map(int, input().split()))
al, bo = [], []
for i in range(n):
if i % 2 == 0:
al.append(max(a))
a.remove(max(a))
else:
bo.append(max(a))
a.remove(max(a))
print((sum(al)-sum(bo)))
| p03434 |
n=int(eval(input()))
a=sorted(list(map(int,input().split())),reverse=True)
ans=0
for i in range(n):
if i%2==0:
ans+=a[i]
else:
ans-=a[i]
print(ans) | N=eval(input())
a=list(map(int,input().split()))
alice=0
bob=0
a=sorted(a,reverse=True)
for i in range(int(N)):
if i%2==0:
alice+=a[i]
else:
bob+=a[i]
print((alice-bob)) | p03434 |
n = int(eval(input()))
c = list(map(int,input().split()))
c.sort(reverse = True)
a = 0
b = 0
if n % 2 == 0:
for i in range(n // 2 ):
a += c[i * 2]
b += c[i * 2 + 1]
else:
for i in range(n // 2 ):
a += c[i * 2]
b += c[i * 2 + 1]
a += c[n - 1]
print((a - b)) | n = int(eval(input()))
data = list(map(int,input().split()))
data.sort(reverse = True)
print((sum(data[::2]) - sum(data[1::2]))) | p03434 |
N = int(eval(input()))
a = list(map(int, input().split()))
Alice = []
Bob = []
while a != []:
get = max(a)
Alice.append(get)
a.remove(get)
if a != []:
get = max(a)
Bob.append(get)
a.remove(get)
print((sum(Alice) - sum(Bob))) | N = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse=True)
print((sum(a[0::2]) - sum(a[1::2]))) | p03434 |
num = int(eval(input()))
alice = 0
bob = 0
cards = list(map(int,input().split()))
for i in range(1,num+1):
if i % 2 == 1:
alice += max(cards)
cards.remove(max(cards))
else:
bob += max(cards)
cards.remove(max(cards))
ans = alice - bob
print(ans)
| n = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse=True)
print((sum(a[::2]) - sum(a[1::2]))) | p03434 |
import sys
from collections import deque
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
a = LI()
a = sorted(a)
d = a... | import sys
from itertools import combinations
import math
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I(... | p03434 |
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort(reverse=True)
a.append(0)
Ali,Bob=0,0
for i in range(0,n,2):
Ali +=a[i]
Bob +=a[i+1]
print((Ali-Bob)) | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort(reverse=True)
Ali,Bob=0,0
for i in range(n):
if i%2==0:
Ali +=a[i]
else:
Bob +=a[i]
print((Ali-Bob)) | p03434 |
N = int(eval(input()))
card = list(map(int,input().split()))
A = 0
B = 0
card.sort(reverse = True)
while True:
A += card[0]
card.pop(0)
if not card:
break
B += card[0]
card.pop(0)
if not card:
break
print((A - B)) | N = int(eval(input()))
Li = list(map(int,input().split()))
Li = sorted(Li)
a = 0
b = 0
while True:
a += Li.pop()
if not Li:
break
b += Li.pop()
if not Li:
break
print((a - b)) | p03434 |
#B
n = int(eval(input()))
a = list(map(int, input().split()))
a_1 = sorted(a, reverse=True)
alice = 0
bob = 0
for i in range(0, len(a)):
if i % 2 != 0:
bob += a_1[i]
if i % 2 == 0:
alice += a_1[i]
print((alice - bob)) | #B
n = int(eval(input()))
a = list(map(int, input().split()))
a_1 = sorted(a, reverse=True)
alice = sum(a_1[::2])
bob = sum(a_1[1::2])
print((alice - bob)) | p03434 |
import sys
import subprocess
import re
import datetime
import os
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse=True)
Alice = 0
Bob = 0
for i in range(N):
if i%2 == 0:
Alice = Alice + A[i]
else:
Bob = Bob + A[i]
ans = (Alice - Bob)
print(ans) |
N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse=True)
Alice = 0
Bob = 0
for i in range(N):
if i%2 == 0:
Alice = Alice + A[i]
else:
Bob = Bob + A[i]
ans = (Alice - Bob)
print(ans) | p03434 |
n=int(eval(input()))
a=list(map(int,input().split()))
s=0
a.sort()
s=sum(a[:n:2])-sum(a[1:n:2])
if s>0:
print(s)
else:
print((-s)) | n=int(eval(input()))
a=list(map(int,input().split()))
s=0
a.sort()
s=sum(a[:n:2])-sum(a[1:n:2])
print((abs(s))) | p03434 |
N = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a, reverse=True)
alice = sum(a[::2])
bob = sum(a[1::2])
print((alice - bob)) | N = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a)[::-1]
alice = a[0::2]
bob = a[1::2]
print((sum(alice) - sum(bob))) | p03434 |
import sys
input = sys.stdin.readline
INF = float('inf')
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
alice = 0
bob = 0
for _ in range(N):
if len(A) != 0:
alice += A.pop(A.index(max(A)))
if len(A) != 0:
bob += A.... | import sys
input = sys.stdin.readline
INF = float('inf')
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
alice = 0
bob = 0
A = sorted(A, reverse=True)
for _ in range(N):
if len(A) != 0:
alice += A.pop(0)
if len(A) != 0:
... | p03434 |
n = int(eval(input()))
x = list(map(int, input().split()))
a=0
b=0
def max():
m = 0
j = 0
for i in range(len(x)):
if x[i]>m:
m=x[i]
j=i
x.pop(j)
return m
if n%2 == 0:
i=0
while i<n:
a += max()
b += max()
i += 2
else:
... | n = int(eval(input()))
x = list(map(int, input().split()))
a=0
b=0
x.sort(reverse=True)
for i in range(int(n/2)):
a += x[i*2]
b += x[i*2+1]
if n%2==1:
a+=x[n-1]
print((a-b)) | p03434 |
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.se... | #!/usr/bin/python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cac... | p03434 |
n = int(eval(input()))
a = list(map(int, input().split()))
def quicksort(array):
if len(array) < 2:
return(array)
else:
pivot = array[0]
less = [i for i in array[1:] if i <= pivot]
greater = [i for i in array[1:] if i > pivot]
return quicksort(greater) + [piv... | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().strip()
n = ni()
a = na()
a = sorted(a, reverse=True)
ai = [i for i in range(0,n,2)]
bi = [i for i in range(1,n,2)]
alice = 0
bob = 0
for i in ai:
alice += a[i]
... | p03434 |
N = int(eval(input()))
aList = list(map(int, input().split()))
aList.sort(reverse = True)
aPoint = 0
bPoint = 0
if N % 2 == 0:
for i in range(N//2):
aPoint += aList[2*i]
bPoint += aList[2*i + 1]
else:
for i in range(N//2):
aPoint += aList[2*i]
bPoint += aList[2*i + 1]... | N = int(eval(input()))
aList = list(map(int, input().split()))
aList.sort(reverse = True)
point = [0, 0]
for i in range(N):
point[i%2] += aList[i]
print((point[0] - point[1])) | p03434 |
n=int(eval(input()))
a=list(map(int,input().split()))
ali=0
bob=0
a.sort(reverse=True)
for i in range(len(a)):
if i%2==0:
ali+=a[i]
else:
bob+=a[i]
print((ali-bob)) | n=int(eval(input()))
a=list(map(int,input().split()))
a.sort(reverse=True)
alice=sum(a[::2])
bob=sum(a[1::2])
print((alice-bob)) | p03434 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
Alice = Bob = 0
for i in range(N):
if i%2==0:
Alice+=A[i]
else:
Bob+=A[i]
print((Alice-Bob)) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
Alice = sum(A[0::2])
Bob = sum(A[1::2])
print((Alice-Bob)) | p03434 |
N = int(eval(input()))
a = list(map(int, input().split()))
alice = 0
bob = 0
a.sort()
a.reverse()
for i in range(len(a)):
if i%2 == 0:
alice += a[i]
else:
bob += a[i]
print((alice-bob)) | n = int(eval(input()))
a = list(map(int, input().split()))
alice = 0
bob = 0
for i in range(1,len(a)+1):
if i % 2 != 0:
alice += a.pop(a.index(max(a)))
else:
bob += a.pop(a.index(max(a)))
print((alice - bob))
| p03434 |
n = int(eval(input()))
a = list(map(int, input().split()))
Alice = []
Bob = []
while 0 < len(a):
Alice.append(a.pop(a.index(max(a))))
if 0 < len(a):
Bob.append(a.pop(a.index(max(a))))
print((sum(Alice) - sum(Bob))) | n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
print((sum(a[0::2])-sum(a[1::2]))) | p03434 |
n = int(eval(input()))
a = list(map(int, input().split()))
Alice = 0
Bob = 0
ans = 0
while len(a) != 0:
Alice += max(a)
a.remove(max(a))
if a:
Bob += max(a)
a.remove(max(a))
ans = Alice - Bob
print(ans)
| n = int(eval(input()))
a = sorted(list(map(int, input().split())), reverse=True)
print((sum(a[::2]) - sum(a[1::2]))) | p03434 |
N=int(eval(input()))
A=sorted(list(map(int,input().split())))
if N%2==0:
a=0
for i in range(int(N/2)):
a+=A[2*i+1]-A[2*i]
else:
a=A[0]
for i in range(int(N/2)):
a+=A[-(2*i+1)]-A[-(2*i+2)]
print(a) | N=eval(input())
c=sorted(list(map(int,input().split())))[::-1]
n=0
for i in c[0::2]:
n+=i
for i in c[1::2]:
n-=i
print(n) | p03434 |
n = int(eval(input()))
A = list(map(int, input().split()))
alice = 0
bob = 0
for i in range(n):
if (i+1)%2 == 1:
alice += max(A)
else:
bob += max(A)
A.remove(max(A))
print((alice - bob)) | n = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
alice = 0
bob = 0
for i,a in enumerate(A):
if (i+1)%2 == 1:
alice += a
else:
bob += a
print((alice - bob)) | p03434 |
n = int(eval(input()))
card_list = list(map(int,input().split(" ")))
card_list_ex = sorted(card_list, reverse=True)
alice,bob = 0,0
for i,j in enumerate(card_list_ex):
if i % 2 == 0:
alice += j
else:
bob += j
res = alice - bob
print(res) | # coding: utf-8
# Your code here!
num = int(eval(input()))
s = sorted(list(map(int,input().split())) ,reverse=True)
#print(s)
alice,bob = 0,0
for i,j in enumerate(s):
if i % 2 == 0:
alice += j
else:
bob += j
print((alice - bob))
| p03434 |
n=int(eval(input()))
a=list(map(int,input().split()))
a.sort(reverse=True)
print((sum(a[::2])-sum(a[1::2]))) | n,*a=list(map(int,open(0).read().split()))
a.sort()
print((sum(a[-1::-2])-sum(a[-2::-2]))) | p03434 |
n = int(eval(input()))
c = list(map(int, input().split()))
c.sort(reverse=True)
a = sum([v for i, v in enumerate(c) if i % 2 == 0 ])
b = sum([v for i, v in enumerate(c) if i % 2 == 1 ])
print((a - b)) | n = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse=True)
ans = sum(A[::2]) - sum(A[1::2])
print(ans) | p03434 |
n = int(eval(input()))
alist = list(map(int, input().split()))
alist.sort(reverse=True)
p1 = []
p2 = []
for i in range(n):
if i%2 == 0:
p1.append(alist.pop(0))
else:
p2.append(alist.pop(0))
print((sum(p1)-sum(p2))) | N = int(eval(input()))
A = sorted(list(map(int, input().split())), reverse=True)
A_cards = []
B_cards = []
flag = 'A'
for card in A:
if flag == 'A':
flag = 'B'
A_cards.append(card)
elif flag == 'B':
flag = 'A'
B_cards.append(card)
print((sum(A_cards) - sum(B_cards))) | p03434 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse = True)
alice = bob = 0
for i in range(N):
if i%2 == 0:
alice += A.pop(0)
else:
bob += A.pop(0)
print((alice - bob)) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort(reverse = True)
alice = bob = 0
for i in range(N):
if i%2 == 0:
alice += A[i]
else:
bob += A[i]
print((alice - bob)) | p03434 |
N = int(eval(input()))
A = sorted(list(map(int,input().split())), reverse = True)
alice = 0
bob = 0
for i in range(N):
if(i%2 == 0):
alice += A[i]
else:
bob += A[i]
print((alice-bob)) | N = int(eval(input()))
A = sorted(list(map(int,input().split())), reverse = True)
alice, bob = 0, 0
for i in range(N):
if(i%2 == 0):
alice += A[i]
else:
bob += A[i]
print((alice - bob)) | p03434 |
n=int(eval(input()))
a=sorted(list(map(int,input().split())),reverse=True)
alice=sum(a[::2])
bob=sum(a[1::2])
print((alice-bob)) | n=int(eval(input()))
a=sorted(list(map(int,input().split())),reverse=True)
print((sum(a[::2])-sum(a[1::2]))) | p03434 |
n=int(eval(input()))
s=list(map(int,input().split()))
s.sort(reverse=True)
a=[int(i) for i in s[::2]]
b=[int(j) for j in s[1::2]]
print((sum(a)-sum(b))) | n=int(eval(input()))
a=sorted(list(map(int,input().split())))
print((sum(a[-1::-2])-sum(a[-2::-2])))
| p03434 |
N = int(eval(input()))
a = list(map(int,input().split()))
a.sort()
a.reverse()
Alice = []
Bob = []
if N % 2 == 0:
for i in range(N//2):
Alice.append(a[i*2])
Bob.append(a[i*2+1])
print((sum(Alice) - sum(Bob)))
elif N % 2 == 1 and N != 1:
for i in range((N-1)//2):
Alice.ap... | N = int(eval(input()))
A = list(map(int,input().split()))
A.sort(reverse = True)
Alice = []
Bob = []
while len(A) != 0:
Alice.append(A[0])
A = A[1:]
if len(A) != 0:
Bob.append(A[0])
A = A[1:]
print((sum(Alice)-sum(Bob))) | p03434 |
n = eval(input())
cards = list(map(int, input().split()))
sorted_cards = sorted(cards, reverse=True)
alice, bob = [], []
for index, card in enumerate(sorted_cards):
if index % 2 == 0:
alice.append(card)
else:
bob.append(card)
print((sum(alice) - sum(bob))) | n = eval(input())
sorted_cards = sorted(list(map(int, input().split())), reverse=True)
print((sum(sorted_cards[::2]) - sum(sorted_cards[1::2]))) | p03434 |
n = int(eval(input()))
a_list = list(map(int, input().split()))
a_list = sorted(a_list, reverse=True)
alice_point = 0
bob_point = 0
for i in range(n):
if i % 2 == 0:
alice_point += a_list[i]
else:
bob_point += a_list[i]
print((alice_point - bob_point)) | n = int(eval(input()))
a_list = sorted(map(int, input().split()), reverse=True)
alice_score = sum(a_list[0::2])
bob_score = sum(a_list[1::2])
print((alice_score - bob_score)) | p03434 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort(reverse=True)
ans = sum(a[0::2]) - sum(a[1::2])
print(ans)
| n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
a.reverse()
print((sum(a[::2]) - sum(a[1::2])))
| p03434 |
N=eval(input())
a=input().split()
N=int(N)
for i in range(N):
a[i]=int(a[i])
point_a=0
point_b=0
#全てのカードがなくなるまで（＝すべての変数値が0になったらカード無）
#一番目に大きい数値をアリスに
#二番目に大きい数値をボブに
while max(a)>0:
#一番目に大きい数値をアリスに
point_a+=max(a)
#この数値をゼロに戻す
a[a.index(max(a))]=0
#二番目に大きい数値（この時点で一番大きい数値）をボブに
... | N=eval(input())
a=input().split()
N=int(N)
for i in range(N):
a[i]=int(a[i])
#処理
a=sorted(a,reverse=True)
score_a=0
score_b=0
for i in range(N):
if i%2==0:
score_a+=a[i]
else:
score_b+=a[i]
print((score_a-score_b)) | p03434 |
N = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a)[::-1]
Alice = 0
Bob = 0
for i in range(N):
if i % 2 == 0:
Alice += a[i]
else:
Bob += a[i]
print((Alice - Bob)) | N = int(eval(input()))
A = sorted(list(map(int, input().split())))
print((sum(A[-1::-2])-sum(A[-2::-2])))
| p03434 |
n = int(eval(input()))
A = sorted([int(i) for i in input().split()], reverse = True)
print((sum(A[::2]) - sum(A[1::2]))) | n = int(eval(input()))
A = [int(i) for i in input().split()]
A.sort(reverse = True)
x = A[::2]
print((sum(x) - (sum(A) - sum(x)))) | p03434 |
alice=0
bob=0
n=int(eval(input()))
a=list(map(int,input().split()))
def delete():
del a[a.index(Max)]
while n>=1:
Max=max(a)
alice=alice+Max
n=n-1
delete()
if n>=1:
Max=max(a)
bob=bob+Max
n=n-1
delete()
else:
print((alice-bob))
| n = eval(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
print((sum(a[::2]) - sum(a[1::2]))) | p03434 |
import itertools
u=[1,2,3,4,5,6,7,8,9]
a=0
n=list(map(int,input().split()))
for x in itertools.permutations(u):
f=0
for i in range(9):
if n[i]!=-1 and n[i]!=x[i]:f=1
if f:continue
if x[0]+x[2]+x[5]-x[8]+(x[1]+x[4]-x[7])*10+(x[3]-x[6])*100==0:a+=1
print(a) | def f(n,x):
for i in range(9):
if n[i] != -1 and n[i] != x[i]: return 1
import itertools
u=[1,2,3,4,5,6,7,8,9]
a=0
n=list(map(int,input().split()))
for x in itertools.permutations(u):
if f(n,x):continue
if x[0]+x[2]+x[5]-x[8]+(x[1]+x[4]-x[7])*10+(x[3]-x[6])*100==0:a+=1
print(a) | p00322 |
n = int(eval(input()))
x = list(map(int, input().split()))
f = 10**100
for p in range(min(x), max(x) + 1):
l = [(x[i] - p)**2 for i in range(n)]
f1 = sum(l)
f = min(f, f1)
print(f) | n = int(eval(input()))
x = list(map(int, input().split()))
x_mean = sum(x)/n
p1 = int(x_mean)
p2 = p1 + 1
if abs(x_mean - p1) > abs(x_mean - p2):
p = p2
else:
p = p1
ans = 0
for i in range(n):
ans += (x[i]-p)**2
print(ans) | p02767 |
N = int(eval(input()))
X = list(map(int, input().split()))
tairyoku = [0]*100
for i in range(100):
t=0
for j in range(N):
t += (X[j]-i)**2
tairyoku[i]=t
print((min(tairyoku))) | N = int(eval(input()))
X = list(map(int,input().split()))
power = [0 for i in range(100)]
for i in range(100):
for j in range(N):
power[i] += (X[j]-i)**2
print((min(power)))
| p02767 |
n = int(eval(input()))
x = list(map(int,input().split()))
S = sum(x)
Ave = sum(x) // n
m = 10**6
score = 0
for p in range(Ave,Ave+1001):
for i in range(n):
score += (x[i]-p)**2
if score < m:
m = score
score = 0
print(m) | #恐らく平均値に最も近い整数が答えになるかと思われる
n = int(eval(input()))
x = list(map(int,input().split()))
Ave = sum(x) / n
point = 0
for i in range(n):
point += (x[i]-round(Ave))**2
print(point) | p02767 |
N, *X = list(map(int, open(0).read().split()))
m = sum(X) // N
v1 = sum((v - m) ** 2 for v in X)
v2 = sum((v - m - 1) ** 2 for v in X)
print((min(v1, v2)))
|
N = int(eval(input()))
X = list(map(int, input().split()))
cand = sum(X) // N
ans0 = sum((v - cand) ** 2 for v in X)
ans1 = sum((v - cand - 1) ** 2 for v in X)
print((min(ans0, ans1)))
| p02767 |
n = int(eval(input()))
x = list(map(int, input().split()))
ans = 10 ** 9
for p in range(0, 101):
cnt = 0
for i in x:
cnt += (i-p)**2
ans = min(ans, cnt)
print(ans) | n = int(eval(input()))
x = list(map(int, input().split()))
ans1 = 0
ans2 = 0
xa = sum(x) // n
for i in x:
ans1 += (abs(i-xa))**2
for i in x:
ans2 += (abs(i-xa-1))**2
print((min(ans1, ans2)))
| p02767 |
def main():
from statistics import mean
from math import floor,ceil
n = int(eval(input()))
x = list(map(int, input().split()))
x_mean = mean(x)
if x_mean == 0.5:
greater_than_x = len([i for i in x if i > x_mean])
if greater_than_x * 2 >= n:
x_mean = ceil(x_mean)
else... | import sys
read = sys.stdin.read
def main():
n, *x = list(map(int, read().split()))
r = float('inf')
for i1 in range(1, 101):
rt = 0
for xe in x:
rt += (xe - i1)**2
r = min(r, rt)
print(r)
if __name__ == '__main__':
main()
| p02767 |
# C - Rally
def main():
N, *X = list(map(int, open(0).read().split()))
left, right = min(X), max(X)
ans = min(sum([(x - p) ** 2 for x in X]) for p in range(left, right + 1))
print(ans)
if __name__ == "__main__":
main()
| # C - Rally
def main():
N, *X = list(map(int, open(0).read().split()))
calc = lambda x, p: (x - p) ** 2
P = sum(X) // N
ans = min(sum(calc(x, p) for x in X) for p in range(P - 2, P + 2))
print(ans)
if __name__ == "__main__":
main()
| p02767 |
import math
from statistics import mean, median,variance,stdev
N = int(eval(input()))
X = list(map(int,input().split()))
a = sum(X)
ave = round(a/N)
b = 0
for i in range(N):
b +=(X[i]-ave)**2
print(b) | N = int(eval(input()))
X = list(map(int,input().split()))
ans = 10**8
c = int()
for i in range(1,100):
c = 0
for j in range(len(X)):
c += (X[j]-i)**2
if c < ans:
ans = c
print(ans) | p02767 |
import sys
readline = sys.stdin.readline
N = int(readline())
X = list(map(int, readline().split()))
X.sort()
INF = 10**9+7
ans = INF
for p in range(0, 102):
res = 0
for x in X:
res += (p-x)**2
ans = min(ans, res)
print(ans)
| n = int(eval(input()))
(*x,) = list(map(int, input().split()))
a = round(sum(x) / n)
print((sum(((i - a) ** 2) for i in x))) | p02767 |
n=int(eval(input()))
l=list(map(int,input().split()))
import statistics as st
m=round(st.mean(l))
print((sum((m-i)**2 for i in l))) | n=int(eval(input()))
l=list(map(int,input().split()))
m=round(sum(l)/n)
print((sum((m-i)**2 for i in l))) | p02767 |
N=int(eval(input()))
X=list(map(int,input().split()))
ans = 100000000
for j in range(1,100):
res = 0
for i in range(N):
res += (X[i]-j)**2
ans=min(ans,res)
print(ans)
| N=int(eval(input()))
X=sorted(list(map(int,input().split())))
ans = 100000000
for p in range(1,100): #Pの位置
sum = 0
for x in X: #Xの要素を１つずつ取得
sum += (x - p)**2
ans = min(sum, ans)
print(ans)
| p02767 |
n = int(eval(input()))
li = list(map(int,input().split()))
lia = []
for i in range(1,100):
a = 0
for j in range(n):
a += (abs(li[j]-i))**2
lia.append(a)
print((min(lia))) | n = int(eval(input()))
li = list(map(int,input().split()))
o1 = (sum(li))//n
o2 = o1 + 1
li1 = []
li2 = []
for i in range(n):
li1.append((int(li[i]-o1))**2)
for j in range(n):
li2.append((int(li[j]-o2))**2)
if sum(li1) >= sum(li2):
print((sum(li2)))
else:
print((sum(li1))) | p02767 |
a = int(eval(input()))
b = list(map(int, input().split()))
p = min(b)
saveans = 0
ans = 0
for x in b:
ans += (x - p) ** 2
while p <= max(b):
saveans = 0
for x in b:
saveans += (x - p) ** 2
if saveans < ans:
ans = saveans
p += 1
print(ans)
| a = int(eval(input()))
b = list(map(int, input().split()))
p = int(sum(b) / len(b))
ans1 = ans2 = 0
for x in b:
ans1 += (x - p) ** 2
ans2 += (x - 1 - p) ** 2
if ans1 > ans2:
print(ans2)
else:
print(ans1)
| p02767 |
eval(input())
x = sorted([int(i) for i in input().split()])
cost = sum([xi**2 for xi in x])
for p in range(x[0], x[-1] + 1):
c = 0
for xi in x:
c += (xi - p)**2
cost = min(c, cost)
print(cost) | n = int(eval(input()))
x = [int(i) for i in input().split()]
p = round(sum(x) / n)
print((sum((i - p)**2 for i in x))) | p02767 |
# -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
x = list(map(int, input().split()))
ans = float('inf')
for p in range(-100, 201):
summed = 0
for xi in x:
summed += (xi - p) ** 2
ans = min(ans, summed)
print(ans)
if __name__ ==... | # -*- coding: utf-8 -*-
def main():
n = int(eval(input()))
x = list(map(int, input().split()))
ans = float('inf')
# KeyInsight:
# xの座標の最小値から最大値までを探索すればよい
# See: https://img.atcoder.jp/abc156/editorial.pdf
left = min(x)
right = max(x)
for p in range(left, right + 1):... | p02767 |
n = int(eval(input()))
x = list(map(int, input().split()))
ans = float('inf')
for i in range(101):
now = 0
for j in range(n):
now += (x[j] - i) ** 2
ans = min(ans, now)
print(ans)
| n = int(eval(input()))
x = list(map(int, input().split()))
avg = sum(x) / n
if avg % 1 >= 0.5:
avg += 1
avg = int(avg)
ans = 0
for xi in x:
ans += (xi - avg) ** 2
print(ans) | p02767 |
N=int(eval(input()))
X=[int(i) for i in input().split(" ")]
sp=lambda P:sum([(Xi-P)**2 for Xi in X])
print((min([sp(p) for p in range(0,102)])))
| N=int(eval(input()))
if N==1:
print((0))
else:
X=[int(x) for x in input().split(" ")]
cons=lambda P:sum([(x-P)**2 for x in X])
print((min([cons(P) for P in range(0,102)])))
| p02767 |
'''
n = int(input())
n, m = map(int, input().split())
a = list(map(int, input().split()))
a = [int(input()) for i in range n]
p = [list(map(int, input().split()))]
a = input()
a, b = input().split()
a = [input() for i in range n]
'''
n = int(eval(input()))
x = list(map(int, input().split()))
import ma... |
n = int(eval(input()))
x = list(map(int, input().split()))
cost = 10**9
for i in range(1,100):
now = 0
for j in x:
now += (i-j)**2
if cost > now:
cost = now
print(cost)
| p02767 |
n = int(eval(input()))
x = list(map(int,input().split()))
a = min(x)
b = max(x) + 1
ans = 10 ** 8
for p in range(a,b):
m = 0
for i in range(n):
m += (x[i] - p) ** 2
ans = min(ans,m)
print(ans) | n = int(eval(input()))
x = list(map(int,input().split()))
ans = 10 ** 12
for i in range(1,101):
p = 0
for j in x:
p += (j - i) ** 2
ans = min(ans,p)
print(ans) | p02767 |
N = int(eval(input()))
x_list = list(map(int, input().split()))
maxValue = max(x_list)
minValue = 1000000
for i in range(1,100):
ans = 0
for j in range(N):
ans += ( x_list[j] - i ) **2
if(ans < minValue):
minValue = ans
print(minValue) |
N = int(eval(input()))
x_list = list(map(int, input().split()))
p = round( sum(x_list) / N )
ans = 0
for i in range(N):
# ans += round( (x_list[i] - p) ** 2 )
ans += (x_list[i] - p) ** 2
print(ans)
| p02767 |
import sys
l = sys.stdin.readline().strip()
N = int(l)
l = sys.stdin.readline().strip()
nums = list(map(int, l.split()))
nums = sorted(nums)
start = nums[0]
end = nums[-1] + 1
mi = float("INF")
def compute_dist(p):
dist = 0
for n in nums:
dist += (n-p) ** 2
return dist
for i in range(start, end)... | import sys
l = sys.stdin.readline().strip()
N = int(l)
l = sys.stdin.readline().strip()
nums = list(map(int, l.split()))
a = sum(nums) / len(nums)
a1 = int(a)
a2 = int(a) + 1
def count(p):
d = 0
for n in nums:
d += (n-p)**2
return d
print((min(count(a1), count(a2))))
| p02767 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(N: int, X: "List[int]"):
ans = INF
for i in range(1, 101):
t = 0
for j in range(N):
t += (X[j]-i)**2
ans = min(ans, t)
print(ans)
return
def main():
... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10000000)
INF = 1<<32
def solve(N: int, X: "List[int]"):
ans = INF
for i in range(1, 101):
cost = sum([(i-X[j])**2 for j in range(N)])
ans = min(ans, cost)
print(ans)
return
def main():
def iterate_tokens... | p02767 |
from sys import stdin
def main():
n = int(stdin.readline())
x = list(map(int, stdin.readline().split()))
p = sum(x) / n
p1 = int(p)
p2 = int(p + 1)
s1 = 0
s2 = 0
for xi in x:
s1 += (xi - p1) ** 2
s2 += (xi - p2) ** 2
print((min(s1, s2)))
... | from sys import stdin, setrecursionlimit
def main():
input = stdin.buffer.readline
n = int(eval(input()))
x = list(map(int, input().split()))
sum = 0
for xi in x:
sum += xi
ans_1 = sum // n
ans_2 = sum // n + 1
score_1 = 0
score_2 = 0
for xi in x:
... | p02767 |
n = int(eval(input()))
x = list(map(int,input().split()))
mint = 0
x.sort()
mid = int((x[0]+x[-1])/2)
def kyori(p):
m = 0
for i in range(n):
m += (p-x[i])**2
return m
while True:
midplus = mid - 1
midminus = mid + 1
if kyori(mid) > kyori(midplus):
mid = int((mid+midplus)/2)
elif k... | n = int(eval(input()))
x = list(map(int,input().split()))
k = []
def kyori(p):
m = 0
for i in range(n):
m += (p-x[i])**2
return m
for i in range(1,101):
k.append(kyori(i))
print((min(k))) | p02767 |
N = int(eval(input()))
x = list(map(int,input().split()))
l=[]
for p in range(1,101):
sum=0
for i in range(N):
sum += (x[i]-p)**2
l.append(sum)
print((sorted(l)[0])) | #!/usr/bin/env python3
# from numba import njit
# from collections import Counter
# from itertools import accumulate
# import numpy as np
# from heapq import heappop,heappush
# from bisect import bisect_left
INF = pow(10,6)
# @njit
def solve(n,a):
res = INF
for i in range(1,101):
res = min(r... | p02767 |
N = int(eval(input()))
s = list(map(int, input().split()))
m = s[0]
M = s[N-1]
lis = []
ans = 0
for i in range(1000):
for j in range(N):
ans += (s[j] - i) ** 2
lis.append(ans)
ans = 0
print((min(lis))) | N = int(eval(input()))
s = list(map(int, input().split()))
m = min(s)
M = max(s)
lis = []
ans = 0
for i in range(m,M + 1):
for j in range(N):
ans += (s[j] - i) ** 2
lis.append(ans)
ans = 0
print((min(lis))) | p02767 |
#!/usr/bin/env python3
n = int(eval(input()))
x = list(map(int,input().split()))
ans = 10**6
for i in range(1,101):
k = 0
for j in range(n):
k += (x[j]-i) **2
ans = min(ans,k)
print(ans) | #!/usr/bin/env python3
n = int(eval(input()))
x = list(map(int,input().split()))
print((sum((i-round(sum(x)/n))**2 for i in x)))
#x**2 - 2*x + p**2 をp で微分するとp 位置を動かしたときの増加量がわかる
# ２次方程式になっていて minは重心のとき round すれば良い | p02767 |
N = int(eval(input()))
X = list(map(int,input().split()))
ans=10**10
for i in range(2*10**5):
tmp=0
for x in X:
tmp += (i - x)**2
if ans>=tmp:
ans=tmp
print(ans) | N = int(eval(input()))
X = list(map(int,input().split()))
ans=10**10
for i in range(0,101):
tmp=0
for x in X:
tmp += (i - x)**2
if ans>=tmp:
ans=tmp
print(ans) | p02767 |
N=int(eval(input()))
X=list(map(int, input().split()))
ans=10**10
for i in range(100):
p=i+1
temp=0
for j in range(N):
temp+=(X[j]-p)**2
ans=min(ans,temp)
print(ans) | import sys
input = sys.stdin.readline
def I(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def LI(): return list(map(int, input().split()))
def main():
mod=10**9+7
N=I()
X=LI()
ans=10**10
for i in range(1,101):
temp=0
for j i... | p02767 |
n = int(eval(input()))
x = list(map(int, input().split()))
avg = round(sum(x) / n)
ans = 0
for i in x:
ans += (i - avg) ** 2
print(ans) | if __name__ == '__main__':
n = int(eval(input()))
x = list(map(int, input().split()))
p = round(sum(x) / n)
ans = 0
for i in x:
ans += (i - p) ** 2
print(ans)
| p02767 |
n = int(eval(input()))
X = list(map(int, input().split()))
ans = 1000000000
for p in range(1,101):
s = 0
for x in X:
s += (x-p)**2
ans = min(ans, s)
print(ans) | n,*X = list(map(int, open(0).read().split()))
p = round(sum(X)/n)
print((sum((x-p)**2 for x in X))) | p02767 |
n = int(eval(input()))
x = [int(i) for i in input().split()]
p = 10000000
for i in range(100):
pi = 0
for j in range(n):
pi += (x[j] - (i + 1))**2
if pi < p:
p = pi
# else:
# break
# p[i] += (x[j]-(i+1))**2
print(p) | n = int(eval(input()))
x = [int(i) for i in input().split()]
p = 10000000
for i in range(100):
pi = 0
for j in range(n):
pi += (x[j] - (i + 1))**2
if pi < p:
p = pi
else:
break
# p[i] += (x[j]-(i+1))**2
print(p) | p02767 |
def main():
n = int(eval(input()))
*xs, = list(map(int, input().split()))
ret = float('inf')
for p in range(100 + 1):
t = 0
for x in xs:
t += (p - x) ** 2
ret = min(ret, t)
print(ret)
if __name__ == '__main__':
main()
# import sys
#
# sys... | n = int(eval(input()))
xs = tuple(map(int, input().split()))
ret = min(
sum(
(x - p) * (x - p)
for x in xs
) for p in range(1, 100 + 1)
)
print(ret)
| p02767 |
N=int(eval(input()))
X=list(map(int,input().split()))
ans=float('inf')
for i in range(1,101):
res=0
for x in X:
res+=(i-x)**2
if ans>res:
ans=res
print(ans) | N=int(eval(input()))
X=list(map(int,input().split()))
X.sort()
ans=float('inf')
for p in range(1,101):
buf=0
for x in X:
buf+=(x-p)**2
ans=min(ans,buf)
print(ans) | p02767 |
def calc(s,t):
return (t-s)**2
n=int(eval(input()))
X=sorted(list(map(int,input().split())))
inf=float("inf")
ans=inf
for i in range(X[0],X[-1]+1):
u=0
for j in X:
u+=calc(i,j)
ans=min(ans,u)
print(ans) | n=int(eval(input()))
X=list(map(int,input().split()))
s=float("inf")
for i in range(min(X),max(X)+1):
d=0
for j in X:
d+=(j-i)**2
s=min(s,d)
print(s)
| p02767 |
n=int(eval(input()))
x=list(map(int,input().split()))
x.sort()
for p in range(x[0],x[len(x)-1]+1):
psum=0
for i in range(len(x)):
psum=psum+(x[0]-x[i])**2
# print(psum)
pmin=psum
for j in range(x[0]+1,x[len(x)-1]):
psum=0
for i in range(len(x)):
... | n=int(eval(input()))
x=list(map(int,input().split()))
x.sort()
psum=0
for i in range(len(x)):
psum=psum+(x[0]-x[i])**2
# print(psum)
pmin=psum
for j in range(x[0]+1,x[len(x)-1]):
psum=0
for i in range(len(x)):
psum=psum+(j-x[i])**2
# print(psum)
if pmin>psum:
... | p02767 |
_,*X=list(map(int,open(0).read().split()));print((min([sum((x-p)**2 for x in X) for p in range(min(X),max(X)+1)]))) | _ = int(eval(input()))
*X, = list(map(int, input().split()))
print((
min(
[sum([(x - p) ** 2 for x in X]) for p in range(min(X), max(X)+1)]
)
)) | p02767 |
def readinput():
n=int(eval(input()))
x=list(map(int,input().split()))
return n,x
def mean(x):
sum=0
for _ in x:
sum+=_
return sum/len(x)
def rss(x,xbar):
sum=0
for _ in x:
sum+=(_-xbar)**2
return sum
def main(n,x):
ans=0
xbar=mean(x)
... | def readinput():
n=int(eval(input()))
x=list(map(int,input().split()))
return n,x
def mean(x):
sum=0
for _ in x:
sum+=_
return sum/len(x)
def rss(x,xbar):
sum=0
for _ in x:
sum+=(_-xbar)**2
return sum
def main(n,x):
ans=0
xbar=mean(x)
... | p02767 |
import math
n = int(eval(input()))
x = list(map(int, input().split()))
p = sum(x) / len(x)
a1 = sum([(a - math.floor(p)) * (a - math.floor(p)) for a in x])
a2 = sum([(a - math.ceil(p)) * (a - math.ceil(p)) for a in x])
print((min(a1, a2))) | import math
n = int(eval(input()))
xs = list(map(int, input().split()))
p = sum(xs) / len(xs)
x1 = sum([(x - math.floor(p)) ** 2 for x in xs])
x2 = sum([(x - math.ceil(p)) ** 2 for x in xs])
print((min(x1, x2))) | p02767 |
import math
N = int(eval(input()))
X = list(map(int,input().split()))
medf = math.floor(sum(X)/N)
medc = math.ceil(sum(X)/N)
cf = 0
cc = 0
for i in range(N):
cf += (X[i] - medf)**2
cc += (X[i] - medc)**2
print((min(cf,cc))) | import math
N = int(eval(input()))
X = list(map(int,input().split()))
med = int(sum(X)/N + 0.5)
c = 0
for i in range(N):
c += (X[i] - med)**2
print(c)
| p02767 |
N = int(eval(input()))
l = list(map(int, input().split()))
k = []
for j in range(101):
ans=0
for i in range(N):
ans += (l[i] - j)**2
k.append(ans)
print((min(k))) | N = int(eval(input()))
l = list(map(int,input().split()))
s = []
for i in range(101):
x = 0
for j in l:
x += (j-i)**2
s.append(x)
print((min(s))) | p02767 |
N = int(eval(input()))
X = list(map(int,input().split()))
cmin = 10**6
for i in range(1,101):
cnt = 0
for j in range(N):
cnt += (i-X[j])**2
cmin = min(cmin,cnt)
print(cmin) | N = int(eval(input()))
X = list(map(int,input().split()))
cmin = 10**6+10
for i in range(101):
cnt = 0
for j in range(N):
cnt += (i-X[j])**2
cmin = min(cmin,cnt)
print(cmin) | p02767 |
N = int(eval(input()))
X = list(map(int, input().split()))
res = float('inf')
for i in range(-100, 101):
tmp = 0
for x in X:
tmp += (i - x) ** 2
res = min(tmp, res)
print(res) | N = int(eval(input()))
X = list(map(int, input().split()))
res = float('inf')
for i in range(min(X), max(X)+1):
tmp = 0
for x in X:
tmp += (i - x) ** 2
res = min(tmp, res)
print(res) | p02767 |
N = int(eval(input()))
X = list(map(int, input().split()))
al = []
for i in range(100):
d = 0
p = i+1
for j in range(N):
d += (X[j]-p)**2
al.append(d)
print((min(al))) | N = int(eval(input()))
X = list(map(int, input().split()))
X = sorted(X)
avg = sum(X)//N
aa = []
for i in range(2):
avg = avg + i
a = 0
for j in range(N):
a += (X[j] - avg)**2
aa.append(a)
print((min(aa))) | p02767 |
n = int(eval(input()))
X = list(map(int, input().split()))
for p in range(max(X)+100):
sum = 0
for x in X:
sum += ((x - p)**2)
if p == 0:
ans = sum
if ans > sum:
ans = sum
print(ans) | n = int(eval(input()))
X = list(map(int, input().split()))
for p in range(max(X)+1):
sum = 0
for x in X:
sum += ((x - p)**2)
if p == 0:
ans = sum
if ans > sum:
ans = sum
print(ans)
| p02767 |
n = int(eval(input()))
x = list(map(int,input().split()))
x.sort()
Sum = 0
Min = 9999999999
for i in range(100):
Sum = 0
for j in x:
Sum += (j - i)**2
if Sum < Min:
Min = Sum
print(Min)
| n = int(eval(input()))
x = list(map(int,input().split()))
x.sort()
Sum = 0
Min = float("inf")
for i in range(100):
Sum = 0
for j in x:
Sum += (j - i)**2
if Sum < Min:
Min = Sum
print(Min)
| p02767 |
N = int(eval(input()))
X = list(map(int,input().split()))
add = []
for p in range(99999):
psum = 0
for i in range(N):
power = (X[i] - p)**2
psum = psum + power
i = i + 1
add.append(psum)
print((min(add))) | N = int(eval(input()))
X = list(map(int,input().split()))
add = []
for p in range(1000):
psum = 0
for i in range(N):
power = (X[i] - p)**2
psum = psum + power
i = i + 1
add.append(psum)
print((min(add)))
| p02767 |
N = int(eval(input()))
X = list(map(int, input().split()))
p_min = min(X)
p_max = max(X)
ans = p_min
cost_min = N * p_max ** 2
for p in range(p_min, p_max + 1):
tmp_cost = sum([(x - p) ** 2 for x in X])
if tmp_cost < cost_min:
ans = p
cost_min = tmp_cost
print(cost_min) | N = int(eval(input()))
X = list(map(int, input().split()))
avg_p = int(sum(X) / N)
cost_l = sum([(x - avg_p)**2 for x in X])
cost_r = sum([(x - avg_p - 1)**2 for x in X])
print((min(cost_l, cost_r))) | p02767 |
n = int(eval(input()))
x = list(map(int, input().split()))
print((sum((i-round(sum(x)/n))**2 for i in x))) | eval(input())
x=list(map(int,input().split()))
print((sum((i-round(sum(x)/len(x)))**2 for i in x))) | p02767 |
N = int(eval(input()))
X = list(map(int, input().split()))
X = list(sorted(X))
if N == 1:
print((0))
exit()
ans = float('inf')
for p in range(X[0], X[N - 1] + 1):
sum = 0
for x in X:
sum += (x - p) ** 2
ans = min(sum, ans)
print(ans) | N = int(eval(input()))
X = list(map(int, input().split()))
avg = round(sum(X) / N)
print((sum([(x - avg) ** 2 for x in X]))) | p02767 |
N = int(eval(input()))
A = list(map(int, input().split()))
answer = 10 ** 9
for i in range(1,101):
tmp = 0
for a in A:
tmp += abs(a-i) ** 2
answer = min(answer,tmp)
print(answer) | N = int(eval(input()))
A = list(map(int, input().split()))
chushin = sum(A)//N
chushin_1 = sum(A)//N +1
answer = 0
answer_1 = 0
for a in A:
answer += abs(a-chushin) ** 2
answer_1 += abs(a-chushin_1) ** 2
print((min(answer,answer_1))) | p02767 |
#!/use/bin/env python3
from collections import defaultdict
n = int(eval(input()))
x_n = [int(s) for s in input().split()]
s = sorted(x_n)
ans = 1e18
for p in range(1, 101):
l = sum([pow(x - p, 2) for x in s])
if l < ans:
ans = l
print(ans) | #!/use/bin/env python3
from collections import defaultdict
n = int(eval(input()))
x_n = [int(s) for s in input().split()]
s = sorted(x_n)
ans = 1e18
for p in range(s[0], s[-1] + 1):
l = sum([pow(x - p, 2) for x in s])
if l < ans:
ans = l
print(ans) | p02767 |
N = int(eval(input()))
X = list(map(int, input().split()))
sav = float("inf")
for i in range(min(X), max(X)+1):
Xe = [abs(x-i)**2 for x in X]
health = sum(Xe)
if sav > health:
sav = health
print(sav)
| N = int(eval(input()))
X = list(map(int, input().split()))
xp = round(sum(X) / N)
Xe = [abs(x - xp) ** 2 for x in X]
print((sum(Xe)))
| p02767 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.