Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
def insertionSort(A,N):
    for i in range(N):
        v = A [i]
        j = i-1
        while j>=0 and A[j] > v:
            A[j+1] = A[j]
            j = j -1
        A[j+1] = v
        print(A)

N = input()
A = input()
A = list(map(int, A.split()))
insertionSort(A,N)


Fixed submission:
def insertionSort(A,N):
    for i in range(N):
        v = A [i]
        j = i-1
        while j>=0 and A[j] > v:
            A[j+1] = A[j]
            j = j -1
        A[j+1] = v
        print(' '.join(map(str, A)))

N = input()
N = int(N)
A = input()
A = list(map(int, A.split()))
insertionSort(A,N)

Buggy python submission (verdict: Runtime Error):
def insertionSort(A,N):
    for i in range(N):
        v = A [i]
        j = i-1
        while j>=0 and A[j] > v:
            A[j+1] = A[j]
            j = j -1
        A[j+1] = v
        print(A)

N = input()
A = input()
A = list(map(int, A.split()))
insertionSort(A,N)


Fixed submission:
def insertionSort(A,N):
    for i in range(N):
        v = A [i]
        j = i-1
        while j>=0 and A[j] > v:
            A[j+1] = A[j]
            j = j -1
        A[j+1] = v
        print(' '.join(map(str, A)))

N = input()
N = int(N)
A = input()
A = list(map(int, A.split()))
insertionSort(A,N)
Buggy python submission (verdict: Runtime Error):
from collections import deque

# 命令数入力
n = int(input())
# 命令入力
order_list = [input().split() for i in range(n)]


# 双方向連結リスト
doubly_linked_list = deque()

for _ in range(n):
    
    #order = input().split()
    
    if order[0] == "insert":
        doubly_linked_list.appendleft(order[1])
    
    elif order[0] == "delete":
        if order[1] in doubly_linked_list:
            doubly_linked_list.remove(order[1])
    
    elif order[0] =="deleteFirst":
        doubly_linked_list.popleft()
    
    elif order[0] == "deleteLast":
        doubly_linked_list.pop()
        
# 最終結果出力
print(*doubly_linked_list)


Fixed submission:
from collections import deque

# 命令数入力
n = int(input())
# 命令入力
# order_list = [input().split() for i in range(n)]


# 双方向連結リスト
doubly_linked_list = deque()

for _ in range(n):
    
    order = input().split()
    
    if order[0] == "insert":
        doubly_linked_list.appendleft(order[1])
    
    elif order[0] == "delete":
        if order[1] in doubly_linked_list:
            doubly_linked_list.remove(order[1])
    
    elif order[0] =="deleteFirst":
        doubly_linked_list.popleft()
    
    elif order[0] == "deleteLast":
        doubly_linked_list.pop()
        
# 最終結果出力
print(*doubly_linked_list)

Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque

# 命令数入力
n = int(input())
# 命令入力
order_list = [input().split() for i in range(n)]


# 双方向連結リスト
doubly_linked_list = deque()

for order in order_list:
    
   
    
    if order[0] == "insert":
        doubly_linked_list.appendleft(order[1])
    
    elif order[0] == "delete":
        if order[1] in doubly_linked_list:
            doubly_linked_list.remove(order[1])
    
    elif order[0] =="deleteFirst":
        doubly_linked_list.popleft()
    
    elif order[0] == "deleteLast":
        doubly_linked_list.pop()
        
# 最終結果出力
print(*doubly_linked_list)


Fixed submission:
from collections import deque

# 命令数入力
n = int(input())
# 命令入力
# order_list = [input().split() for i in range(n)]


# 双方向連結リスト
doubly_linked_list = deque()

for _ in range(n):
    
    order = input().split()
    
    if order[0] == "insert":
        doubly_linked_list.appendleft(order[1])
    
    elif order[0] == "delete":
        if order[1] in doubly_linked_list:
            doubly_linked_list.remove(order[1])
    
    elif order[0] =="deleteFirst":
        doubly_linked_list.popleft()
    
    elif order[0] == "deleteLast":
        doubly_linked_list.pop()
        
# 最終結果出力
print(*doubly_linked_list)
Buggy python submission (verdict: Runtime Error):
import sys
import numpy as np
import copy

