Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
s = input().split()
stk = []
for i in s:
	if i >= '0' and i <= '9':
		stk.append(int(i))
	else:
		a = stk.pop()
		b = stk.pop()
		if i == '+':
			stk.append(b + a)
		elif i == '-':
			stk.append(b - a)
		else:
			stk.append(b * a)
print(stk.pop())



Fixed submission:
s = input().split()
stk = []
for i in s:
	if i.isdigit():
		stk.append(int(i))
	else:
		a = stk.pop()
		b = stk.pop()
		if i == '+':
			stk.append(b + a)
		elif i == '-':
			stk.append(b - a)
		else:
			stk.append(b * a)
print(stk.pop())
Buggy python submission (verdict: Runtime Error):
import math
r=int(input())
print("{:.5f} {:.5f}".format(r*r*math.pi,r*2*pi))



Fixed submission:
from math import pi
r=float(input())
print("{:.5f} {:.5f}".format(r*r*pi,r*2*pi))

Buggy python submission (verdict: Runtime Error):
import math
r=int(input())
print("{:.5f} {:.5f}".format(r*r*math.pi,r*2*math.pi))



Fixed submission:
from math import pi
r=float(input())
print("{:.5f} {:.5f}".format(r*r*pi,r*2*pi))

Buggy python submission (verdict: Runtime Error):
import math
r=int(input())
print("{:.5f} {:.5f}".format(r*r*math.pi,r*2*math.pi))



Fixed submission:
from math import pi
r=float(input())
print("{:.5f} {:.5f}".format(r*r*pi,r*2*pi))

Buggy python submission (verdict: Runtime Error):
from math import pi
r=int(input())
print("{:.5f} {:.5f}".format(r*r*pi,r*2*pi))



Fixed submission:
from math import pi
r=float(input())
print("{:.5f} {:.5f}".format(r*r*pi,r*2*pi))
Buggy python submission (verdict: Runtime Error):
while True:
	l=input()
	if l[1]=='?':
		break
	print(eval(l))



Fixed submission:
while True:
	l=input()
	if '?' in l:
		break
	print(int(eval(l)))
Buggy python submission (verdict: Runtime Error):
N = input()
array = list(map(int, input().split()))


for i in range(1, N):
    v = array[i]
    j = i - 1
    while j >= 0 and array[j] > v:
        array[j + 1] = array[j]
        j -= 1
        array[j + 1] = v
    array = list(map(str, array))
    x = " ".join(array)
    print(x)



Fixed submission:
N = int(input())
array = list(map(int, input().split()))

y = list(map(str, array))
y = " ".join(y)
print(y)

for i in range(1, N):
    v = array[i]
    j = i - 1
    while j >= 0 and array[j] > v:
        array[j + 1] = array[j]
        j -= 1
        array[j + 1] = v
    x = list(map(str, array))
    x = " ".join(x)
    print(x)
Buggy python submission (verdict: Runtime Error):
n = input().split()

x = n[0]
y = n[1]

if x < y:
    x, y = y, x
while y > 0:
    r = x % y
    x = y
    y = r

print(x)



Fixed submission:
n = list(map(int, input().split()))

x = n[0]
y = n[1]

if x < y:
    x, y = y, x
while y > 0:
    r = x % y
    x = y
    y = r

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


def is_prime(x):
    if x == 2:
        return True

    if x < 2 or x % 2 == 0:
        return False

    i = 3
    while i <= math.sqrt(x):
        if x % i == 0:
            return False
        i = i + 2

    return True


n = int(input())
numbers = [int(input()) for i in n]


count = 0
for i in range(n):
    if is_prime(numbers[i]) is True:
        count += 1

print(count)



Fixed submission:
import math


def is_prime(x):
    if x == 2:
        return True

    if x < 2 or x % 2 == 0:
        return False

    i = 3
    while i <= math.sqrt(x):
        if x % i == 0:
            return False
        i = i + 2

    return True


n = int(input())
numbers = [int(input()) for i in range(n)]


count = 0
for i in range(n):
    if is_prime(numbers[i]) is True:
        count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())
*array, = [int(input()) for i in range(n)]


def bubble_sort(a):
    c = 0
    flag = 1
    i = 0
    while flag:
        flag = 0
        for j in range(n-1, i, -1):
            if a[j] < a[j-1]:

                a[j], a[j-1] = a[j-1], a[j]
                c += 1
                flag = 1

        i += 1

    print(*a)
    print(c)


