Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
N = str(input())
flag = 0
for i in range(len(N)):
    if int(N[i]) == 7:
        print ('Yes')
        flag = 1
        break
101if flag == 0:
    print ('No')

Fixed submission:
N = str(input())
flag = 0
for i in range(len(N)):
    if int(N[i]) == 7:
        print ('Yes')
        flag = 1
        break
if flag == 0:
    print ('No')

Buggy python submission (verdict: Runtime Error):
N = str(input())
flag = 0
for i in range(len(N))
	if int(N[i]) == 7:
    	print ('Yes')
      	flag = 1
    	break
if flag == 0:
  print ('No')

Fixed submission:
N = str(input())
flag = 0
for i in range(len(N)):
    if int(N[i]) == 7:
        print ('Yes')
        flag = 1
        break
if flag == 0:
    print ('No')
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
self_front = [0]*(2*(10**5)+3)
for i in range(N):
    if(i-A[i] >= 0):
        self_front[i-A[i]] += 1
cnt = 0
for i in range(N):
    cnt += self_front[i+A[i]]
print(cnt)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
self_front = [0]*(2*(10**5)+3)
for i in range(N):
    if(i-A[i] >= 0):
        self_front[i-A[i]] += 1
cnt = 0
for i in range(N):
    if(i+A[i] < 2*(10**5)+3):
        cnt += self_front[i+A[i]]
print(cnt)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
self_front = [0]*(2*(10**5))
self_back = [0]*(2*(10**5))
for i in range(N):
    if(i-A[i] >= 0):
        self_front[i-A[i]] += 1
cnt = 0
for i in range(N):
    cnt += self_front[i+A[i]]
print(cnt)

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
self_front = [0]*(2*(10**5)+3)
for i in range(N):
    if(i-A[i] >= 0):
        self_front[i-A[i]] += 1
cnt = 0
for i in range(N):
    if(i+A[i] < 2*(10**5)+3):
        cnt += self_front[i+A[i]]
print(cnt)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
ans = [0]*N
for i in range(N):
    ans[A[i]-1] += 1
for i in range(N):
    print(ans[i])

Fixed submission:
N = int(input())
A = list(map(int,input().split()))
ans = [0]*N
for i in range(N-1):
    ans[A[i]-1] += 1
for i in range(N):
    print(ans[i])
Buggy python submission (verdict: Runtime Error):
N