fline = input().rstrip().split(' ')
N, Q = int(fline[0]), int(fline[1])

list = []
for i in range(N):
    tlist = []
    line = input().split(' ')
    tlist = [line[0], line[1]]
    #print(tlist)
    list.append(tlist)

#print(list)
current = 0
while len(list) != 0:
    if int(list[0][1]) <= Q:
        current += int(list[0][1])
        print(list[0][0] + " " + str(current))
        del list[0]
    else:
        list[0][1] = str((int)(list[0][1])-Q)
        list.append(list[0])
        del list[0]
        current += Q




Fixed submission:
import sys
#import numpy as np
import copy

fline = input().rstrip().split(' ')
N, Q = int(fline[0]), int(fline[1])

list = []
for i in range(N):
    tlist = []
    line = input().split(' ')
    tlist = [line[0], line[1]]
    #print(tlist)
    list.append(tlist)

#print(list)
current = 0
while len(list) != 0:
    if int(list[0][1]) <= Q:
        current += int(list[0][1])
        print(list[0][0] + " " + str(current))
        del list[0]
    else:
        list[0][1] = str((int)(list[0][1])-Q)
        list.append(list[0])
        del list[0]
        current += Q
    #print(list)

Buggy python submission (verdict: Runtime Error):
import sys
import numpy as np
import copy

fline = input().rstrip().split(' ')
N, Q = int(fline[0]), int(fline[1])

list = []
for i in range(N):
    tlist = []
    line = input().split(' ')
    tlist = [line[0], line[1]]
    #print(tlist)
    list.append(tlist)

#print(list)
current = 0
while len(list) != 0:
    if int(list[0][1]) <= Q:
        current += int(list[0][1])
        print(list[0][0] + " " + str(current))
        del list[0]
    else:
        list[0][1] = str((int)(list[0][1])-Q)
        list.append(list[0])
        del list[0]
        current += Q
    #print(list)



Fixed submission:
import sys
#import numpy as np
import copy

fline = input().rstrip().split(' ')
N, Q = int(fline[0]), int(fline[1])

list = []
for i in range(N):
    tlist = []
    line = input().split(' ')
    tlist = [line[0], line[1]]
    #print(tlist)
    list.append(tlist)

#print(list)
current = 0
while len(list) != 0:
    if int(list[0][1]) <= Q:
        current += int(list[0][1])
        print(list[0][0] + " " + str(current))
        del list[0]
    else:
        list[0][1] = str((int)(list[0][1])-Q)
        list.append(list[0])
        del list[0]
        current += Q
    #print(list)
Buggy python submission (verdict: Runtime Error):
a, b = int(input(x) for x in input().split())
print((a+b)/2, (a+b)*2)



Fixed submission:
a, b = (int(x) for x in input().split())
area = a*b
perimeter = (a+b)*2
print(area, perimeter)

Buggy python submission (verdict: Runtime Error):
a, b = int(input(x) for x in input().split())
print((a*b)/2, (a+b)*2)



Fixed submission:
a, b = (int(x) for x in input().split())
area = a*b
perimeter = (a+b)*2
print(area, perimeter)
Buggy python submission (verdict: Runtime Error):
x = input()
print(x^3)


Fixed submission:
x = int(input())
print(x**3)

Buggy python submission (verdict: Runtime Error):
x = input()
print(x**3)


Fixed submission:
x = int(input())
print(x**3)
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
print((a + b) * 2)


Fixed submission:
a , b = map(int, input().split())
print(a * b, (a + b) * 2)

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
print(a * b)
print((a + b) * 2)


Fixed submission:
a , b = map(int, input().split())
print(a * b, (a + b) * 2)

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
print(a*b, ' ', (a+b) * 2 )


Fixed submission:
a , b = map(int, input().split())
print(a * b, (a + b) * 2)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
ans = 0

def prime(x):
    if x<2:
        return 0
    elif x %2 == 0:
        if x ==2:
            return 1
        else :
            return 0
    else:
        i = 3
        while i**2<= x:
            if x % i== 0:
                return 0
        return 1

for i in range(N):
    x = int(input())
    if prime(x) ==1:
        ans +=1
print(ans)

Fixed submission:
import math

N = int(input())
ans = 0