bubble_sort(array)







Fixed submission:
n = int(input())
*array, = list(map(int, input().split())) 


def bubble_sort(a):
    c = 0
    flag = 1
    i = 0
    while flag:
        flag = 0

        # range(a, b, c) jがbになったときに処理中断する
        for j in range(n-1, i, -1):
            if a[j] < a[j-1]:

                a[j], a[j-1] = a[j-1], a[j]
                c += 1
                flag = 1

        i += 1

    print(*a)
    print(c)


bubble_sort(array)
Buggy python submission (verdict: Runtime Error):
import re
import copy
pattern = r'([0-9])'
repatter = re.compile(pattern)

n = str(input())
text = input()

*lists, = text.split(" ")
lists2 = copy.copy(lists)
lists3 = copy.copy(lists)


# バブルソート
def bubble_sort(a):
    flag = 1
    i = 0
    while flag:
        flag = 0
        for j in range(n-1, i, -1):
            x = repatter.findall(a[j])
            y = repatter.findall(a[j-1])
            if x < y:
                a[j], a[j-1] = a[j-1], a[j]
                flag = 1
        i += 1
    print(*a)
    print("Stable")


# 選択ソート
def select_sort(a):
    for i in range(n):
        min_j = i
        for j in range(i+1, n):
            x = repatter.findall(a[j])
            y = repatter.findall(a[min_j])
            if x < y:
                min_j = j
        a[i], a[min_j] = a[min_j], a[i]
    print(*a)


def isStable(before, after):
    for i in range(n):
        for j in range(i+1, n):
            for a in range(n):
                for b in range(a+1, n):
                    x = repatter.findall(before[i])
                    y = repatter.findall(before[j])
                    if x == y and before[i] == after[b] and before[j] == after[a]:
                        print("Not stable")


bubble_sort(lists)
select_sort(lists2)
isStable(lists3, lists2)


Fixed submission:
import re
import copy
pattern = r'([0-9])'
repatter = re.compile(pattern)

n = int(input())
text = input()

*lists, = text.split(" ")
lists2 = copy.copy(lists)
lists3 = copy.copy(lists)


# バブルソート
def bubble_sort(a):
    flag = 1
    i = 0
    while flag:
        flag = 0
        for j in range(n-1, i, -1):
            x = repatter.findall(a[j])
            y = repatter.findall(a[j-1])
            if x < y:
                a[j], a[j-1] = a[j-1], a[j]
                flag = 1
        i += 1
    print(*a)
    print("Stable")


# 選択ソート
def select_sort(a):
    for i in range(n):
        min_j = i
        for j in range(i+1, n):
            x = repatter.findall(a[j])
            y = repatter.findall(a[min_j])
            if x < y:
                min_j = j
        a[i], a[min_j] = a[min_j], a[i]
    print(*a)


def isStable(before, after):
    flag = True
    for i in range(n):
        for j in range(i+1, n):
            for a in range(n):
                for b in range(a+1, n):
                    x = repatter.findall(before[i])
                    y = repatter.findall(before[j])
                    if x == y and before[i] == after[b] and before[j] == after[a]:
                        flag = False
    if flag is True:
        print("Stable")
    else:
        print("Not stable")


bubble_sort(lists)
select_sort(lists2)
isStable(lists3, lists2)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
order = [input() for _ in range(n)]
dic = []

for i in range(n):
    # insert
    if order[i][0] == "i":
        dic += [order[i][7:]]
    # find
    else:
        dic += [order[i][5:]]
        j = 0
        while dic[j] != order[i][5:]:
            j += 1
        dic.pop()
        if j == len(dic):
            print("no")
            continue
        else:
            print("yes")



Fixed submission:
n = int(input())
d = set()
for i in range(n):
    cmd, val = input().split()
    if cmd == 'insert':
        d.add(val)
    else:
        print('yes'*(val in d) or 'no')

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
order = [input() for _ in range(n)]
dic = []

for i in range(n):
    if order[i][0] == "i":
        dic += [order[i][7:]]
    else:
        dic += [order[i][5:]]
        j = 0
        while dic[j] != order[i][5:]:
            j += 1
        dic.pop()
        if j == len(dic):
            print("no")
        else:
            print("yes")