Fixed submission:
N = int(input())
if(N%10 == 7 or (N//10)%10 == 7 or (N//100)%100 == 7):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = list(input())
r = S.count('R')
g = S.count('G')
b = S.count('B')
cnt=0
for i in range(N-2):
    for j in range(i+1,N-1):
        if(j+(j-i) >= N):
            continue
        if((S[j+(j-i)] != S[i]) and (S[j+(j-i)] != S[j]) and (S[i] != S[j])):
            cnt += 1
print(r*g*b-cnt)

Fixed submission:
N = int(input())
S = list(input())
r = S.count('R')
g = S.count('G')
b = S.count('B')
cnt=0
for i in range(N-2):
    for j in range(i+1,N-1):
        if(j+(j-i) >= N):
            break
        if((S[j+(j-i)] != S[i]) and (S[j+(j-i)] != S[j]) and (S[i] != S[j])):
            cnt += 1
print(r*g*b-cnt)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
S = list(input())
def have_c(c):
    if(c=='R'):
        return 4
    elif(c=='G'):
        return 2
    elif(c=='B'):
        return 1
    return 0

def have_n(n):
    if(n==4):
        return 'R'
    elif(n==2):
        return 'G'
    elif(n==1):
        return 'B'
    return 0
    
ans = 0
for i in range(N-3):
    for j in range(i+1,N-1):
        hav = have_c(S[i])
        if(hav == have_c(S[j])):
            continue
        hav += have_c(S[j])
        last_alpha = have_n(7-hav)
        for k in range(j+1,N):
            if(j-i == k-j):
                continue
            if(S[k]==last_alpha):
                ans +=1
print(ans)

Fixed submission:
N = int(input())
S = list(input())
r = S.count('R')
g = S.count('G')
b = S.count('B')
cnt=0
for i in range(N-2):
    for j in range(i+1,N-1):
        if(j+(j-i) >= N):
            break
        if((S[j+(j-i)] != S[i]) and (S[j+(j-i)] != S[j]) and (S[i] != S[j])):
            cnt += 1
print(r*g*b-cnt)
Buggy python submission (verdict: Runtime Error):
S = input()
N = len(S)
def kaibun(s,n):
    for i in range(n//2):
        if(s[i]!=s[n-i-1]):
            return false
    return true

if(kaibun(S,N) & kaibun(S[0:(N+1)//2-1],N//2) & kaibun(S[N:(N+3)//2-2:-1],N//2)):
    print("Yes")
else:
    print("No")

Fixed submission:
S = input()
N = len(S)
def kaibun(s,n):
    for i in range(n//2):
        if(s[i]!=s[n-i-1]):
            return False
    return True

if(kaibun(S,N) & kaibun(S[0:(N+1)//2-1],N//2) & kaibun(S[N:(N+3)//2-2:-1],N//2)):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
n,k = map(int,input().split())
p = list(map(int,input().split()))
m=0;s=0;
for i in range(n-k+1):
    s=0;
    for j in range(k):
        s += sum(range(p[i+j]+1))/p[i+j]
    if(m<s):m=s
print(m)

Fixed submission:
n,k = map(int,input().split())
p = list(map(int,input().split()))
m=0
s=[0]
for i in range(n):
    s.append((p[i])*(p[i]+1)/2/p[i])
    s[i+1] += s[i]

for i in range(n-k+1):
    a=s[k+i]-s[i]
    if(m<a):m=a
print(m)
Buggy python submission (verdict: Runtime Error):
n,k=map(int, input().split())
print (n-(k-1))

Fixed submission:
n,k=map(int, input().split())
print (n-(k-1))
Buggy python submission (verdict: Runtime Error):
import math
N,X = map(int,input().split())
x = list(map(int,input().split()))
D = abs(x[0]-X)
for i in range(1,N):
    D = math.gcd(D, abs(X-x[i]))
print(D)

Fixed submission:
import fractions
N,X = map(int,input().split())
x = list(map(int,input().split()))
D = abs(x[0]-X)
for i in range(1,N):
    D = fractions.gcd(D, abs(X-x[i]))
print(D)
Buggy python submission (verdict: Runtime Error):
X = int(input())
while(1):
    for i in range(2,11):
        f = pow(X,1.0/float(i))
        if(1-f%1<=10**-8):
            print(X)
            exit()
    X-=1


Fixed submission:
X = int(input())
ans=0
for p in range(2,10):
    for b in range(1,32):
        if(b**p <= X and ans < b**p):
            ans = b**p
print(ans)
Buggy python submission (verdict: Runtime Error):
ss=input().split()
a,b=list(map(int,input()))
s=input()
if s==ss[0]: print(a-1,b)
elif s==ss[1]:print(a,b-1)

Fixed submission:
sp=input().split()
A,B=list(map(int,input().split()))
s=input()
if sp[0]==s:print(A-1,B)
elif sp[1]==s:print(A,B-1)
Buggy python submission (verdict: Runtime Error):
N=int(input())
a=[int(input() ) for i in range(N)]
for i in range(N-1):
  if a[i]==a[i+1]:
    print("NO")
    exit(0)
print("YES")

Fixed submission:
N=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(N-1):
  if a[i]==a[i+1]:
    print("NO")
    exit(0)
print("YES")

Buggy python submission (verdict: Time Limit Exceeded):
input()
l=input().split()
for i in l:
  if l.count(i)!=1:
    print("NO")
    exit(0)
print("YES")

Fixed submission:
N=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(N-1):
  if a[i]==a[i+1]:
    print("NO")
    exit(0)
print("YES")

Buggy python submission (verdict: Runtime Error):
import collecttions
l=list(map(int,input().split()))
for i in l:
  if l.count(i)!=1:
    print("NO")
    exit(0)
print("YES")
  


Fixed submission:
N=int(input())
a=list(map(int,input().split()))
a.sort()
for i in range(N-1):
  if a[i]==a[i+1]:
    print("NO")
    exit(0)
print("YES")
Buggy python submission (verdict: Runtime Error):
N=int(input())
his=[int(input()) for i in range(N)]
DP=[]
DP.append(0)
DP.append(abs(his[0]-his[1]))
for i in range(2,N):
  DP.append(min(DP[i-1]+abs(his[i-1]-his[i]),DP[i-2]+abs(his[i-2]-his[i])))
print(DP)

Fixed submission:
N=int(input())
his=list(map(int,input().split()))
DP=[]
DP.append(0)
DP.append(abs(his[0]-his[1]))
for i in range(2,N):
  DP.append(min(DP[i-1]+abs(his[i-1]-his[i]),DP[i-2]+abs(his[i-2]-his[i])))
print(DP[-1])

Buggy python submission (verdict: Runtime Error):
N=int(input())
his=list(int,input().split())
DP=[]
DP.append(0)
DP.append(his[0]-his[1])
for i in range(2,len(his)):
  DP.append(max(DP[i-1]-his[i],DP[i-2])
print(DP[-1])


Fixed submission:
N=int(input())
his=list(map(int,input().split()))
DP=[]
DP.append(0)
DP.append(abs(his[0]-his[1]))
for i in range(2,N):
  DP.append(min(DP[i-1]+abs(his[i-1]-his[i]),DP[i-2]+abs(his[i-2]-his[i])))
print(DP[-1])

Buggy python submission (verdict: Runtime Error):
N=int(input())
his=input().split()
DP=[]
DP.append(0)
DP.append(his[0]-his[1])
for i in range(2,len(his)):
  DP.append(max(DP[i-1]-his[i],DP[i-2])
print(DP[-1])


Fixed submission:
N=int(input())
his=list(map(int,input().split()))
DP=[]
DP.append(0)
DP.append(abs(his[0]-his[1]))
for i in range(2,N):
  DP.append(min(DP[i-1]+abs(his[i-1]-his[i]),DP[i-2]+abs(his[i-2]-his[i])))
print(DP[-1])

Buggy python submission (verdict: Runtime Error):
N=int(input())
his=input().split()
DP=[]
DP.append(0)
DP.append(his[0]-his[1])
for i in range(2,len(his)):
  DP.append(max(DP[i-1]-his[i],DP[i-2])
print(DP[-1]

Fixed submission:
N=int(input())
his=list(map(int,input().split()))
DP=[]
DP.append(0)
DP.append(abs(his[0]-his[1]))
for i in range(2,N):
  DP.append(min(DP[i-1]+abs(his[i-1]-his[i]),DP[i-2]+abs(his[i-2]-his[i])))
print(DP[-1])
Buggy python submission (verdict: Runtime Error):
N = input()
str_list = [input() for _ in range(N)]

print(len(set(str_list)))

Fixed submission:
N = int(input())
str_list = [input() for _ in range(N)]

print(len(set(str_list)))
Buggy python submission (verdict: Time Limit Exceeded):
str_list = str(input())
length = len(str_list)
 
cnt = 4
result = 0
 
for i in range(length-3):
    for j in range(length-cnt+1):
        if int(str_list[j:j+cnt])%2019 == 0:
            result += 1
    cnt += 1
 
print(result)

Fixed submission:
S = str(input())
N = len(S)

num = [0] * 2019
num[0] = 1
prev = 0
result = 0
_10 = 1
for i in range(N-1, -1, -1):
    prev = (prev + int(S[i]) * _10) % 2019
    _10 *= 10
    _10 %= 2019
    result += num[prev]
    num[prev] += 1

print(result)

Buggy python submission (verdict: Time Limit Exceeded):
str_list = str(input())
length = len(str_list)

cnt = 4
result = 0

for i in range(length-3):
    for j in range(length-cnt+1):
        if int(str_list[j:j+cnt])%2019 == 0:
            result += 1
    cnt += 1

print(result)

Fixed submission:
S = str(input())
N = len(S)

num = [0] * 2019
num[0] = 1
prev = 0
result = 0
_10 = 1
for i in range(N-1, -1, -1):
    prev = (prev + int(S[i]) * _10) % 2019
    _10 *= 10
    _10 %= 2019
    result += num[prev]
    num[prev] += 1

print(result)
Buggy python submission (verdict: Runtime Error):
N = input()

print(2*N*3.1416)

Fixed submission:
N = float(input())
 
print(2*N*3.1416)
Buggy python submission (verdict: Runtime Error):
N = input()
A = list(map(int, input().split()))

result = [0]*N

for i in range(N-1):
    result[A[i]-1] += 1

for i in range(N):
    print(result[i])

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
 
result = [0]*N
 
for i in range(N-1):
    result[A[i]-1] += 1
 
for i in range(N):
    print(result[i])
Buggy python submission (verdict: Runtime Error):
N = list(map(int, input().split()))
N = NK[0]; K = NK[1]

result = 0
for i in range(K,N+2):
    result += i*(N-i+1) +1

print(result)


Fixed submission:
NK = list(map(int, input().split()))
N = NK[0]; K = NK[1]
 
result = 0
for i in range(K,N+2):
    result += i*(N-i+1) +1
    result = result%1000000007
 
print(result)
Buggy python submission (verdict: Runtime Error):
import sys

s = input()

if s = 'AAA' or s = 'BBB':
  print('No')
  sys.exit()
 
print('Yes')

Fixed submission:
import sys

s = input()

if s == 'AAA' or s == 'BBB':
    print('No')
    sys.exit()

print('Yes')
Buggy python submission (verdict: Time Limit Exceeded):
S = list(input())
q = int(input())
procedure = [list(input().split()) for i in range(q)]

cnt = 0

for i in range(q):
    if procedure[i][0] == '1':
        cnt += 1
    if procedure[i][0] == '2':
        if (procedure[i][1] == '1' and cnt%2 == 0) or (procedure[i][1] == '2' and cnt%2 == 1):
            S.insert(0,procedure[i][2])
        else:
            S.append(procedure[i][2])

if cnt%2 == 1:
    S.reverse()
    
print(''.join(S))

Fixed submission:
S = list(input())
q = int(input())
procedure = [list(input().split()) for i in range(q)]

cnt = 0
S2 = []

for i in range(q):
    if procedure[i][0] == '1':
        cnt += 1
    if procedure[i][0] == '2':
        if (procedure[i][1] == '1' and cnt%2 == 0) or (procedure[i][1] == '2' and cnt%2 == 1):
            S2.append(procedure[i][2])
        else:
            S.append(procedure[i][2])

S2.reverse()
S = S2 + S
if cnt%2 == 1:
    S.reverse()

print(''.join(S))

Buggy python submission (verdict: Time Limit Exceeded):
S = list(input())
q = int(input())
procedure = [list(input().split()) for i in range(q)]

for i in range(q):
    if procedure[i][0] == '1':
        S.reverse()
    if procedure[i][0] == '2':
        if procedure[i][1] == '1':
            S.insert(0,procedure[i][2])
        else:
            S.append(procedure[i][2])

print(''.join(S))


Fixed submission:
S = list(input())
q = int(input())
procedure = [list(input().split()) for i in range(q)]

cnt = 0
S2 = []

for i in range(q):
    if procedure[i][0] == '1':
        cnt += 1
    if procedure[i][0] == '2':
        if (procedure[i][1] == '1' and cnt%2 == 0) or (procedure[i][1] == '2' and cnt%2 == 1):
            S2.append(procedure[i][2])
        else:
            S.append(procedure[i][2])

S2.reverse()
S = S2 + S
if cnt%2 == 1:
    S.reverse()

print(''.join(S))
Buggy python submission (verdict: Runtime Error):
import sys

nmlist = list(map(int, input().split()))
N = nmlist[0]
M = nmlist[1]
order_list = [list(map(int, input().split())) for _ in range(M)]

cnt = 0

for k in range(M):
    if order_list[k] == [1,0]:
        cnt += 1

if cnt == M:
    print(0)
    sys.exit()

for j in range(M):
    if order_list[j][0] > N:
        print(-1)
        sys.exit()
    if order_list[j][0] == 1 and order_list[j][1] == 0:
        print(-1)
        sys.exit()

for i in range(M):
    if Number[order_list[i][0]-N+2] != 0 and Number[order_list[i][0]-N+2] != order_list[i][1]:
        print(-1)
        sys.exit()
    Number[order_list[i][0]-N+2] = order_list[i][1]

if Number[3-N] == 0:
    Number[3-N] = 1

print(100*Number[0]+10*Number[1]+Number[2])

Fixed submission:
import sys
 
nmlist = list(map(int, input().split()))
N = nmlist[0]
M = nmlist[1]
order_list = [list(map(int, input().split())) for _ in range(M)]
 
Number = [0,0,0]
cnt = 0

for k in range(M):
    if N==1 and order_list[k] == [1,0]:
        cnt += 1
 
if cnt == M and cnt>0:
    print(0)
    sys.exit()
for j in range(M):
    if order_list[j][0] > N:
        print(-1)
        sys.exit()
    if order_list[j][0] == 1 and order_list[j][1] == 0:
        print(-1)
        sys.exit()
 
for i in range(M):
    if Number[order_list[i][0]-N+2] != 0 and Number[order_list[i][0]-N+2] != order_list[i][1]:
        print(-1)
        sys.exit()
    Number[order_list[i][0]-N+2] = order_list[i][1]
 
if N == 1 and Number[0]+Number[1]+Number[2] == 0:
    print(0)
    sys.exit()
 
if Number[3-N] == 0:
    Number[3-N] = 1
 
print(100*Number[0]+10*Number[1]+Number[2])
Buggy python submission (verdict: Runtime Error):
N = input()
coordinate = list(map(int, input().split()))
result = 0
resultl = 0

for j in range(N):
    result += (1-coordinate[j])**2

for i in range(1,101):
    for k in range(N):
        resultl += (i-coordinate[k])**2

    if resultl < result:
        result = resultl
    resultl = 0

print(result)

Fixed submission:
N = int(input())
coordinate = list(map(int, input().split()))
result = 0
resultl = 0
 
for j in range(N):
    result += (1-coordinate[j])**2
    
for i in range(1,101):
    for k in range(N):
        resultl += (i-coordinate[k])**2
 
    if resultl < result:
        result = resultl
    resultl = 0
    
print(result)
Buggy python submission (verdict: Runtime Error):
S = str(input())
result = []

for i in range(len(S)):
  result.append(x)

result = ''.join(result)
print(result)

Fixed submission:
S = str(input())
result = []
 
for i in range(len(S)):
  result.append('x')
 
result = ''.join(result)
print(result)
Buggy python submission (verdict: Runtime Error):
import sys
N = input()
numlist = list(map(int, input().split()))

for i in range(N):
  if numlist[0] == numlist[i]:
    print('No')
    sys.exit()

print('Yes')

Fixed submission:
import sys
N = int(input())
numlist = list(map(int, input().split()))

numlist.sort()
for i in range(N-1):
    if numlist[i] == numlist[i+1]:
        print('NO')
        sys.exit()

print('YES')
Buggy python submission (verdict: Runtime Error):
N = input()
cnt = 0

while N>1:
    N = int(N/2)
    cnt +=1

print(2**(cnt+1)-1)

Fixed submission:
N = int(input())
cnt = 0

while N>1:
    N = int(N/2)
    cnt +=1

print(2**(cnt+1)-1)
Buggy python submission (verdict: Runtime Error):
N = int(input)
P = list(map(int, input().split()))

result = 0
mini = [P[0]]

for i in range(N-1):
    if mini[i]>P[i+1]:
        mini.append(P[i+1])
    else:
        mini.append(mini[i])

for i in range(N):
    if P[i]==mini[i]:
        result += 1

print(result)


Fixed submission:
N = int(input())
P = list(map(int, input().split()))
 
result = 0
mini = [P[0]]
 
for i in range(N-1):
    if mini[i]>P[i+1]:
        mini.append(P[i+1])
    else:
        mini.append(mini[i])
 
for i in range(N):
    if P[i]==mini[i]:
        result += 1
 
print(result)
Buggy python submission (verdict: Runtime Error):
ST = list(map(str, inpuy().split()))

print(ST[1]+ST[0])

Fixed submission:
ST = list(map(str, input().split()))
 
print(ST[1]+ST[0])
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(S: str):
    n = 0
    while n != len(S):
        if n % 2 == 1:
            break
        if S[n] == "h" and S[n+1] == "i":
            n += 2
        else:
            break
    if n == len(S):
        print(YES)
    else:
        print(NO)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()


Fixed submission:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(S: str):
    if len(S) % 2 == 1:
        print(NO)
        exit()
    n = 0
    while n != len(S):
        if S[n] == "h" and S[n+1] == "i":
            n += 2
        else:
            break
    if n == len(S):
        print(YES)
    else:
        print(NO)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()

Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(S: str):
    n = 0
    while n != len(S):
        if S[n] == "h" and S[n+1] == "i":
            n += 2
        else:
            break
    if n == len(S):
        print(YES)
    else:
        print(NO)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()


Fixed submission:
#!/usr/bin/env python3
import sys

YES = "Yes"  # type: str
NO = "No"  # type: str


def solve(S: str):
    if len(S) % 2 == 1:
        print(NO)
        exit()
    n = 0
    while n != len(S):
        if S[n] == "h" and S[n+1] == "i":
            n += 2
        else:
            break
    if n == len(S):
        print(YES)
    else:
        print(NO)


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    solve(S)

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
a,c,c,cafjdsiaof

Fixed submission:
#coding:utf-8
import bisect
from collections import deque
import sys
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = lambda *something : print(*something) if DEBUG else 0
DEBUG = True

def index(a,b):
    return str(min(a,b)) + "," +  str(max(a, b))

def main(given = sys.stdin.readline):
    input = lambda : given().rstrip()
    LMIIS = lambda : list(map(int,input().split()))
    II = lambda : int(input())
    XLMIIS = lambda x : [LMIIS() for _ in range(x)]

    a = LMIIS()

    if a[0] + a[1] + a[2] >= 22:
        print("bust")
    else:
        print("win")





if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
n = int(input)
xy = [list(map(int,input().split())) for _ in range(n)]

ans = 0
for i in range(n-1):
  for j in range(i+1,n):
    ans += ((xy[i][0] - xy[i][1])**2 + (xy[j][0] - xy[j][1])**2)**0.5
print(ans*2/n)


Fixed submission:
n = int(input())
xy = [list(map(int,input().split())) for _ in range(n)]

ans = 0
for i in range(n-1):
  for j in range(i+1,n):
    ans += ((xy[i][0] - xy[j][0])**2 + (xy[i][1] - xy[j][1])**2)**0.5
print(ans*2/n)

Buggy python submission (verdict: Runtime Error):
n = int(input)
xy = [list(map(int,input().split())) for _ in range(n)]

ans = 0
for i in range(n-1):
  for j in range(i+1,n):
    ans += pow(pow(xy[i][0] - xy[i][1],2) + pow(xy[j][0] - xy[j][1],2),0.5)
print(ans*2/n)

Fixed submission:
n = int(input())
xy = [list(map(int,input().split())) for _ in range(n)]

ans = 0
for i in range(n-1):
  for j in range(i+1,n):
    ans += ((xy[i][0] - xy[j][0])**2 + (xy[i][1] - xy[j][1])**2)**0.5
print(ans*2/n)