problem_id
stringlengths 6
6
| buggy_code
stringlengths 8
526k
⌀ | fixed_code
stringlengths 12
526k
⌀ | labels
listlengths 0
15
⌀ | buggy_submission_id
int64 1
1.54M
⌀ | fixed_submission_id
int64 2
1.54M
⌀ | user_id
stringlengths 10
10
⌀ | language
stringclasses 9
values |
|---|---|---|---|---|---|---|---|
p02860
|
n=input()
if len(n)%2:print("No")
else:print("Yes" if n[0:len(n)//2]==n[len(n)//2:] else "No")
|
input()
n = input()
if len(n) % 2:
print("No")
else:
print("Yes" if n[0:len(n)//2] == n[len(n)//2:] else "No")
|
[
"call.add"
] | 664,285
| 664,286
|
u686461495
|
python
|
p02860
|
n=int(input())
s=list(input())
c=0
if n%2 != 0:
print('No')
exit()
else:
for i in range(n/2):
if s[i]!=s[i+n/2]:
c+=1
if c==0:
print('Yes')
else:
print('No')
|
n=int(input())
s=list(input())
c=0
if n%2 != 0:
print('No')
exit()
else:
for i in range(n//2):
if s[i]!=s[i+n//2]:
c+=1
if c==0:
print('Yes')
else:
print('No')
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 664,287
| 664,288
|
u100800700
|
python
|
p02860
|
N=input()
n=int(int(N)/2)
S=input()
T=S[0:n]
print(T)
if S==T+T:
print("Yes")
else:
print("No")
|
N=input()
n=int(int(N)/2)
S=input()
T=S[0:n]
if S==T+T:
print("Yes")
else:
print("No")
|
[
"call.remove"
] | 664,295
| 664,296
|
u628415934
|
python
|
p02860
|
n=int(input())
s=input()
if n%2!=2:
print('No')
exit()
x=int(n/2)
print('Yes') if s[:x]==s[x:] else print ('No')
|
n=int(input())
s=input()
if n%2!=0:
print('No')
exit()
x=int(n/2)
print('Yes') if s[:x]==s[x:] else print ('No')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 664,297
| 664,298
|
u966408025
|
python
|
p02860
|
if __name__=='__main__':
N = int(input())
S = input()
ans = 'No'
if N % 2 == 0:
if S[0:N/2]==S[N/2:]: ans='Yes'
print(ans)
|
if __name__=='__main__':
N = int(input())
S = input()
ans = 'No'
if N % 2 == 0:
if S[0:int(N/2)]==S[int(N/2):]: ans='Yes'
print(ans)
|
[
"control_flow.branch.if.condition.change",
"call.add"
] | 664,309
| 664,310
|
u295656477
|
python
|
p02860
|
n=int(input())
s=str(input())
if n%2==1:
print("No")
else:
s1=s[0:int(n/2):1]
s2=s[int(n/2)+1:n:1]
if s1==s2:
print("Yes")
else:
print("No")
|
n=int(input())
s=str(input())
if n%2==1:
print("No")
else:
s1=s[0:int(n/2):1]
s2=s[int(n/2):n:1]
if s1==s2:
print("Yes")
else:
print("No")
|
[
"expression.operation.binary.remove"
] | 664,346
| 664,347
|
u117078923
|
python
|
p02860
|
s = input()
n = len(s)
if n%2 ==1 :
print("No")
else :
t = s[0:n//2]
if t == s[n//2:] :
print("Yes")
else :
print("No")
|
n = input()
s = input()
n = len(s)
if n%2 ==1 :
print("No")
else :
t = s[0:n//2]
if t == s[n//2:] :
print("Yes")
else :
print("No")
|
[
"assignment.add"
] | 664,363
| 664,364
|
u164875166
|
python
|
p02860
|
import sys
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n = INT()
s = input()
if n %2 == 0:
print('No')
else:
flag = True
for i in range(n):
if s[i] != s[n//2 + i]:
flag = False
if flag:
print('Yes')
else:
print('No')
|
import sys
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n = INT()
s = input()
if n%2 == 1:
print('No')
else:
flag = True
for i in range(n//2):
if s[i] != s[n//2 + i]:
flag = False
if flag:
print('Yes')
else:
print('No')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 664,369
| 664,370
|
u540799318
|
python
|
p02860
|
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n = INT()
s = input()
if n %2 == 0:
print('No')
else:
flag = True
for i in range(n):
if s[i] != s[n//2 + i]:
flag = False
if flag:
print('Yes')
else:
print('No')
|
import sys
from math import factorial
from fractions import Fraction
import heapq, bisect
import math
import itertools
sys.setrecursionlimit(10 ** 5 + 10)
INF = 10**15 +5
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
n = INT()
s = input()
if n%2 == 1:
print('No')
else:
flag = True
for i in range(n//2):
if s[i] != s[n//2 + i]:
flag = False
if flag:
print('Yes')
else:
print('No')
|
[
"literal.number.integer.change",
"control_flow.branch.if.condition.change"
] | 664,371
| 664,370
|
u540799318
|
python
|
p02860
|
n = str(input())
s = str(input())
s_l = s[0:len(s)//2]
s_r = s[len(s)//2:len(s)]
if s_l == s_r:
print('TRUE')
else:
print('FALSE')
|
n = str(input())
s = str(input())
s_l = s[0:len(s)//2]
s_r = s[len(s)//2:len(s)]
if s_l == s_r:
print('Yes')
else:
print('No')
|
[
"literal.string.change",
"call.arguments.change",
"io.output.change"
] | 664,388
| 664,389
|
u691855776
|
python
|
p02860
|
def main():
n = int(input())
s = input()
if n % 2 == 1:
print("No")
return
if s[:len(s)/2] == s[len(s)/2:]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
def main():
n = int(input())
s = input()
if n % 2 == 1:
print("No")
return
if s[:len(s)//2] == s[len(s)//2:]:
print("Yes")
else:
print("No")
if __name__ == '__main__':
main()
|
[
"expression.operator.arithmetic.change",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 664,448
| 664,449
|
u368970787
|
python
|
p02860
|
import sys
n=int(input())
s=input()
if n%2!=0:
print("No")
sys.exit()
for i in range(n//2):
if s[i]!=s[n//2+1]:
print("No")
sys.exit()
print("Yes")
|
import sys
n=int(input())
s=input()
if n%2!=0:
print("No")
sys.exit()
for i in range(n//2):
if s[i]!=s[n//2+i]:
print("No")
sys.exit()
print("Yes")
|
[
"identifier.replace.add",
"literal.replace.remove",
"variable_access.subscript.index.change",
"control_flow.branch.if.condition.change"
] | 664,457
| 664,458
|
u367866606
|
python
|
p02860
|
n = int(input())
s = list(input())
i = 0
Answer = "No"
if n%2 == 0:
while i < n/2 :
if s[i] == s[int((n/2))+i]:
Answer = "Yes"
i += 1
else:
break
print(Answer)
|
n = int(input())
s = list(input())
i = 0
Answer = "No"
if n%2 == 0:
while i < n/2 :
if s[i] == s[int((n/2))+i]:
Answer = "Yes"
i += 1
else:
Answer = "No"
break
print(Answer)
|
[
"assignment.add"
] | 664,463
| 664,464
|
u225845681
|
python
|
p02860
|
def judge(N,str):
a = list(str)
b = []
c = []
if N%2 == 0:
for k in range(int(N/2)):
b.append(a[k])
c.append(a[k+int(N/2)])
if a == b + c:
print("yes")
else:
print("No")
else:
print("No")
N = int(input())
S = input()
judge(N,S)
|
def judge(N,str):
a = list(str)
b = []
c = []
if N%2 == 0:
for k in range(int(N/2)):
b.append(a[k])
c.append(a[k+int(N/2)])
if b == c:
print("Yes")
else:
print("No")
else:
print("No")
N = int(input())
S = input()
judge(N,S)
|
[
"control_flow.branch.if.condition.change",
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 664,471
| 664,472
|
u590647174
|
python
|
p02860
|
def judge(N,str):
a = list(str)
b = []
c = []
if N%2 == 0:
for k in range(int(N/2)):
b.append(a[k])
c.append(a[k+int(N/2)])
if b == c:
print("yes")
else:
print("No")
else:
print("No")
N = int(input())
S = input()
judge(N,S)
|
def judge(N,str):
a = list(str)
b = []
c = []
if N%2 == 0:
for k in range(int(N/2)):
b.append(a[k])
c.append(a[k+int(N/2)])
if b == c:
print("Yes")
else:
print("No")
else:
print("No")
N = int(input())
S = input()
judge(N,S)
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 664,473
| 664,472
|
u590647174
|
python
|
p02860
|
n,a=open(0);n=int(n);print("YNeos"[a[:n//2]!=a[n//2:]::2])
|
n,a=open(0);n=int(n);print("YNeos"[a[:n//2]!=a[n//2:-1]::2])
|
[] | 664,480
| 664,481
|
u670180528
|
python
|
p02860
|
n = int(input())
s = input()
flag = 0
if n%2 == 0:
m = n/2
for i in range(m):
if s[i] != s[m+i]:
flag = 1
if flag == 1:
print("No")
else:
print("Yes")
else:
print("No")
|
n = int(input())
s = input()
flag = 0
if n%2 == 0:
m = int(n/2)
for i in range(m):
if s[i] != s[m+i]:
flag = 1
if flag == 1:
print("No")
else:
print("Yes")
else:
print("No")
|
[
"call.add",
"call.arguments.change"
] | 664,486
| 664,487
|
u884077550
|
python
|
p02860
|
import sys
input = sys.stdin.readline
N = int(input())
S = input().split()
if N%2==0:
s1 = S[:(N//2)]
if S == s1 + s1:
print('Yes')
else:
print('No')
else:
print('No')
|
import sys
input = sys.stdin.readline
N = int(input())
S = input().rstrip()
if N%2==0:
s1 = S[:(N//2)]
if S == s1 + s1:
print('Yes')
else:
print('No')
else:
print('No')
|
[
"assignment.value.change",
"identifier.change"
] | 664,494
| 664,495
|
u381572531
|
python
|
p02860
|
s = input()
s = input()
if (s[:len(s)//2] ==s[len(s)//2:]):
print("YES")
else:
print("NO")
|
s = input()
s = input()
if (s[:len(s)//2] ==s[len(s)//2:]):
print("Yes")
else:
print("No")
|
[
"literal.string.change",
"literal.string.case.change",
"call.arguments.change",
"io.output.change"
] | 664,500
| 664,501
|
u237609052
|
python
|
p02860
|
N = int(input())
S = input()
if (N % 2) == 1:
ans = "no"
else:
n = int(N/2)
s1 = S[0:n]
s2 = S[-n:]
if s1 == s2:
ans="Yes"
else:
ans ="No"
print(ans)
|
N = int(input())
S = input()
if (N % 2) == 1:
ans = "No"
else:
n = int(N/2)
s1 = S[0:n]
s2 = S[-n:]
if s1 == s2:
ans="Yes"
else:
ans ="No"
print(ans)
|
[
"literal.string.change",
"literal.string.case.change",
"assignment.value.change"
] | 664,502
| 664,503
|
u046000398
|
python
|
p02861
|
from itertools import permutations
from math import sqrt, pow, factorial
N = int(input())
l = [list(map(int, input().split())) for _ in range(N)]
print(l)
def calc(a, b):
[x1, y1] = a
[x2, y2] = b
return sqrt(pow(x1 - x2, 2) + pow(y1 -y2, 2))
ans = 0
for order in permutations(range(N)):
tmp = 0
for i in range(1, N):
tmp += calc(l[order[i]], l[order[i-1]])
ans += tmp
print(ans/factorial(N))
|
from itertools import permutations
from math import sqrt, pow, factorial
N = int(input())
l = [list(map(int, input().split())) for _ in range(N)]
def calc(a, b):
[x1, y1] = a
[x2, y2] = b
return sqrt(pow(x1 - x2, 2) + pow(y1 -y2, 2))
ans = 0
for order in permutations(range(N)):
tmp = 0
for i in range(1, N):
tmp += calc(l[order[i]], l[order[i-1]])
ans += tmp
print(ans/factorial(N))
|
[
"call.remove"
] | 664,506
| 664,507
|
u821588465
|
python
|
p02861
|
n = int(input())
a = [list(map(int,input().split())) for i in range(n)]
sum = 0
for i in range(n):
for j in range(j+1,n):
sum += ((a[i][0]-a[j][0])**2+(a[i][1]-a[j][1])**2)**0.5
print(2*sum/n)
|
n = int(input())
a = [list(map(int,input().split())) for i in range(n)]
sum = 0
for i in range(n):
for j in range(i+1,n):
sum += ((a[i][0]-a[j][0])**2+(a[i][1]-a[j][1])**2)**0.5
print(2*sum/n)
|
[
"identifier.change",
"call.arguments.change",
"expression.operation.binary.change",
"control_flow.loop.range.bounds.upper.change"
] | 664,512
| 664,513
|
u620846115
|
python
|
p02861
|
import math
import itertools
n = int(input())
al = [0] * n
bl = [0] * n
for i in range(n):
al[i], bl[i] = map(int, input().split())
bunbo = math.factorial(n)
ans = 0
for p in itertools.permutations(list(range(n))):
print(p)
for i in range(n-1):
ans += ((al[p[i+1]]-al[p[i]])**2+(bl[p[i+1]]-bl[p[i]])**2)**0.5
print(ans/bunbo)
|
import math
import itertools
n = int(input())
al = [0] * n
bl = [0] * n
for i in range(n):
al[i], bl[i] = map(int, input().split())
bunbo = math.factorial(n)
ans = 0
for p in itertools.permutations(list(range(n))):
for i in range(n-1):
ans += ((al[p[i+1]]-al[p[i]])**2+(bl[p[i+1]]-bl[p[i]])**2)**0.5
print(ans/bunbo)
|
[
"call.remove"
] | 664,514
| 664,515
|
u540877546
|
python
|
p02861
|
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(n):
for j in range(n):
if i == j: continue
ans += ((xy[i][0] - xy[j][0])**2 + (xy[i][1] - xy[j][1])**2)**0.5
t += 1
print(ans/n)
|
n = int(input())
xy = [list(map(int, input().split())) for _ in range(n)]
ans = 0
for i in range(n):
for j in range(n):
if i == j: continue
ans += ((xy[i][0] - xy[j][0])**2 + (xy[i][1] - xy[j][1])**2)**0.5
print(ans/n)
|
[] | 664,522
| 664,523
|
u188827677
|
python
|
p02861
|
import math
N = int(input())
ls1 = []
ls2 = []
for i in range(N):
ls1.append(list(map(int,input().split())))
x = 0
y = 0
for i in range(N):
for j in range(i+1,N):
x = (ls1[i][0]-ls1[j][0])**2
y = (ls1[i][0]-ls1[j][0])**2
XY = math.sqrt(x+y)
ls2.append(XY)
if len(ls2) == 1:
print(ls2[0])
else:
ans = sum(ls2)*2/N
print(ans)
|
import math
N = int(input())
ls1 = []
ls2 = []
for i in range(N):
ls1.append(list(map(int,input().split())))
x = 0
y = 0
for i in range(N):
for j in range(i+1,N):
x = (ls1[i][0]-ls1[j][0])**2
y = (ls1[i][1]-ls1[j][1])**2
XY = math.sqrt(x+y)
ls2.append(XY)
if len(ls2) == 1:
print(ls2[0])
else:
ans = sum(ls2)*2/N
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 664,530
| 664,531
|
u556589653
|
python
|
p02861
|
import math
N = int(input())
ls1 = []
ls2 = []
for i in range(N):
ls1.append(list(map(int,input().split())))
x = 0
y = 0
for i in range(N):
for j in range(i+1,N):
x = (ls1[i][0]-ls1[j][0])**2
y = (ls1[i][0]-ls1[j][0])**2
XY = math.sqrt(x+y)
ls2.append(XY)
if len(ls2) == 1:
print(ls2[0])
else:
ans = sum(ls2)*2/N
print(ans)
|
import math
N = int(input())
ls1 = []
ls2 = []
for i in range(N):
ls1.append(list(map(int,input().split())))
x = 0
y = 0
for i in range(N):
for j in range(i+1,N):
x = (ls1[i][0]-ls1[j][0])**2
y = (ls1[i][1]-ls1[j][1])**2
XY = math.sqrt(x+y)
ls2.append(XY)
if len(ls2) == 1:
print(ls2[0])
else:
ans = sum(ls2)*2/N
print(ans)
|
[
"literal.number.integer.change",
"assignment.value.change",
"variable_access.subscript.index.change",
"expression.operation.binary.change"
] | 664,530
| 664,532
|
u556589653
|
python
|
p02861
|
import itertools
n=int(input())
xy=[list(map(int,input().split())) for i in range(n)]
cnt=0
num=0
for v in itertools.permutations(xy):
num+=1
for i in range(n-1):
a=(v[i][0]-v[i+1][0])**2+(v[i][1]-v[i+1][1])**2
b=a**0.5
print(b)
cnt+=b
print(cnt/num)
|
import itertools
n=int(input())
xy=[list(map(int,input().split())) for i in range(n)]
cnt=0
num=0
for v in itertools.permutations(xy):
num+=1
for i in range(n-1):
a=(v[i][0]-v[i+1][0])**2+(v[i][1]-v[i+1][1])**2
b=a**0.5
cnt+=b
print(cnt/num)
|
[
"call.remove"
] | 664,533
| 664,534
|
u800058906
|
python
|
p02861
|
import math
import numpy as np
N =int(input())
a = np.zeros((N, 2))
kyori = np.zeros(int(N*(N-1)/2))
for i in range(0,N):
x,y= map(int, input().split())
a[i][0]=x
a[i][1]=y
count=0
for i in range(0,N-1):
for j in range(i+1,N):
kyori[count]=math.sqrt((a[i][0]-a[j][0])**2+(a[i][1]-a[j][1])**2)
count=count+1
print(kyori)
print(2*sum(kyori)*(N-1)*math.factorial(N-2)/math.factorial(N))
|
import math
import numpy as np
N =int(input())
a = np.zeros((N, 2))
kyori = np.zeros(int(N*(N-1)/2))
for i in range(0,N):
x,y= map(int, input().split())
a[i][0]=x
a[i][1]=y
count=0
for i in range(0,N-1):
for j in range(i+1,N):
kyori[count]=math.sqrt((a[i][0]-a[j][0])**2+(a[i][1]-a[j][1])**2)
count=count+1
print(2*sum(kyori)*(N-1)*math.factorial(N-2)/math.factorial(N))
|
[
"call.remove"
] | 664,539
| 664,540
|
u986661497
|
python
|
p02861
|
import itertools
import math
n=int(input())
lis=[list(map(int,input().split())) for i in range(n)]
num=[j for j in range(n)]
new=list(itertools.permutations(num))
ans=0
for i in range(len(new)):
for j in range(n-1):
a=new[i][j]
b=new[i][j+1]
ans+=math.sqrt((lis[a][0]-lis[a][1])**2+(lis[b][0]-lis[b][1])**2)
print(ans/len(new))
|
import itertools
import math
n=int(input())
lis=[list(map(int,input().split())) for i in range(n)]
num=[j for j in range(n)]
new=list(itertools.permutations(num))
ans=0
for i in range(len(new)):
for j in range(n-1):
a=new[i][j]
b=new[i][j+1]
ans+=math.sqrt((lis[a][0]-lis[b][0])**2+(lis[a][1]-lis[b][1])**2)
print(ans/len(new))
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.integer.change"
] | 664,548
| 664,549
|
u901598613
|
python
|
p02861
|
import math
import itertools
n = int(input())
xy = []
for i in range(n):
xy.append(list(map(int, input().split())))
x = 0
y = 1
d = 0
for p in itertools.permutations(range(n)):
p = list(p)
for i in range(n-1):
d += ((xy[p[i]][x] - xy[p[i+1]][x])**2 - (xy[p[i]][y] - xy[p[i+1]][y])**2)**0.5
# print(d)
print(d/math.factorial(n))
|
import math
import itertools
n = int(input())
xy = []
for i in range(n):
xy.append(list(map(int, input().split())))
x = 0
y = 1
d = 0
for p in itertools.permutations(range(n)):
p = list(p)
for i in range(n-1):
d += ((xy[p[i]][x] - xy[p[i+1]][x])**2 + (xy[p[i]][y] - xy[p[i+1]][y])**2)**0.5
# print(d)
print(d/math.factorial(n))
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 664,564
| 664,565
|
u353895424
|
python
|
p02861
|
import math
import itertools
n = int(input())
xy = []
for i in range(n):
xy.append(list(map(int, input().split())))
x = 0
y = 1
d = 0
for p in itertools.permutations(range(n)):
p = list(p)
for i in range(n-1):
d += ((xy[p[i]][x] - xy[p[i+1]][x])**2 - (xy[p[i]][y] - xy[p[i+1]][y])**2)**0.5
print(d)
print(d/math.factorial(n))
|
import math
import itertools
n = int(input())
xy = []
for i in range(n):
xy.append(list(map(int, input().split())))
x = 0
y = 1
d = 0
for p in itertools.permutations(range(n)):
p = list(p)
for i in range(n-1):
d += ((xy[p[i]][x] - xy[p[i+1]][x])**2 + (xy[p[i]][y] - xy[p[i+1]][y])**2)**0.5
# print(d)
print(d/math.factorial(n))
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change",
"call.remove"
] | 664,566
| 664,565
|
u353895424
|
python
|
p02861
|
import itertools
N=int(input())
XY=[]
for i in range(N):
x,y=map(int,input().split())
XY+=[[x,y]]
ALL=list(itertools.permutations(XY))
print(ALL)
ans=10**9
d=0
for i in ALL:
for k in range(N-1):
d2=((i[k][0]-i[k+1][0])**2+(i[k][1]-i[k+1][1])**2)**(1/2)
d+=d2
ans=d/len(ALL)
print(ans)
|
import itertools
N=int(input())
XY=[]
for i in range(N):
x,y=map(int,input().split())
XY+=[[x,y]]
ALL=list(itertools.permutations(XY))
ans=10**9
d=0
for i in ALL:
for k in range(N-1):
d2=((i[k][0]-i[k+1][0])**2+(i[k][1]-i[k+1][1])**2)**(1/2)
d+=d2
ans=d/len(ALL)
print(ans)
|
[
"call.remove"
] | 664,571
| 664,572
|
u829249049
|
python
|
p02861
|
import sys
import math
import itertools
import collections
import numpy as np
rl = sys.stdin.readline
n = int(rl())
li = []
for _ in range(n):
lis = list(map(int, rl().split()))
li.append(lis)
t = 0
for i in list(collections.permutations(n)):
for k in range(n-1):
s = (li[i[k]][0] - li[i[k+1]][0])**2 + (li[i[k]][1] - li[i[k+1]][1])**2
t += s**0.5
print(t/math.factorial(n))
|
import sys
import math
import itertools
import collections
import numpy as np
rl = sys.stdin.readline
n = int(rl())
li = []
for _ in range(n):
lis = list(map(int, rl().split()))
li.append(lis)
t = 0
for i in list(itertools.permutations(range(n))):
for k in range(n-1):
s = (li[i[k]][0] - li[i[k+1]][0])**2 + (li[i[k]][1] - li[i[k+1]][1])**2
t += s**0.5
print(t/math.factorial(n))
|
[
"identifier.change",
"call.arguments.change",
"call.arguments.add"
] | 664,573
| 664,574
|
u823885866
|
python
|
p02861
|
import math
n=int(input())
s=[list(map(int,input().split())) for i in range(n)]
print(s)
dist=0
a=math.factorial(n)
for i in range(n):
for j in range(i+1,n):
dist+=math.sqrt((s[i][0]-s[j][0])**2+(s[i][1]-s[j][1])**2)
print(dist*2/n)
|
import math
n=int(input())
s=[list(map(int,input().split())) for i in range(n)]
dist=0
a=math.factorial(n)
for i in range(n):
for j in range(i+1,n):
dist+=math.sqrt((s[i][0]-s[j][0])**2+(s[i][1]-s[j][1])**2)
print(dist*2/n)
|
[
"call.remove"
] | 664,575
| 664,576
|
u658987783
|
python
|
p02861
|
import itertools
import math
n=int(input())
X=[list(map(int,input().split())) for _ in range(n)]
P=[i for i in range(n)]
total=0
for j in itertools.permutations(P,n):
candi=list(j)
for k in range(len(candi)-1):
dis1=(X[candi[k]][0]-X[candi[k+1]][0])**2
dis2=(X[candi[k]][1]-X[candi[k+1]][1])**2
total+=(dis1+dis2)**(1/2)
print(candi,total)
print(total/math.factorial(n))
|
import itertools
import math
n=int(input())
X=[list(map(int,input().split())) for _ in range(n)]
P=[i for i in range(n)]
total=0
for j in itertools.permutations(P,n):
candi=list(j)
for k in range(len(candi)-1):
dis1=(X[candi[k]][0]-X[candi[k+1]][0])**2
dis2=(X[candi[k]][1]-X[candi[k+1]][1])**2
total+=(dis1+dis2)**(1/2)
print(total/math.factorial(n))
|
[
"call.remove"
] | 664,582
| 664,583
|
u441320782
|
python
|
p02861
|
import math
import itertools
def distance(c1,c2):
x1,y1 = c1
x2,y2 = c2
return math.sqrt((x1-x2)**2+(y1-y2)**2)
N = int(input())
Cord = []
ls = list(itertools.permutations(range(N)))
for _ in range(N):
Cord.append(tuple(map(int,input().split())))
ans = 0
print(ls)
for l in ls:
for i in range(N-1):
ans+=distance(Cord[l[i]],Cord[l[i+1]])
print(ans/len(ls))
|
import math
import itertools
def distance(c1,c2):
x1,y1 = c1
x2,y2 = c2
return math.sqrt((x1-x2)**2+(y1-y2)**2)
N = int(input())
Cord = []
ls = list(itertools.permutations(range(N)))
for _ in range(N):
Cord.append(tuple(map(int,input().split())))
ans = 0
for l in ls:
for i in range(N-1):
ans+=distance(Cord[l[i]],Cord[l[i+1]])
print(ans/len(ls))
|
[
"call.remove"
] | 664,601
| 664,602
|
u760771686
|
python
|
p02861
|
import sys
import itertools
import numpy as np
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()
basho = [LI() for _ in range(N)]
keiros = list(itertools.permutations(range(1,N+1)))
nagasa = []
for keiro in keiros:
diff = 0
for i in range(1,len(keiro)):
diff += (((basho[keiro[i]-1][0] - basho[keiro[i-1]-1][0]) ** 2) + ((basho[keiro[i]-1][1] - basho[keiro[i-1]-1][1]) ** 2))
nagasa.append(diff)
num = np.array(nagasa)
print(np.average(num))
|
import sys
import itertools
import numpy as np
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()
basho = [LI() for _ in range(N)]
keiros = list(itertools.permutations(range(1,N+1)))
nagasa = []
for keiro in keiros:
diff = 0
for i in range(1,len(keiro)):
diff += (((basho[keiro[i]-1][0] - basho[keiro[i-1]-1][0]) ** 2) + ((basho[keiro[i]-1][1] - basho[keiro[i-1]-1][1]) ** 2)) ** 0.5
nagasa.append(diff)
num = np.array(nagasa)
print(np.average(num))
|
[
"expression.operation.binary.add"
] | 664,609
| 664,610
|
u413021823
|
python
|
p02861
|
import sys
# import math
import heapq
# input = sys.stdin.readline
from collections import deque
def main():
N = int(input())
X=[]
Y =[]
for i in range(N):
x,y = map(int,input().split())
X.append(x)
Y.append(y)
ans =0
for i in range(N):
for j in range(N):
if i==j:
continue
ans += ((X[i]-X[j])**2 + (Y[i]-Y[j])**2 )**0.5
print(ans/3)
if __name__ == "__main__":
main()
|
import sys
# import math
import heapq
# input = sys.stdin.readline
from collections import deque
def main():
N = int(input())
X=[]
Y =[]
for i in range(N):
x,y = map(int,input().split())
X.append(x)
Y.append(y)
ans =0
for i in range(N):
for j in range(N):
if i==j:
continue
ans += ((X[i]-X[j])**2 + (Y[i]-Y[j])**2 )**0.5
print(ans/N)
if __name__ == "__main__":
main()
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 664,616
| 664,617
|
u408071652
|
python
|
p02861
|
import itertools
import math
N=int(input())
T=[None]*N
for i in range(N):
T[i] = list(map(int,input().split()))
seq=[i for i in range(N)]
kumi=list(itertools.permutations(seq))
L_sum=0
for i in range(len(kumi)):
for j in range(N-1):
L_sum+=math.sqrt((T[kumi[i][j]-1][0]-T[kumi[i][j+1]-1][0])**2+(T[kumi[i][j]-1][1]-T[kumi[i][j+1]-1][1])**2)
#print(kumi[i][j],kumi[i][j+1])
#,T[kumi[i][j+1]-1][0],T[kumi[i][j]-1][1],T[kumi[i][j+1]-1][1])
num=1
for i in range(N):
num+=i
#print(L_sum)
print(L_sum/num)
|
import itertools
import math
N=int(input())
T=[None]*N
for i in range(N):
T[i] = list(map(int,input().split()))
seq=[i for i in range(N)]
kumi=list(itertools.permutations(seq))
L_sum=0
for i in range(len(kumi)):
for j in range(N-1):
L_sum+=math.sqrt((T[kumi[i][j]-1][0]-T[kumi[i][j+1]-1][0])**2+(T[kumi[i][j]-1][1]-T[kumi[i][j+1]-1][1])**2)
#print(kumi[i][j],kumi[i][j+1])
#,T[kumi[i][j+1]-1][0],T[kumi[i][j]-1][1],T[kumi[i][j+1]-1][1])
num=1
for i in range(1,N+1):
num*=i
#print(L_sum)
print(L_sum/num)
|
[
"call.arguments.add",
"expression.operator.change"
] | 664,620
| 664,621
|
u681444474
|
python
|
p02861
|
import itertools, math
n = int(input())
point = [tuple(map(int, input().split())) for i in range(n)]
numbers = 1
for i in range(1,n+1):
numbers *= i
print(numbers)
#nの階乗
route = list(itertools.permutations(point))
d = 0
for pattern in route:
for i in range(n-1):
d += math.sqrt((pattern[i][0]-pattern[i+1][0])**2 + (pattern[i][1]-pattern[i+1][1])**2)
ans = d / numbers
print(ans)
|
import itertools
import math
n = int(input())
point = [tuple(map(int, input().split())) for i in range(n)]
numbers = 1
for i in range(1,n+1):
numbers *= i
#nの階乗
route = list(itertools.permutations(point))
d = 0
for pattern in route:
for i in range(n-1):
d += math.sqrt((pattern[i][0]-pattern[i+1][0])**2 + (pattern[i][1]-pattern[i+1][1])**2)
ans = d / numbers
print(ans)
|
[
"call.remove"
] | 664,622
| 664,623
|
u447456419
|
python
|
p02861
|
from itertools import permutations
N=int(input())
town=[]
for i in range(N):
x,y=map(int,input().split())
town.append((x,y))
ans=0
for i,j in permutations(town,2):
ans+=(((i[0]-j[0])**2+(i[1]+j[1])**2)**0.5)
print(ans/N)
|
from itertools import permutations
N=int(input())
town=[]
for i in range(N):
x,y=map(int,input().split())
town.append((x,y))
ans=0
for i,j in permutations(town,2):
ans+=(((i[0]-j[0])**2+(i[1]-j[1])**2)**0.5)
print(ans/N)
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"expression.operation.binary.change"
] | 664,637
| 664,638
|
u895445743
|
python
|
p02861
|
from itertools import permutations
from math import hypot, factorial
n=int(input())
a=[list(map(int,input().split()))for _ in range(n)]
d = lambda x1,y1,x2,y2: ((x1-x2)**2 + (y1-y2)**4)**0.5
x = 0
for i in permutations(a):
for j in range(n-1):
x += d(i[j][0],i[j][1], i[j+1][0],i[j+1][1])
#for i in range(n): f*=i+1
print(x / factorial(n))
|
from itertools import permutations
from math import hypot, factorial
n=int(input())
a=[list(map(int,input().split()))for _ in range(n)]
d = lambda x1,y1,x2,y2: ((x1-x2)**2 + (y1-y2)**2)**0.5
x = 0
for i in permutations(a):
for j in range(n-1):
x += d(i[j][0],i[j][1], i[j+1][0],i[j+1][1])
#for i in range(n): f*=i+1
print(x / factorial(n))
|
[
"literal.number.integer.change",
"assignment.value.change",
"expression.operation.binary.change"
] | 664,648
| 664,649
|
u713914478
|
python
|
p02861
|
import itertools
import math
n = int(input())
points = [list(map(int, input().split())) for _ in range(n)]
numbers = list(range(1, n + 1))
diff = 0
count = 0
for pattern in itertools.permutations(numbers):
count += 1
for j in range(n - 1):
points_index = pattern[j] - 1
next_index = pattern[j + 1] - 1
diff += math.sqrt((points[points_index][0] - points[points_index][1]) ** 2 + (points[next_index][0] - points[next_index][1]) ** 2)
print(diff / count)
|
import itertools
import math
n = int(input())
points = [list(map(int, input().split())) for _ in range(n)]
numbers = list(range(1, n + 1))
diff = 0
count = 0
for pattern in itertools.permutations(numbers):
count += 1
for j in range(n - 1):
points_index = pattern[j] - 1
next_index = pattern[j + 1] - 1
diff += math.sqrt((points[points_index][0] - points[next_index][0]) ** 2 + (points[points_index][1] - points[next_index][1]) ** 2)
print(diff / count)
|
[
"identifier.change",
"variable_access.subscript.index.change",
"call.arguments.change",
"expression.operation.binary.change",
"literal.number.integer.change"
] | 664,651
| 664,652
|
u068142202
|
python
|
p02861
|
import itertools
N = int(input())
XY = tuple(tuple(map(int, input().split())) for _ in range(N))
kumi = tuple(itertools.permutations(XY, N))
ans = 0
def f(xi, yi, xj, yj):
return ((xi - xj) ** 2 + (yi - yj) ** 2) ** 0.5
for i in kumi:
for j in range(N-1):
xi, yi = i[j]
xj, yj = i[j+1]
ans += f(xi, yi, xj, yj)
print(ans/N/2)
|
import itertools
N = int(input())
XY = tuple(tuple(map(int, input().split())) for _ in range(N))
kumi = tuple(itertools.permutations(XY, N))
ans = 0
def f(xi, yi, xj, yj):
return ((xi - xj) ** 2 + (yi - yj) ** 2) ** 0.5
for i in kumi:
for j in range(N-1):
xi, yi = i[j]
xj, yj = i[j+1]
ans += f(xi, yi, xj, yj)
print(ans/len(kumi))
|
[
"call.arguments.change"
] | 664,655
| 664,656
|
u327532412
|
python
|
p02861
|
import itertools
n = int(input())
seq = [i for i in range(n)]
steps = list(itertools.permutations(seq))
xy = [list(map(int,input().split())) for _ in range(n)]
sumlen = 0
for j in range(len(steps)):
leng = 0
step = steps[j]
for k in range(n-1):
x_1 = int(xy[step[k]][0])
x_2 = int(xy[step[k+1]][0])
y_1 = int(xy[step[k]][1])
y_2 = int(xy[step[k+1]][1])
leng += ((x_1 - x_2)**2 + (y_1 - y_2)**2)**0.5
sumlen += leng
print(sumlen)
print((sumlen/len(steps)))
|
import itertools
n = int(input())
seq = [i for i in range(n)]
steps = list(itertools.permutations(seq))
xy = [list(map(int,input().split())) for _ in range(n)]
sumlen = 0
for j in range(len(steps)):
leng = 0
step = steps[j]
for k in range(n-1):
x_1 = int(xy[step[k]][0])
x_2 = int(xy[step[k+1]][0])
y_1 = int(xy[step[k]][1])
y_2 = int(xy[step[k+1]][1])
leng += ((x_1 - x_2)**2 + (y_1 - y_2)**2)**0.5
sumlen += leng
print((sumlen/len(steps)))
|
[
"call.remove"
] | 664,659
| 664,660
|
u521271655
|
python
|
p02861
|
from itertools import combinations
N = int(input())
town = []
for n in range(N):
x, y = map(int,input().split())
town.append((x,y))
ans = 0
for i,j in combinations(town,2):
ans += ((i[0]-j[0])**2 + (i[1]-j[1])**2)**0.5
print ((N-1)*ans/N)
|
from itertools import combinations
N = int(input())
town = []
for n in range(N):
x, y = map(int,input().split())
town.append((x,y))
ans = 0
for i,j in combinations(town,2):
ans += ((i[0]-j[0])**2 + (i[1]-j[1])**2)**0.5
print (2*ans/N)
|
[
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change"
] | 664,661
| 664,662
|
u261082314
|
python
|
p02861
|
from itertools import combinations
N = int(input())
town = []
for n in range(N):
x, y = map(int,input().split())
town.append((x,y))
ans = 0
for i,j in combinations(town,2):
ans += ((i[0]-j[0])**2 + (i[1]-j[1]**2))**0.5
print (2*ans/N)
|
from itertools import combinations
N = int(input())
town = []
for n in range(N):
x, y = map(int,input().split())
town.append((x,y))
ans = 0
for i,j in combinations(town,2):
ans += ((i[0]-j[0])**2 + (i[1]-j[1])**2)**0.5
print (2*ans/N)
|
[] | 664,663
| 664,662
|
u261082314
|
python
|
p02861
|
#C - Average Length
import math
import itertools
N = int(input())
town = []
for i in range(N):
x,y = map(int,input().split())
town.append((x,y))
def dist(A,B):
return math.sqrt((A[0]-B[0])**2 + (A[1]-B[1])**2)
route = list(itertools.permutations(town))
print(route)
tot = 0
for i in route:
for j in range(len(i)-1):
tot += dist(i[j],i[j+1])
ave = tot/len(route)
print(ave)
|
#C - Average Length
import math
import itertools
N = int(input())
town = []
for i in range(N):
x,y = map(int,input().split())
town.append((x,y))
def dist(A,B):
return math.sqrt((A[0]-B[0])**2 + (A[1]-B[1])**2)
route = list(itertools.permutations(town))
tot = 0
for i in route:
for j in range(len(i)-1):
tot += dist(i[j],i[j+1])
ave = tot/len(route)
print(ave)
|
[
"call.remove"
] | 664,664
| 664,665
|
u411923565
|
python
|
p02861
|
n=int(input())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
import itertools
seq=[i for i in range(n)]
p=list(itertools.permutations(seq))
import math
ans=0
for pp in p:
for i in range(n-1):
xy=math.sqrt((l[pp[i]][0]+l[pp[i+1]][0])**2 + (l[pp[i]][1]+l[pp[i+1]][1])**2)
ans+=xy
print(ans/len(p))
|
n=int(input())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
import itertools
seq=[i for i in range(n)]
p=list(itertools.permutations(seq))
import math
ans=0
for pp in p:
for i in range(n-1):
xy=math.sqrt((l[pp[i]][0]-l[pp[i+1]][0])**2 + (l[pp[i]][1]-l[pp[i+1]][1])**2)
ans+=xy
print(ans/len(p))
|
[
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 664,672
| 664,673
|
u087118202
|
python
|
p02861
|
n=int(input())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
import itertools
seq=[i for i in range(n)]
p=list(itertools.permutations(seq))
import mathi
ans=0
for pp in p:
for i in range(n-1):
xy=math.sqrt((l[pp[i]][0]+l[pp[i+1]][0])**2 + (l[pp[i]][1]+l[pp[i+1]][1])**2)
ans+=xy
print(ans/len(p))
|
n=int(input())
l=[]
for i in range(n):
x,y=map(int,input().split())
l.append([x,y])
import itertools
seq=[i for i in range(n)]
p=list(itertools.permutations(seq))
import math
ans=0
for pp in p:
for i in range(n-1):
xy=math.sqrt((l[pp[i]][0]-l[pp[i+1]][0])**2 + (l[pp[i]][1]-l[pp[i+1]][1])**2)
ans+=xy
print(ans/len(p))
|
[
"identifier.change",
"misc.opposites",
"expression.operator.arithmetic.change",
"assignment.value.change",
"call.arguments.change",
"expression.operation.binary.change"
] | 664,674
| 664,673
|
u087118202
|
python
|
p02861
|
N = int(input())
A = [tuple(map(int, input().split())) for _ in range(N)]
ans = []
for i in range(len(A)-1):
for k in range(i+1,len(A)):
print(i, k)
ans.append((((A[i][0]-A[k][0])**2)+(A[i][1]-A[k][1])**2)**0.5)
print(sum(ans)*2/N)
|
N = int(input())
A = [tuple(map(int, input().split())) for _ in range(N)]
ans = []
for i in range(len(A)-1):
for k in range(i+1,len(A)):
ans.append((((A[i][0]-A[k][0])**2)+(A[i][1]-A[k][1])**2)**0.5)
print(sum(ans)*2/N)
|
[
"call.remove"
] | 664,677
| 664,678
|
u105608888
|
python
|
p02861
|
N = int(input())
A = [tuple(map(int, input().split())) for _ in range(N)]
ans = []
import numpy as np
for i in range(len(A)-1):
for k in range(i+1,len(A)):
print(i, k)
ans.append(np.sqrt(((A[i][0]-A[k][0])**2)+(A[i][1]-A[k][1])**2))
print(sum(ans)*2/N)
|
N = int(input())
A = [tuple(map(int, input().split())) for _ in range(N)]
ans = []
import numpy as np
for i in range(len(A)-1):
for k in range(i+1,len(A)):
ans.append(np.sqrt(((A[i][0]-A[k][0])**2)+(A[i][1]-A[k][1])**2))
print(sum(ans)*2/N)
|
[
"call.remove"
] | 664,679
| 664,680
|
u105608888
|
python
|
p02861
|
N = int(input())
A = [tuple(map(int, input().split())) for _ in range(N)]
ans = []
import numpy as np
for zyun in itertools.permutations(range(N)):
cnt = 0
for k in range(len(zyun)-1):
cnt += np.sqrt((A[zyun[k+1]][0]-A[zyun[k]][0])**2+(A[zyun[k+1]][1]-A[zyun[k]][1])**2 )
ans.append(cnt)
print(sum(ans) / len(ans))
|
N = int(input())
A = [tuple(map(int, input().split())) for _ in range(N)]
ans = []
import numpy as np
import itertools
for zyun in itertools.permutations(range(N)):
cnt = 0
for k in range(len(zyun)-1):
cnt += np.sqrt((A[zyun[k+1]][0]-A[zyun[k]][0])**2+(A[zyun[k+1]][1]-A[zyun[k]][1])**2 )
ans.append(cnt)
print(sum(ans) / len(ans))
|
[] | 664,681
| 664,682
|
u105608888
|
python
|
p02861
|
from math import sqrt
from itertools import permutations
N=int(input())
xy=[list(map(int,input().split())) for _ in range(N)]
ans=0
cnt=0
for i in permutations(range(3)):
d=0
for j in range(N-1):
dx=xy[i[j+1]][0]-xy[i[j]][0]
dy=xy[i[j+1]][1]-xy[i[j]][1]
d+=sqrt(dx**2+dy**2)
ans+=d
cnt+=1
print(ans/cnt)
|
from math import sqrt
from itertools import permutations
N=int(input())
xy=[list(map(int,input().split())) for _ in range(N)]
ans=0
cnt=0
for i in permutations(range(N)):
d=0
for j in range(N-1):
dx=xy[i[j+1]][0]-xy[i[j]][0]
dy=xy[i[j+1]][1]-xy[i[j]][1]
d+=sqrt(dx**2+dy**2)
ans+=d
cnt+=1
print(ans/cnt)
|
[
"identifier.replace.add",
"literal.replace.remove",
"call.arguments.change",
"control_flow.loop.range.bounds.upper.change"
] | 664,683
| 664,684
|
u617515020
|
python
|
p02861
|
n=int(input())
l=[int(i) for i in range(n)]
ans=chk=p=0
w=[]
for i in range(n):
x,y=map(int,input().split())
w.append((x,y))
for i in list(itertools.permutations(l,n)):
chk=0
for j in range(n-1):
chk+=((w[i[j]][0]-w[i[j+1]][0])**2+(w[i[j]][1]-w[i[j+1]][1])**2)**0.5
ans+=chk
p+=1
print(ans/p)
|
import itertools
n=int(input())
l=[int(i) for i in range(n)]
ans=chk=p=0
w=[]
for i in range(n):
x,y=map(int,input().split())
w.append((x,y))
for i in list(itertools.permutations(l,n)):
chk=0
for j in range(n-1):
chk+=((w[i[j]][0]-w[i[j+1]][0])**2+(w[i[j]][1]-w[i[j+1]][1])**2)**0.5
ans+=chk
p+=1
print(ans/p)
|
[] | 664,685
| 664,686
|
u123756661
|
python
|
p02861
|
import sys
input=sys.stdin.readline
import math
from collections import defaultdict,deque
from itertools import permutations
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
"""========main code==============="""
t=ii()
lol=[]
for i in range(t):
a,b=ml()
lol.append([a,b])
yo=0
cnt=1
for i in list(permutations(lol)):
for j in range(1,len(i)):
x=i[j][0]-i[j-1][0]
y=i[j][1]-i[j-1][1]
yo+=math.sqrt(x*x+y*y)
cnt+=1
print(yo/cnt)
|
import sys
input=sys.stdin.readline
import math
from collections import defaultdict,deque
from itertools import permutations
ml=lambda:map(int,input().split())
ll=lambda:list(map(int,input().split()))
ii=lambda:int(input())
ip=lambda:list(input())
ips=lambda:input().split()
"""========main code==============="""
t=ii()
lol=[]
for i in range(t):
a,b=ml()
lol.append([a,b])
yo=0
cnt=0
for i in list(permutations(lol)):
for j in range(1,len(i)):
x=i[j][0]-i[j-1][0]
y=i[j][1]-i[j-1][1]
yo+=math.sqrt(x*x+y*y)
cnt+=1
print(yo/cnt)
|
[
"literal.number.integer.change",
"assignment.value.change"
] | 664,687
| 664,688
|
u706984643
|
python
|
p02861
|
import math
def distance(x1,x2,y1,y2):
d=math.sqrt((x1-x2)**2+(y1-y2)**2)
return d
count=int(input())
zahyou=[]
for i in range(count):
a=input().split(" ")
zahyou.append(a)
lenth=0
for i in zahyou:
for j in zahyou:
lenth=lenth+distance(int(i[0]),int(j[0]),int(i[1]),int(j[1]))
print(lenth//math.factorial(count))
|
import math
def distance(x1,x2,y1,y2):
d=math.sqrt((x1-x2)**2+(y1-y2)**2)
return d
count=int(input())
zahyou=[]
for i in range(count):
a=input().split(" ")
zahyou.append(a)
lenth=0
for i in zahyou:
for j in zahyou:
lenth=lenth+distance(int(i[0]),int(j[0]),int(i[1]),int(j[1]))
print(lenth/count)
|
[
"expression.operator.arithmetic.change",
"call.arguments.change",
"expression.operation.binary.change",
"io.output.change",
"call.remove"
] | 664,689
| 664,690
|
u437351386
|
python
|
p02861
|
n = int(input())
x = []
y = []
for _ in range(n):
a,b = map(int,input().split())
x.append(a)
y.append(b)
ans = 0
for i in range(n):
for j in range(n):
print(i,j)
ans += ((x[i]-x[j])**2 + (y[i]-y[j])**2)**0.5
print(ans/n)
|
n = int(input())
x = []
y = []
for _ in range(n):
a,b = map(int,input().split())
x.append(a)
y.append(b)
ans = 0
for i in range(n):
for j in range(n):
ans += ((x[i]-x[j])**2 + (y[i]-y[j])**2)**0.5
print(ans/n)
|
[
"call.remove"
] | 664,693
| 664,694
|
u397953026
|
python
|
p02861
|
n=int(input())
towns=[None]*n
for i in range(n):
x,y=map(int,input().split())
towns[i]=[x,y]
routes=0
import math
for i in range(len(towns)):
for j in range(i+1,len(towns)):
routes+=math.sqrt((towns[i][0]-towns[j][0])**2+(towns[i][1]-towns[j][1])**2)
# routes 全ルートの合計
if n==2:
print(routes)
else:
print(routes/n)
|
n=int(input())
towns=[None]*n
for i in range(n):
x,y=map(int,input().split())
towns[i]=[x,y]
routes=0
import math
for i in range(len(towns)):
for j in range(i+1,len(towns)):
routes+=math.sqrt((towns[i][0]-towns[j][0])**2+(towns[i][1]-towns[j][1])**2)
# routes 全ルートの合計
if n==2:
print(routes)
else:
print(routes*2/n)
|
[
"expression.operation.binary.add"
] | 664,709
| 664,710
|
u936985471
|
python
|
p02861
|
# -*- coding: utf-8 -*-
# モジュールのインポート
import math
import itertools
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力を取得
"""
N = int(input())
x, y = [], []
for n in range(N):
x_n, y_n = list(map(int, input().split()))
x.append(x_n)
y.append(y_n)
return N, x, y
def get_distance(x: list, y: list, i: int, j: int) -> float:
"""
町iと町jの間の距離を取得する.
Args:\n
x (list): 町のx座標
y (list): 町のy座標
i (int): 町
j (int): 町
Returns:\n
float: 町iと町jの間の距離
"""
return math.sqrt((x[i] - x[j])**2 + (y[i] - y[j])**2)
def get_path_length(N: int, distance: dict, path: list) -> float:
"""
経路の長さを求める.
Args:\n
N (int): 町の数
distance (dict): 町間の距離
path (list): 経路
Returns:\n
float: 経路の長さ
"""
path_length = 0
for n in range(N - 1):
path_length += distance[(path[n], path[n + 1])]
return path_length
def main(N: int, x: list, y: list) -> None:
"""
メイン処理.
Args:\n
N (int): 町の数
x (list): 町のx座標
y (list): 町のy座標
"""
# 事前に町間の距離情報を作っておく
distance = {}
for i, j in itertools.product(range(N), repeat=2):
distance[(i, j)] = get_distance(i, j)
# 求解処理
ans = 0
for path in itertools.permutations(range(N)):
ans += get_path_length(distance, path)
ans /= math.factorial(N)
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
N, x, y = get_input()
# メイン処理
main(N, x, y)
|
# -*- coding: utf-8 -*-
# モジュールのインポート
import math
import itertools
def get_input() -> tuple:
"""
標準入力を取得する.
Returns:\n
tuple: 標準入力を取得
"""
N = int(input())
x, y = [], []
for n in range(N):
x_n, y_n = list(map(int, input().split()))
x.append(x_n)
y.append(y_n)
return N, x, y
def get_distance(x: list, y: list, i: int, j: int) -> float:
"""
町iと町jの間の距離を取得する.
Args:\n
x (list): 町のx座標
y (list): 町のy座標
i (int): 町
j (int): 町
Returns:\n
float: 町iと町jの間の距離
"""
return math.sqrt((x[i] - x[j])**2 + (y[i] - y[j])**2)
def get_path_length(N: int, distance: dict, path: list) -> float:
"""
経路の長さを求める.
Args:\n
N (int): 町の数
distance (dict): 町間の距離
path (list): 経路
Returns:\n
float: 経路の長さ
"""
path_length = 0
for n in range(N - 1):
path_length += distance[(path[n], path[n + 1])]
return path_length
def main(N: int, x: list, y: list) -> None:
"""
メイン処理.
Args:\n
N (int): 町の数
x (list): 町のx座標
y (list): 町のy座標
"""
# 事前に町間の距離情報を作っておく
distance = {}
for i, j in itertools.product(range(N), repeat=2):
distance[(i, j)] = get_distance(x, y, i, j)
# 求解処理
ans = 0
for path in itertools.permutations(range(N)):
ans += get_path_length(N, distance, path)
ans /= math.factorial(N)
# 結果出力
print(ans)
if __name__ == "__main__":
# 標準入力を取得
N, x, y = get_input()
# メイン処理
main(N, x, y)
|
[
"call.arguments.add"
] | 664,719
| 664,720
|
u416011173
|
python
|
p02861
|
def distance(a,b):
return ((a[0]-b[0])**2+(a[1]-b[1])**2)**0.5
n = int(input())
a = [tuple(map(int,input().split())) for _ in range(n)]
l = []
for m in list(itertools.permutations(a)):
d = 0
for i in range(n-1):
d += distance(m[i],m[i+1])
l.append(d)
print(sum(l)/len(l))
|
import itertools
def distance(a,b):
return ((a[0]-b[0])**2+(a[1]-b[1])**2)**0.5
n = int(input())
a = [tuple(map(int,input().split())) for _ in range(n)]
l = []
for m in list(itertools.permutations(a)):
d = 0
for i in range(n-1):
d += distance(m[i],m[i+1])
l.append(d)
print(sum(l)/len(l))
|
[] | 664,723
| 664,724
|
u405733072
|
python
|
p02861
|
from itertools import permutations
N = int(input())
xy = [tuple(map(int,input().split())) for _ in range(N)]
city = list(permutations(xy))
all_len = 0
for i in city:
sum_len = 0
for j in range(1,N):
sum_len += ((i[j][0]-i[j-1][0])**2 +(i[j][1]-i[j-1][1]))**0.5
all_len += sum_len
print(all_len/len(city))
|
from itertools import permutations
import math
N = int(input())
xy = [tuple(map(int,input().split())) for _ in range(N)]
city = list(permutations(xy))
all_len = 0
for i in city:
sum_len = 0
for j in range(1,N):
sum_len += ((i[j][0]-i[j-1][0])**2 +(i[j][1]-i[j-1][1])**2)**0.5
all_len += sum_len
print(all_len/len(city))
|
[
"expression.operation.binary.add"
] | 664,727
| 664,728
|
u698868214
|
python
|
p02861
|
import math
n=int(input())
p=[]
for i in range(n):
p.append(list(map(int,input().split())))
#print(p)
ans=0
for i in range(n):
for j in range(n):
if i!=j:
print(i,j)
ans+=math.sqrt((p[j][0]-p[i][0])**2+(p[j][1]-p[i][1])**2)
ans/=n
print(ans)
|
import math
n=int(input())
p=[]
for i in range(n):
p.append(list(map(int,input().split())))
#print(p)
ans=0
for i in range(n):
for j in range(n):
if i!=j:
ans+=math.sqrt((p[j][0]-p[i][0])**2+(p[j][1]-p[i][1])**2)
ans/=n
print(ans)
|
[
"call.remove"
] | 664,729
| 664,730
|
u313890617
|
python
|
p02861
|
N = int(input())
x = [list(map(int,input().split())) for _ in range(N)]
su = 0
for i in range(N):
for j in range(N):
su += ((x[i][0]-x[j][0])**2 + (x[i][1]-x[j][1])**2)**0.5
print(su)
ans = su / N
print(ans)
|
N = int(input())
x = [list(map(int,input().split())) for _ in range(N)]
su = 0
for i in range(N):
for j in range(N):
su += ((x[i][0]-x[j][0])**2 + (x[i][1]-x[j][1])**2)**0.5
ans = su / N
print(ans)
|
[
"call.remove"
] | 664,731
| 664,732
|
u131464432
|
python
|
p02861
|
def dist(x0, y0, x1, y1):
return math.sqrt((x0 - x1) ** 2 + (y0 - y1) ** 2)
def resolve():
N = int(input())
x, y = [], []
for _ in range(N):
x_tmp, y_tmp = list(map(int, input().split()))
x.append(x_tmp)
y.append(y_tmp)
ls = list(permutations(list(range(N)), N))
ans = 0
for l in ls:
idx = 0
while idx + 1 < len(l):
ans += dist(x[l[idx]], y[l[idx]], x[l[idx+1]], y[l[idx+1]])
idx += 1
print(ans / len(ls))
return
resolve()
|
import math
from itertools import permutations
def dist(x0, y0, x1, y1):
return math.sqrt((x0 - x1) ** 2 + (y0 - y1) ** 2)
def resolve():
N = int(input())
x, y = [], []
for _ in range(N):
x_tmp, y_tmp = list(map(int, input().split()))
x.append(x_tmp)
y.append(y_tmp)
ls = list(permutations(list(range(N)), N))
ans = 0
for l in ls:
idx = 0
while idx + 1 < len(l):
ans += dist(x[l[idx]], y[l[idx]], x[l[idx+1]], y[l[idx+1]])
idx += 1
print(ans / len(ls))
return
resolve()
|
[] | 664,733
| 664,734
|
u364386647
|
python
|
p02861
|
n = int(input())
x = []
y = []
index = []
for i in range(n):
xi, yi = map(int, input().split())
x.append(xi)
y.append(yi)
index.append(i)
distance = 0
for v in itertools.permutations(index):
for i in range(n-1):
distance += math.sqrt((x[v[i]] - x[v[i+1]]) **
2 + (y[v[i]]-y[v[i+1]])**2)
print(distance/math.factorial(n))
|
import itertools
import math
n = int(input())
x = []
y = []
index = []
for i in range(n):
xi, yi = map(int, input().split())
x.append(xi)
y.append(yi)
index.append(i)
distance = 0
for v in itertools.permutations(index):
for i in range(n-1):
distance += math.sqrt((x[v[i]] - x[v[i+1]]) **
2 + (y[v[i]]-y[v[i+1]])**2)
print(distance/math.factorial(n))
|
[] | 664,737
| 664,738
|
u671060652
|
python
|
p02861
|
import math
N = int(input())
xy = [list(map(int, input().split())) for i in range(N)]
k = 0
total = 0
for j in range(N-1):
for i in range(j + 1, N-1):
total += ((xy[j][0] - xy[i][0])**2 + (xy[j][1]-xy[i][1])**2)**(1/2)
k += 1
total = total * 2
print(total/N)
|
import math
N = int(input())
xy = [list(map(int, input().split())) for i in range(N)]
k = 0
total = 0
for j in range(N-1):
for i in range(j + 1, N):
total += ((xy[j][0] - xy[i][0])**2 + (xy[j][1]-xy[i][1])**2)**(1/2)
k += 1
total = total * 2
print(total/N)
|
[
"expression.operation.binary.remove"
] | 664,739
| 664,740
|
u944643608
|
python
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.