Fixed submission:
n = int(input())
d = set()
for i in range(n):
    cmd, val = input().split()
    if cmd == 'insert':
        d.add(val)
    else:
        print('yes'*(val in d) or 'no')
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
*A, = list(map(int, input().split()))
count = 0


def merge(a, left, mid, right):
    global count
    n1 = mid - left
    n2 = right - mid
    la, ra = [], []
    for i in range(0, n1):
        la += [a[left + i]]
    for i in range(0, n2):
        ra += [a[mid + i]]
    la += [float("inf")]
    ra += [float("inf")]

    i, j = 0, 0
    for k in range(left, right):
        count += 1
        if la[i] <= ra[j]:
            a[k] = la[i]
            i = i + 1
        else:
            a[k] = ra[j]
            j = j + 1


def merge_sort(a, left, right):
    # それぞれの要素数が二個の配列へ分割できるまで処理を行う
    if left + 1 < right:
        mid = int((left + right) / 2)
        merge_sort(a, left, mid)
        merge_sort(a, mid, right)
        merge(a, left, mid, right)


merge_sort(A, 0, N)
print(*A)
print(count)



Fixed submission:
N = int(input())
*A, = list(map(int, input().split()))
count = 0


def merge(a, left, mid, right):
    global count
    la = a[left:mid] + [float("inf")]
    ra = a[mid:right] + [float("inf")]

    i, j = 0, 0
    for k in range(left, right):
        count += 1
        if la[i] <= ra[j]:
            a[k] = la[i]
            i += 1
        else:
            a[k] = ra[j]
            j += 1


def merge_sort(a, left, right):
    if left + 1 < right:
        mid = int((left + right) / 2)
        merge_sort(a, left, mid)
        merge_sort(a, mid, right)
        merge(a, left, mid, right)

merge_sort(A, 0, N)
print(*A)
print(count)
Buggy python submission (verdict: Runtime Error):
n = input().split()
print(str(n[0] * n[1]) + " " + str((n[0] * 2) + (n[1] * 2)))



Fixed submission:
n = input()
n = n.split()
n = list(map(int, n))

#n = [int(i) for i in n]
print(str(n[0] * n[1]) + " " + str((n[0] + n[1]) * 2))
Buggy python submission (verdict: Runtime Error):
n = input().split()

n = n.split()
n = [int(i) for i in n]
if(n[0] < n[1] and n[1] < n[2]):
    print("Yes")
else:
    print("No")


Fixed submission:
n = input().split()
n = [int(i) for i in n]
if(n[0] < n[1] and n[1] < n[2]):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
while True:
    n = 1
    if input() == 0:
        break
    print("Case " + n + ": " + str(input()))
    n+=1


Fixed submission:
i = 1

while True:
    x = int(input())
    if x == 0:
        break
    print("Case " + str(i) + ": " + str(x))
    i += 1

Buggy python submission (verdict: Runtime Error):
n = 1
while True:
    if int(input()) == 0:
        break
    print("Case " + n + ": " + str(input()))
    n+=1


Fixed submission:
i = 1

while True:
    x = int(input())
    if x == 0:
        break
    print("Case " + str(i) + ": " + str(x))
    i += 1
Buggy python submission (verdict: Runtime Error):
import math
while True:
    a,b = [int(x) for x in input().split()]
    x = a + b
    print(int(math.log10(x))+1)



Fixed submission:
import math
while True:
    try:
        a,b = [int(x) for x in input().split()]
        x = a + b        
        print(int(math.log10(x))+1)
    except:
        break
Buggy python submission (verdict: Runtime Error):
x1,y1,x2,y2 = [int(x) for x in input().split()]
print(((x1-x2)**2+(y1-y2)**2)**(1/2))



Fixed submission:
x1,y1,x2,y2 = [float(x) for x in input().split()]
print(((x1-x2)**2+(y1-y2)**2)**(1/2))

Buggy python submission (verdict: Runtime Error):
x1,y1,x2,y2 = [int(x) for x in input().split()]
print(((x1-x2)**2+(y1-y2)**2)**(1/2))



Fixed submission:
x1,y1,x2,y2 = [float(x) for x in input().split()]
print(((x1-x2)**2+(y1-y2)**2)**(1/2))
Buggy python submission (verdict: Runtime Error):
=x**3


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