def solve(x):
    if x==2:
        return 1
    elif x%2==0:
        return 0
    else:
        for i in range(3, math.ceil(math.sqrt(x)) + 1, 2):
            if x%i ==0:
                return 0
        return 1
for i in range(N):
    if solve(int(input())) ==1:
        ans +=1
print(ans)
Buggy python submission (verdict: Runtime Error):
x = raw_input()
y = pow(x,3)
print 'y'

Fixed submission:
x = int(raw_input())
print x ** 3

Buggy python submission (verdict: Runtime Error):
x ** 3

Fixed submission:
x = int(raw_input())
print x ** 3
Buggy python submission (verdict: Runtime Error):
S = int(raw_input())
h = int(S/3600)
m = int((S - 3600 * h)/60)
s = S - 3600 * h - 60 * m
print h + ":" + m + ":" + s

Fixed submission:
S = int(raw_input())

h = S/3600
m = (S - 3600*h)/60
s = S - 3600*h - 60*m

print '%d:%d:%d' %(h, m, s)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, raw_input().split())
d = a/b
r = a%b
f = a*1.0/b
print ???%d %d %f??? % (d,r,f)

Fixed submission:
a, b = map(int, raw_input().split())
d = a/b
r = a%b
f = a*1.0/b
print '%d %d %f' % (d,r,f)
Buggy python submission (verdict: Runtime Error):
n, m = map(int, raw_input().split())
a, b = [], []
for _ in range(n):
	a.append(map(int, raw_input().split()))
for _ in range(m):
	b.append(int(raw_input()))
for i in range(n):
	c[i] = 0
	for j in range(m):
		c[i] += a[i][j]*b[j]
	print c[i]

Fixed submission:
n, m = map(int, raw_input().split())
a, b = [], []
c = [0 for _ in range (n)]
for _ in range(n):
	a.append(map(int, raw_input().split()))
for _ in range(m):
	b.append(int(raw_input()))
for i in range(n):
	for j in range(m):
		c[i] += a[i][j]*b[j]
	print c[i]
Buggy python submission (verdict: Runtime Error):
w = input()
h = input()
print(w*h)


Fixed submission:
w,h = map(int, raw_input().split())

print(str(w*h) + ' ' + str((w+h)*2))

Buggy python submission (verdict: Runtime Error):
w = input('')
h = input('')
print(w*h)


Fixed submission:
w,h = map(int, raw_input().split())

print(str(w*h) + ' ' + str((w+h)*2))

Buggy python submission (verdict: Runtime Error):
w, h = input('')
print(w*h)


Fixed submission:
w,h = map(int, raw_input().split())

print(str(w*h) + ' ' + str((w+h)*2))

Buggy python submission (verdict: Runtime Error):
A, B = map(int, raw_input().split())