Buggy python submission (verdict: Runtime Error):
a = input()
return a**3


Fixed submission:
x = int(input())
print(x**3)
Buggy python submission (verdict: Runtime Error):
S = int(input())
h = S//3600
m = (S%3600)//60
s = S%60
print(h:m:s)



Fixed submission:
S = int(input())
h = S//3600
m = (S%3600)//60
s = S%60
print('%d:%d:%d' %(h,m,s))
Buggy python submission (verdict: Runtime Error):
a,b = [int(x) for x 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):
a,b = map(int,input().split( ))
if a>b:
    print('a > b')
elif a<b:
    print('a < b')
else: a == b:
    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):
a,b,c = [int(x) for x input().split( )]
if a<b<c:
    print('Yes')
else:
    print('No')



Fixed submission:
a,b,c = [int(x) for x in input().split( )]
if a<b<c:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
a = [int(x) for x in input().split( )]
a.sort()
print(a[0] a[1] a[2])



Fixed submission:
a = [int(x) for x in input().split( )]
print(' '.join(map(str,sorted(a))))

Buggy python submission (verdict: Runtime Error):
a = [int(x) for x in input().split( )]
a.sort()
print(' ',join(map(str,a)))




Fixed submission:
a = [int(x) for x in input().split( )]
print(' '.join(map(str,sorted(a))))
Buggy python submission (verdict: Runtime Error):
x = input()
counter = 0
while True:
        if x == '0':
                break
        else:
                counter = counter+1
                return('Case %d:%s' %(counter,x))


Fixed submission:
i = 0
while i <10000:
    x = input()
    if x == '0':
        break
    else:
        i += 1
        print('Case %d: %s' %(i,x))
Buggy python submission (verdict: Runtime Error):
while list[0] != 0 or list[1] != 0:
    list = [x for x in input().split( )]
    print(' '.join(map(str,sorted(list))))




Fixed submission:
while True:
    l = [int(x) for x in input().split( )]
    if l == [0,0]:
        break
    else:
        l.sort()
        print(*l)

Buggy python submission (verdict: Runtime Error):
list = []
while list[0] != 0 or list[1] != 0:
    list = [int(x) for x in input().split( )]
    print(' '.join(map(str,sorted(list))))




Fixed submission:
while True:
    l = [int(x) for x in input().split( )]
    if l == [0,0]:
        break
    else:
        l.sort()
        print(*l)
Buggy python submission (verdict: Runtime Error):
a,b,c = [int(x) for x in input().split( )]
div = []
for x in range(1,c+1):
    if c % x == 0:
        div.append(x)
r = []
for x in range(a,b+1):
    r.append(x)
answer = 0
for x in div:
    for y in r:
        if x == y:
            answer += 1
print(answer)



Fixed submission:
a,b,c = [int(x) for x in input().split( )]
count = 0
for number in range(a,b+1):
    if c % number == 0:
        count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
a,b = [int(x) for x in input().split( )]
print(%d,%d,%f,%(a//b,a%b,a/b))


Fixed submission:
a,b = [int(x) for x in input().split( )]
print(a//b,a%b,"{0:.20f}".format(a/b))
Buggy python submission (verdict: Runtime Error):
from math import pi
r = int(input())
print(pi*r**2,2*pi*r)




Fixed submission:
from math import pi
r = float(input())
print(pi*r**2,2*pi*r)
Buggy python submission (verdict: Runtime Error):
i = 1
while True:
    H,W = [int(x) for x in input().split( )]
    for i in range(H):
        print('#'*W)



Fixed submission:
while True:
    H,W = [int(x) for x in input().split( )]
    if H == 0 and W == 0: 
        break
    for i in range(H):
        print('#'*W)
    print()

Buggy python submission (verdict: Runtime Error):
whle True:
    h,w = [int(x) for x in input().split( )]
    if (h,w) == (0,0): break
    for i in range(h):
        print('#'*w)





Fixed submission:
while True:
    H,W = [int(x) for x in input().split( )]
    if H == 0 and W == 0: 
        break
    for i in range(H):
        print('#'*W)
    print()
Buggy python submission (verdict: Runtime Error):
word = ''
while True:
    w = input().lower()
    if w == '':
        break
    else:
        word += w
for a in alphabet:
    print(a+':'+str(word.count(a)))
   


Fixed submission:
import sys
 
alp = "abcdefghijklmnopqrstuvwxyz"
s = []
for line in sys.stdin:
    s += line.lower()
for i in alp:
    print(i + " : " +str(s.count(i)))
Buggy python submission (verdict: Runtime Error):
w = input()
cnt = 0
while True:
    t = input().lower()
    if t == 'END_OF_TEXT':
        break
    if w in t.split():
        cnt += 1
print(cnt)



Fixed submission:
w = input()
cnt = 0
while True:
    t = input()
    if t == 'END_OF_TEXT':
        break
    cnt += t.lower().split().count(w)
print(cnt)
Buggy python submission (verdict: Runtime Error):
string = input()
n = int(input())
for i in range(n):
    inp = [x for x in input().split()]
    a = int(inp[1])
    b = int(inp[2])
    if inp[0] == 'print':
        print(string[a:b+1])
    elif inp[0] == 'reverse':
        string = string[:a] + string[a:b+1][::-1] +string[b+1:]
    elif inp[0] == 'replace':
        string = string[:a] + inp[3] + string[b+1]



Fixed submission:
string = input()
for _ in range(int(input())):
    com = [x for x in input().split()]
    c = com[0]
    a,b = [int(com[i]) for i in range(1,3)]
    if c == 'reverse':
        string = string[:a] + string[a:b+1][::-1] + string[b+1:]
    if c == 'print':
        print(string[a:b+1])
    if c == 'replace':
        string = string[:a] + com[3] + string[b+1:]

Buggy python submission (verdict: Runtime Error):
string = input()
n = int(input())
for i in range(n):
    inp = [x for x in input().split()]
    a = int(inp[1])
    b = int(inp[2])
    if inp[0] == 'print':
        print(string[a:b+1])
    elif inp[0] == 'reverse':
        string = string[:a] + string[a:b+1][::-1] +string[b+1:]
    elif inp[0] == 'replace':
        string = string[:a] + inp[3] + string[b+1]



Fixed submission:
string = input()
for _ in range(int(input())):
    com = [x for x in input().split()]
    c = com[0]
    a,b = [int(com[i]) for i in range(1,3)]
    if c == 'reverse':
        string = string[:a] + string[a:b+1][::-1] + string[b+1:]
    if c == 'print':
        print(string[a:b+1])
    if c == 'replace':
        string = string[:a] + com[3] + string[b+1:]

Buggy python submission (verdict: Runtime Error):
string = input()
n = int(input())
for i in range(n):
    inp = [x for x in input().split()]
    a = int(inp[1])
    b = int(inp[2])
    if inp[0] == 'print':
        print(string[a:b+1])
    elif inp[0] == 'reverse':
        string = string[:a] + string[a:b+1][::-1] +string[b+1:]
    else:
        string = string[:a] + inp[3] + string[b+1]



Fixed submission:
string = input()
for _ in range(int(input())):
    com = [x for x in input().split()]
    c = com[0]
    a,b = [int(com[i]) for i in range(1,3)]
    if c == 'reverse':
        string = string[:a] + string[a:b+1][::-1] + string[b+1:]
    if c == 'print':
        print(string[a:b+1])
    if c == 'replace':
        string = string[:a] + com[3] + string[b+1:]

Buggy python submission (verdict: Runtime Error):
string = input()
n = int(input())
for i in range(n):
    inp = [x for x in input().split()]
    a = int(inp[1])
    b = int(inp[2])
    if inp[0] == 'print':
        print(string[a:b+1])
    elif inp[0] == 'reverse':
        string = string[:a] + string[a:b+1][::-1] +string[b+1:]
    else:
        string = string[:a] + inp[3] + string[b+1]




Fixed submission:
string = input()
for _ in range(int(input())):
    com = [x for x in input().split()]
    c = com[0]
    a,b = [int(com[i]) for i in range(1,3)]
    if c == 'reverse':
        string = string[:a] + string[a:b+1][::-1] + string[b+1:]
    if c == 'print':
        print(string[a:b+1])
    if c == 'replace':
        string = string[:a] + com[3] + string[b+1:]
Buggy python submission (verdict: Runtime Error):
for x in range(200):
    print(len(str(sum(list(map(int, input().split()))))))



Fixed submission:
while True:
    try:
        print(len(str(sum(list(map(int, input().split()))))))
    except EOFError:
        break
Buggy python submission (verdict: Runtime Error):
import math

while True:
    try:
        r = int(input())

        A = [i for i in range(2, r+1)]
        P = []
        time = 0

        while True:
            prime = min(A)

            if prime > math.sqrt(r):
                break

            P.append(prime)

            i = 0
            while i < len(A):
                if A[i] % prime == 0:
                    A.pop(i)
                    continue
                i += 1
        for a in A:
            P.append(a)

        print(len(P))

    except EOFError:
        break



Fixed submission:
LIMIT = 10000000
  
isPrime = [True for _ in range(LIMIT)]
 
isPrime[0] = isPrime[1] = False
  
for i in range(2, int(LIMIT ** 0.5)+1):
  if isPrime[i]:
    for j in range(i * i, LIMIT, i):
      isPrime[j] = False
  
try:
    while True:
        n = int(input())
 
        count = 0
        if n >= 2:
            count = 1
 
        for i in range(3, n+1, 2):
            if isPrime[i]:
                count += 1
 
        print(count)
except EOFError:
  pass

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


try:
    while True:
        r = int(input())

        A = [i for i in range(2, r+1)]
        P = []
        time = 0

        while True:
            prime = min(A)

            if prime > math.sqrt(r):
                break

            P.append(prime)

            i = 0
            while i < len(A):
                if A[i] % prime == 0:
                    A.pop(i)
                    continue
                i += 1
        for a in A:
            P.append(a)

        print(len(P))

except EOFError:
    pass



Fixed submission:
LIMIT = 10000000
  
isPrime = [True for _ in range(LIMIT)]
 
isPrime[0] = isPrime[1] = False
  
for i in range(2, int(LIMIT ** 0.5)+1):
  if isPrime[i]:
    for j in range(i * i, LIMIT, i):
      isPrime[j] = False
  
try:
    while True:
        n = int(input())
 
        count = 0
        if n >= 2:
            count = 1
 
        for i in range(3, n+1, 2):
            if isPrime[i]:
                count += 1
 
        print(count)
except EOFError:
  pass
Buggy python submission (verdict: Runtime Error):
import numpy
numlist = list(map(int, input().split()))
a = numpy.array([numlist[0], numlist[1]])
b = numpy.array([numlist[2], numlist[3]])
u = b - a
print(numpy.linalg.norm(u))



Fixed submission:
import math
x1,y1,x2,y2=map(float,input().split())
dx=abs(x1-x2)
dy=abs(y1-y2)
print(math.sqrt(dx*dx+dy*dy))

Buggy python submission (verdict: Runtime Error):
import numpy
numlist = list(map(float, input().split()))
a = numpy.array([numlist[0], numlist[1]])
b = numpy.array([numlist[2], numlist[3]])
u = b - a
print(numpy.linalg.norm(u))



Fixed submission:
import math
x1,y1,x2,y2=map(float,input().split())
dx=abs(x1-x2)
dy=abs(y1-y2)
print(math.sqrt(dx*dx+dy*dy))
Buggy python submission (verdict: Runtime Error):
import math
import numpy as np

s = int(input())

all_list = []

for _ in range(2):
    all_list.append(list(map(float, input().split())))

p1 = sum([math.fabs(x - y) for x, y in zip(all_list[0], all_list[1])])
p2 = math.sqrt(sum([(math.fabs(x - y))**2 for x, y in zip(all_list[0], all_list[1])]))
p3 = np.cbrt(sum([(math.fabs(x - y))**3 for x, y in zip(all_list[0], all_list[1])]))
pi = max([math.fabs(x - y) for x, y in zip(all_list[0], all_list[1])])

print("{:.6f}".format(p1))
print("{:.6f}".format(p2))
print("{:.6f}".format(p3))
print("{:.6f}".format(pi))



Fixed submission:
n = int(input())
x, y = [list(map(int, input().split())) for _ in range(2)]
print(sum([abs(x[i] - y[i]) for i in range(n)]))
print(pow(sum([(x[i] - y[i]) ** 2 for i in range(n)]), 1/2))
print(pow(sum([abs(x[i] - y[i]) ** 3 for i in range(n)]), 1/3))
print(max([abs(x[i] - y[i]) for i in range(n)]))