print(str(w*h) + ' ' + str((w+h)*2)


Fixed submission:
w,h = map(int, raw_input().split())

print(str(w*h) + ' ' + str((w+h)*2))

Buggy python submission (verdict: Runtime Error):
A, B = map(int, raw_input().split())

print(str(w*h) + ' ' + str((w+h)*2))


Fixed submission:
w,h = map(int, raw_input().split())

print(str(w*h) + ' ' + str((w+h)*2))
Buggy python submission (verdict: Runtime Error):
n = input()
a = input().split(' ')
nums = [int(str) for str in a]
sum = 0
nums.sort()
max = num[n-1]
min = num[0]
for i in nums:
 sum += i
print("{0} {1} {2}".format(min,max,sum))

Fixed submission:
n = int(input())
a = input().split(' ')
num = [int(str) for str in a]
sum = 0
num.sort()
max = num[n-1]
min = num[0]
for i in num:
 sum += i
print("{0} {1} {2}".format(min,max,sum))
Buggy python submission (verdict: Runtime Error):
n=int(raw_input())
ans=''
for i in range(3,n+1):
    if i%3==0 or '3' in str(i):
        ans+=(' '+str(i))
print ans


Fixed submission:
n=int(raw_input())
ans=''
for i in range(3,n+1):
    if i%3==0 or '3' in str(i):
        ans+=(' '+str(i))
print ans
Buggy python submission (verdict: Runtime Error):
m, n = map(int, input().split())
print(pow(m, n, int(1e9) + 7))javascript:void(0)


Fixed submission:
m, n = map(int, input().split())
print(pow(m, n, int(1e9) + 7))

Buggy python submission (verdict: Runtime Error):
m, n = map(int, input().split())
print(pow(m, n, int(1e9) + 7))javascript:void(0)


Fixed submission:
m, n = map(int, input().split())
print(pow(m, n, int(1e9) + 7))
Buggy python submission (verdict: Runtime Error):
print(x ** 3)


Fixed submission:
print(int(input()) ** 3)

Buggy python submission (verdict: Runtime Error):
print(input() ** 3)


Fixed submission:
print(int(input()) ** 3)
Buggy python submission (verdict: Runtime Error):
a, b = int(input().split)
print(a*b, (a+b)*2)


Fixed submission:
a, b = map(int, input().split())
print(a * b, (a + b) * 2)

Buggy python submission (verdict: Runtime Error):
a, b = int(input().split())
print(a*b, (a+b)*2)


Fixed submission:
a, b = map(int, input().split())
print(a * b, (a + b) * 2)

Buggy python submission (verdict: Runtime Error):
a = int(input().split())
print(a[1]*a[0], (a[1]+a[0])*2)


Fixed submission:
a, b = map(int, input().split())
print(a * b, (a + b) * 2)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if a > b:
    print("a > b"
elif a < b:
    print("a < b")
else:
    print("a == b")



Fixed submission:
a, b = map(int, input().split())
if a > b:
    print("a > b")
elif a < b:
    print("a < b")
else:
    print("a == b")
Buggy python submission (verdict: Runtime Error):
array = []
x = input()
while x != 0:
    array.append(x)
    x = input()
for i, x in enumerate(array):
    print("Case %d: %d" % (i + 1, x))


Fixed submission:
array = []
x = input()
while x != "0":
    array.append(x)
    x = input()
for i, x in enumerate(array):
    print("Case %d: %s" % (i + 1, x))
Buggy python submission (verdict: Runtime Error):
while True:
    x, y = map(int, inpu().split())
    if x == 0 and y == 0:
        break

    if x > y:
        z = x
        x = y
        y = z

    print(x, y)



Fixed submission:
while True:
    x, y = map(int, input().split())
    if x == 0 and y == 0:
        break

    if x > y:
        x, y = y, x

    print(x, y)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
print(a // b, a % b, {:.10f}.format(a / b))


Fixed submission:
a, b = map(int, input().split())
print(a // b, a % b, "{:.10f}".format(a / b))
Buggy python submission (verdict: Runtime Error):
import math
r = int(inpu())
print(r ** 2 * math.pi, r * 2 * math.pi)


Fixed submission:
import math

r = float(input())
print(float(r ** 2 * math.pi), float(r * 2 * math.pi))

Buggy python submission (verdict: Runtime Error):
import math
r = int(input())
print(r ** 2 * math.pi, r * 2 * math.pi)


Fixed submission:
import math

r = float(input())
print(float(r ** 2 * math.pi), float(r * 2 * math.pi))

Buggy python submission (verdict: Runtime Error):
import math

r = int(input())
print(r ** 2 * math.pi, r * 2 * math.pi)


Fixed submission:
import math

r = float(input())
print(float(r ** 2 * math.pi), float(r * 2 * math.pi))

Buggy python submission (verdict: Runtime Error):
import math

r = input()
print(r ** 2 * math.pi, r * 2 * math.pi)


Fixed submission:
import math

r = float(input())
print(float(r ** 2 * math.pi), float(r * 2 * math.pi))
Buggy python submission (verdict: Runtime Error):
array = map(int,input().split())
del array[0]
print(min(array), max(array), sum(array))


Fixed submission:
input()
array = list(map(int, input().split()))
print(min(array), max(array), sum(array))

Buggy python submission (verdict: Runtime Error):
a, b = input().split("\n")
array = map(int,b.split())
del array[0]
print(min(array), max(array), sum(array))


Fixed submission:
input()
array = list(map(int, input().split()))
print(min(array), max(array), sum(array))

Buggy python submission (verdict: Runtime Error):
a, b = input().split("\n")
array = list(map(int,b.split()))
del array[0]
print(min(array), max(array), sum(array))


Fixed submission:
input()
array = list(map(int, input().split()))
print(min(array), max(array), sum(array))

Buggy python submission (verdict: Runtime Error):
a, b = input().split("\n")
array = list(map(int,b.split()))
print(min(array), max(array), sum(array))


Fixed submission:
input()
array = list(map(int, input().split()))
print(min(array), max(array), sum(array))

Buggy python submission (verdict: Runtime Error):
a, b = input().split()
array = list(map(int,b.split()))
print(min(array), max(array), sum(array))


Fixed submission:
input()
array = list(map(int, input().split()))
print(min(array), max(array), sum(array))

Buggy python submission (verdict: Runtime Error):
a = input().split("\n")
array =  list(map(int, a[1].split()))
print(min(array), max(array), sum(array))


Fixed submission:
input()
array = list(map(int, input().split()))
print(min(array), max(array), sum(array))

Buggy python submission (verdict: Runtime Error):
input()
array = list(map(int, a[1].split()))
print(min(array), max(array), sum(array))


Fixed submission:
input()
array = list(map(int, input().split()))
print(min(array), max(array), sum(array))
Buggy python submission (verdict: Runtime Error):
h, w = map(int, input().split())
print(h, w)
while h != 0:
    for _ in range(h):
        for _ in range(w):
            sys.stdout.write("#")
        print()
h, w = map(int, input().split())


Fixed submission:
import sys
h, w = map(int, input().split())
while h != 0:
    for _ in range(h):
        for _ in range(w):
            sys.stdout.write("#")
        print()
    print()
    h, w = map(int, input().split())

Buggy python submission (verdict: Time Limit Exceeded):
import sys
h, w = map(int, input().split())
print(h, w)
while h != 0:
    for _ in range(h):
        for _ in range(w):
            sys.stdout.write("#")
        print()
h, w = map(int, input().split())


Fixed submission:
import sys
h, w = map(int, input().split())
while h != 0:
    for _ in range(h):
        for _ in range(w):
            sys.stdout.write("#")
        print()
    print()
    h, w = map(int, input().split())
Buggy python submission (verdict: Runtime Error):
resident = [[[0] * 10] * 3] * 4
for _ in range(int(input())):
    b, f, r, v = map(int, input().split())
    resident[b][f][r] += v
for b in range(4):
    for f in range(3):
        print(" ".join(str(resident[b][f])))
    print("####################")



Fixed submission:
resident = [[[0] * 10 for _ in range(3)] for _ in range(4)]
for _ in range(int(input())):
    b, f, r, v = map(int, input().split())
    resident[b - 1][f - 1][r - 1] += v
for b in range(4):
    for f in range(3):
        print(" " + " ".join(map(str, resident[b][f])))
    if b < 3:
        print("####################")
Buggy python submission (verdict: Runtime Error):
for _ in [None] * 50:
    m, f, r = map(int, input().split())
    result = " "
    if m == f == r == -1:
        break
    if m == -1 or f == -1 or m + f < 30:
        result = "F"
    elif m + f > 80:
        result = "A"
    elif 80 > m + f >= 65:
        result = "B"
    elif 65 > m + f >= 50:
        result = "C"
    else:
        result = "C" if r >= 50 else result = "D"
    print(result)



Fixed submission:
for _ in [None] * 50:
    m, f, r = map(int, input().split())
    result = ""
    if m == f == r == -1:
        break
    if m == -1 or f == -1 or m + f < 30:
        result = "F"
    elif m + f >= 80:
        result = "A"
    elif 80 > m + f >= 65:
        result = "B"
    elif 65 > m + f >= 50:
        result = "C"
    else:
        result = "C" if r >= 50 else "D"
    print(result)
Buggy python submission (verdict: Time Limit Exceeded):
a, b = map(int, input().split())
low = min([round(a/2), round(b/2)])
if a == b:
    print(a)
else:
    for i in range(low, 0, -1):
        if a%i==0 and b%i==0:
            print(i)
            break


Fixed submission:
a, b = map(int, input().split())

def gcd(a, b):
    big = max(a, b)
    small = min(a, b)
    while not big % small == 0:
        big, small = small, big%small
    return small
    
print(gcd(a, b))

Buggy python submission (verdict: Time Limit Exceeded):
a, b = map(int, input().split())
low = min([round(a/2), round(b/2)])
if a == b:
    print(a)
else:
    for i in range(low, 0, -1):
        if a%i==0 and b%i==0:
            print(i)
            break


Fixed submission:
a, b = map(int, input().split())

def gcd(a, b):
    big = max(a, b)
    small = min(a, b)
    while not big % small == 0:
        big, small = small, big%small
    return small
    
print(gcd(a, b))

Buggy python submission (verdict: Time Limit Exceeded):
a, b = map(int, input().split())

def gcd(a, b):
    if a == b:
        return a
    big = max(a, b)
    small = min(a, b)
    big_i = big % small
    herf = round(min(small, big_i))
    for i in range(herf, 1, -1):
        if small%i==0 and big_i%i==0:
            return i
    return 1
    
print(gcd(a, b))



Fixed submission:
a, b = map(int, input().split())

def gcd(a, b):
    big = max(a, b)
    small = min(a, b)
    while not big % small == 0:
        big, small = small, big%small
    return small
    
print(gcd(a, b))
Buggy python submission (verdict: Runtime Error):
_ = int(input())
l2 = list(map(int, input().split()))


class Card():
    def __init__(self, card):
        self.card = card
        self.mark = card[0]
        self.number = card[1]
        
    def __lt__(self, other):
        if not isinstance(other, Card):
            return NotImplemented
        return self.number < other.number
    
    def __eq__(self, other):
        if not isinstance(other, Card):
            return NotImplemented
        return self.mark == other.mark and self.number == other.number
        
    def __repr__(self):
        return '{}{}'.format(self.mark, self.number)

    def ls_sort(self):
        return


def BubbleSort(target):
    ls = target.copy()
    flag = 1
    while flag:
        flag = 0
        for i in range(len(ls)-1, 0, -1):
            if ls[i] < ls[i-1]:
                ls[i], ls[i-1] = ls[i-1], ls[i]
                flag = 1
    print(' '.join(map(str, ls)))
    return sorted(ls)


def SelectSort(target):
    ls = target.copy()
    for i in range(len(ls)):
        minj = i
        for j in range(i+1, len(ls)):
            if ls[j] < ls[minj]:
                minj = j
        if ls[i] != ls[minj]:
            ls[i], ls[minj] = ls[minj], ls[i]
    
    print(' '.join(map(str, ls)))
    return sorted(ls)

l2 =  [Card(i) for i in l2]
l2_sort = sorted(l2)
print(l2_sort)


bubble = BubbleSort(l2)
if bubble == l2_sort:
    print('a')
else:
    print('b')

select = SelectSort(l2)
if select == l2_sort:
    print('a')
else:
    print('b')


Fixed submission:
class Card():
    def __init__(self, card):
        self.card = card
        self.mark = card[0]
        self.number = card[1]
        
    def __lt__(self, other):
        if not isinstance(other, Card):
            return NotImplemented
        return self.number < other.number
        
    def __repr__(self):
        return '{}{}'.format(self.mark, self.number)


def BubbleSort(target):
    ls = target.copy()
    flag = 1
    while flag:
        flag = 0
        for i in range(len(ls)-1, 0, -1):
            if ls[i] < ls[i-1]:
                ls[i], ls[i-1] = ls[i-1], ls[i]
                flag = 1
    print(' '.join(map(str, ls)))
    return sorted(ls)


def SelectSort(target):
    ls = target.copy()
    for i in range(len(ls)):
        minj = i
        for j in range(i+1, len(ls)):
            if ls[j] < ls[minj]:
                minj = j
        if ls[i] != ls[minj]:
            ls[i], ls[minj] = ls[minj], ls[i]
    
    print(' '.join(map(str, ls)))
    return sorted(ls)

def judge(original, sorted_list):
    if original == sorted_list:
        print('Stable')
    else:
        print('Not stable')


_ = int(input())
l2 =  [Card(i) for i in input().split()]
l2_sort = sorted(l2)

bubble = BubbleSort(l2)
judge(l2_sort, bubble)

select = SelectSort(l2)
judge(l2_sort, select)
Buggy python submission (verdict: Runtime Error):
import math

x1, y1, x2, y2 = map(int, input().split())
print(math.sqrt(abs(x2-x1)**2 + abs(y2-y1)**2))


Fixed submission:
import math

x1, y1, x2, y2 = map(float, input().split())
print(math.sqrt(abs(x2-x1)**2 + abs(y2-y1)**2))