Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import output
N = int(input())
A = [int(n) for n in input().split()]
for i in range(1, N):
    v = A[i]
    j = i - 1
    while j >= 0 and A[j] > v:
        A[j+1] = A[j]
        j -= 1
    A[j+1] = v
    output.print_1(A)

Fixed submission:
def print_1(array):
    for i in range(len(array)):
        if i == len(array) - 1:
            print(array[i])
        else:
            print(array[i], end=" ")

N = int(input())
A = [int(n) for n in input().split()]
print_1(A)
for i in range(1, N):
    v = A[i]
    j = i - 1
    while j >= 0 and A[j] > v:
        A[j+1] = A[j]
        j -= 1
    A[j+1] = v
    print_1(A)

Buggy python submission (verdict: Runtime Error):
import output
N = int(input())
A = [int(n) for n in input().split()]
output.print_1(A)
for i in range(1, N):
    v = A[i]
    j = i - 1
    while j >= 0 and A[j] > v:
        A[j+1] = A[j]
        j -= 1
    A[j+1] = v
    output.print_1(A)

Fixed submission:
def print_1(array):
    for i in range(len(array)):
        if i == len(array) - 1:
            print(array[i])
        else:
            print(array[i], end=" ")

N = int(input())
A = [int(n) for n in input().split()]
print_1(A)
for i in range(1, N):
    v = A[i]
    j = i - 1
    while j >= 0 and A[j] > v:
        A[j+1] = A[j]
        j -= 1
    A[j+1] = v
    print_1(A)
Buggy python submission (verdict: Runtime Error):
import math
x, y = map(int, input().split())
print(math.gcd(x, y))

Fixed submission:
def gcd(x, y):
    if y == 0:
        return x
    return gcd(y, x % y)

x, y = map(int, input().split())
print(gcd(x, y))
Buggy python submission (verdict: Runtime Error):
import math
cnt = 0
N = int(input())
for i in range(N):
    n = int(input())
    if n % 2:
        area = round(math.sqrt(n))
        prime_ng = 0
        for i in range(2, area + 1):
            if n % i == 0:
                prime_ng = 1
                break
            else:
        if prime_ng == 0:
            cnt += 1
    elif n == 2:
        cnt += 1
print(cnt)

Fixed submission:
import math
n = int(input())
cnt = 0
for i in range(n):
    x = int(input())
    if x == 2:
        cnt += 1
    elif x <= 1\
    or x % 2 == 0:
        continue
    else:
        j = 3
        prime = "yes"
        while j <= math.sqrt(x):
            if x % j == 0:
                prime = "no"
                break
            else:
                j += 2
        if prime == "yes":
            cnt += 1
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
R = []
for i in range(n):
    R.append(int(input()))

R_max = -10**9
for i in range(n-1):
    for j in range(i+1, n):
        if R[j] - R[i] > R_max:
            R_max = R[j] - R[i] 
print(R_max)

Fixed submission:
n = int(input())
R = [int(input()) for i in range(n)]
minx = R[0]
maxx = -10**9
for i in range(1, n):
    if R[i] - minx > maxx:
        maxx = R[i] - minx
    if R[i] < minx :
        minx = R[i]
print(maxx)
Buggy python submission (verdict: Runtime Error):
import output
N = int(input())
A = [int(n) for n in input().split()]
flg = 1
cnt = 0
while flg:
    flg = 0
    for i in range(N-1, 0, -1):
        if A[i] < A[i-1]:
            t = A[i]
            A[i] = A[i-1]
            A[i-1] = t
            flg = 1
            cnt += 1
output.print_1(A)
print(cnt)

Fixed submission:
N = int(input())
A = [int(n) for n in input().split()]
flg = 1
cnt = 0
while flg:
    flg = 0
    for i in range(N-1, 0, -1):
        if A[i] < A[i-1]:
            t = A[i]
            A[i] = A[i-1]
            A[i-1] = t
            flg = 1
            cnt += 1
for i in range(N):
    if i == N - 1:
        print(A[i])
    else:
        print(A[i], end=" ")
print(cnt)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
S = input().split()
q = int(input())
T = input().split()
cnt = 0
for i in range(q):
    if T[i] in S:
        cnt += 1
print(cnt)

Fixed submission:
n = int(input())
S = [int(i) for i in input().split()]
q = int(input())
T = [int(i) for i in input().split()]

cnt = 0
for t in T:
    low = 0
    high = len(S) - 1
    while low <= high:
        mid = (low + high) // 2
        if t == S[mid]:
            cnt += 1
            break
        elif t < S[mid]:
            high = mid - 1
        else:
            low = mid + 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
import math
x1, y1, x2, y2 = map(int, input().split())
print(math.sqrt((x2 - x1)**2 + (y2 - y1)**2))

Fixed submission:
import math
x1, y1, x2, y2 = map(float, input().split())
print(math.sqrt((x2 - x1)**2 + (y2 - y1)**2))
Buggy python submission (verdict: Runtime Error):
a, b = int(input())
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 = int(input())
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):
x = 10000
i = 1
while x:
    x = input()
    if x == 0:
        break
    print("Case {}: {}".format(i, x))
    i += 1

Fixed submission:
x = 10000
i = 1
while x:
    x = input()
    if x == "0":
        break
    print("Case {}: {}".format(i, x))
    i += 1
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
f = a / b
print(int(a / b), a % b, f"{a / b : .5f}")

Fixed submission:
a, b = map(int, input().split())
d = a // b
r = a % b
f = a / b
print("{0} {1} {2:.6f}".format(d, r, f))

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

Fixed submission:
a, b = map(int, input().split())
d = a // b
r = a % b
f = a / b
print("{0} {1} {2:.6f}".format(d, r, f))
Buggy python submission (verdict: Runtime Error):
r = int(input())
area = r**2 * 3.14
enshuu = r * 2 * 3.14
print(area, enshuu)

Fixed submission:
r = float(input())
area = r**2 * 3.141592653589
enshuu = r * 2 * 3.141592653589
print("{0:.6f} {1:.6f}".format(area, enshuu))
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
A = [[0 for i in range(m)] for j in range(n)]

for i in range(n):
    A[i][0], A[i][1], A[i][2], A[i][3] = map(int, input().split())

b = [0 for i in range(m)]
for i in range(m):
    b[i] = int(input())

for i in range(n):
    c = 0
    for j in range(m):
        c += A[i][j] * b[j]
    print(c)

Fixed submission:
n, m = map(int, input().split())
a = [[int(num) for num in input().split()] for i in range(n)]
b = [int(input()) for i in range(m)]
for i in range(n):
    c = 0
    for j in range(m):
        c += a[i][j] * b[j]
    print(c)
Buggy python submission (verdict: Runtime Error):
import output
r, c = map(int, input().split())
a = [[int(num) for num in input().split()] for i in range(r)]
a.append([0, 0, 0, 0, 0])
for i in range(c):
    for j in range(r):
        a[r][i] += a[j][i]
for i in range(c):
    a[i].append(sum(a[i]))
for i in range(r+1):
    for j in range(c+1):
        if j == c:
            print(a[i][j])
        else:
            print(a[i][j], end=" ")
            

Fixed submission:
r, c = map(int, input().split())
a = [[0 for i in range(c+1)] for j in range(r+1)]
for i in range(r):
    j = 0
    for line in input().split():
        a[i][j] = int(line)
        a[i][c] += a[i][j]
        j += 1
for i in range(c+1):
    for j in range(r):
        a[r][i] += a[j][i]
for i in range(r+1):
    for j in range(c+1):
        if j == c:
            print(a[i][j])
        else:
            print(a[i][j], end=" ")

Buggy python submission (verdict: Runtime Error):
r, c = map(int, input().split())
a = [[int(num) for num in input().split()] for i in range(r)]
a.append([0, 0, 0, 0, 0])
for i in range(c):
    for j in range(r):
        a[r][i] += a[j][i]
for i in range(c):
    a[i].append(sum(a[i]))
for i in range(r+1):
    for j in range(c+1):
        if j == c:
            print(a[i][j])
        else:
            print(a[i][j], end=" ")

Fixed submission:
r, c = map(int, input().split())
a = [[0 for i in range(c+1)] for j in range(r+1)]
for i in range(r):
    j = 0
    for line in input().split():
        a[i][j] = int(line)
        a[i][c] += a[i][j]
        j += 1
for i in range(c+1):
    for j in range(r):
        a[r][i] += a[j][i]
for i in range(r+1):
    for j in range(c+1):
        if j == c:
            print(a[i][j])
        else:
            print(a[i][j], end=" ")

Buggy python submission (verdict: Runtime Error):
r, c = map(int, input().split())
a = [[int(num) for num in input().split()] for i in range(r)]
a.append([0, 0, 0, 0, 0])
for i in range(c):
    for j in range(r):
        a[r][i] += a[j][i]
for i in range(c):
    a[i].append(sum(a[i]))
for i in range(r+1):
    for j in range(c+1):
        if j == c:
            print(a[i][j])
        else:
            print(a[i][j], end=" ")

Fixed submission:
r, c = map(int, input().split())
a = [[0 for i in range(c+1)] for j in range(r+1)]
for i in range(r):
    j = 0
    for line in input().split():
        a[i][j] = int(line)
        a[i][c] += a[i][j]
        j += 1
for i in range(c+1):
    for j in range(r):
        a[r][i] += a[j][i]
for i in range(r+1):
    for j in range(c+1):
        if j == c:
            print(a[i][j])
        else:
            print(a[i][j], end=" ")
Buggy python submission (verdict: Runtime Error):
n, m, l = map(int, input().split())
a = [[int(num) for num in input().split()] for i in range(n)]
b = [[int(num) for num in input().split()] for i in range(m)]
c = [[0 for i in range(n)] for j in range(l)]
for i in range(l):
    for j in range(n):
        for k in range(m):
            c[i][j] += a[i][k] * b[k][j]

for i in range(n):
    for j in range(l):
        if j == l - 1:
            print(c[i][j])
        else:
            print("{0} ".format(c[i][j]), end = "")

Fixed submission:
n, m, l = map(int, input().split())
a = [[int(num) for num in input().split()] for i in range(n)]
b = [[int(num) for num in input().split()] for i in range(m)]
c = [[0 for i in range(l)] for j in range(n)]
for i in range(n):
    for j in range(l):
        for k in range(m):
            c[i][j] += a[i][k] * b[k][j]
for i in range(n):
    for j in range(l):
        if j == l - 1:
            print(c[i][j])
        else:
            print(c[i][j], end=" ")

Buggy python submission (verdict: Runtime Error):
n, m, l = map(int, input().split())
A = [[int(n) for n in input().split()] for i in range(n)]
B = [[int(n) for n in input().split()] for i in range(m)]
C = [[0 for i in range(l)] for j in range(n)]
for i in range(l):
    for j in range(n):
        for k in range(m):
            C[i][j] += A[i][k] * B[k][j]
for i in range(n):
    for j in range(l):
        if j == l - 1:
            print(C[i][j])
        else:
            print(C[i][j], end = " ")

Fixed submission:
n, m, l = map(int, input().split())
a = [[int(num) for num in input().split()] for i in range(n)]
b = [[int(num) for num in input().split()] for i in range(m)]
c = [[0 for i in range(l)] for j in range(n)]
for i in range(n):
    for j in range(l):
        for k in range(m):
            c[i][j] += a[i][k] * b[k][j]
for i in range(n):
    for j in range(l):
        if j == l - 1:
            print(c[i][j])
        else:
            print(c[i][j], end=" ")

Buggy python submission (verdict: Runtime Error):
n, m, l = map(int, input().split())
A = [[int(n) for n in input().split()] for i in range(n)]
B = [[int(n) for n in input().split()] for i in range(m)]
C = [[0 for i in range(l)] for i in range(n)]
for i in range(l):
    for j in range(n):
        for k in range(m):
            C[i][j] += A[i][k] * B[k][j]
for i in range(n):
    for j in range(l):
        if j == l - 1:
            print(C[i][j])
        else:
            print(C[i][j], end = " ")

Fixed submission:
n, m, l = map(int, input().split())
a = [[int(num) for num in input().split()] for i in range(n)]
b = [[int(num) for num in input().split()] for i in range(m)]
c = [[0 for i in range(l)] for j in range(n)]
for i in range(n):
    for j in range(l):
        for k in range(m):
            c[i][j] += a[i][k] * b[k][j]
for i in range(n):
    for j in range(l):
        if j == l - 1:
            print(c[i][j])
        else:
            print(c[i][j], end=" ")
Buggy python submission (verdict: Runtime Error):
import numpy as np
def f(n):
        m = np.matrix('1 1 ; 1 0') ** n
        return m.item(0)
print(f(int(input())))

Fixed submission:
def g(a,b,n):
    if n==1:return a
    else:return g(a+b,a,n-1)
print(g(1,1,int(input())))

Buggy python submission (verdict: Runtime Error):
import numpy as np
def f(n):
    m = np.matrix('1 1 ; 1 0') ** n
    return m.item(0)
print(f(int(input())))

Fixed submission:
def g(a,b,n):
    if n==1:return a
    else:return g(a+b,a,n-1)
print(g(1,1,int(input())))

Buggy python submission (verdict: Runtime Error):
import numpy as np
def f(n):
    m = np.matrix('1 1 ; 1 0') ** n
    return m.item(0)
print(f(int(input())),end="")

Fixed submission:
def g(a,b,n):
    if n==1:return a
    else:return g(a+b,a,n-1)
print(g(1,1,int(input())))

Buggy python submission (verdict: Runtime Error):
import numpy as np
def f(n):
    m = np.matrix('1 1 ; 1 0') ** n
    return m.item(0)
print(f(int(input())))

Fixed submission:
def g(a,b,n):
    if n==1:return a
    else:return g(a+b,a,n-1)
print(g(1,1,int(input())))
Buggy python submission (verdict: Runtime Error):
def counting_sort(array, maxval):
    m = maxval + 1
    count = [0] * (m)
    for a in array:
        count[a] += 1
    i = 0
    for a in range(m):
        for c in range(count[a]):
            array[i] = a
            i += 1
    return array
 
if __name__ == '__main__':
    N = int(input())
    l = list(map(int, input().split()))
    
    a = 0
    li = counting_sort(l, N)
    
    for a in range(N-1):
        print(li[a], end=" ") 
    
    print(li[N-1])

Fixed submission:
def counting_sort(array, maxval):
    m = maxval + 1000
    count = [0] * (m)
    for a in array:
        count[a] += 1
    i = 0
    for a in range(m):
        for c in range(count[a]):
            array[i] = a
            i += 1
    return array
 
if __name__ == '__main__':
    N = int(input())
    l = list(map(int, input().split()))
    a = 0
    li = counting_sort(l, N)
    for a in range(N-1):
        print(li[a], end=" ") 
    print(li[N-1])
Buggy python submission (verdict: Runtime Error):
import math
debt = 100000
for x in range (0, int(input())):
    debt = math.ceil(debt * 1.05, -3)
    
print(int(debt))

Fixed submission:
def ceil(src, range):
    k = src / 1000
    if k == int(k):
        return int(src)
    else:
        return ((int)(src / range) + 1 ) * range

debt = 100000
for x in range (0, int(input())):
    debt = ceil(debt * 1.05, 1000)
    
print(int(debt))
Buggy python submission (verdict: Runtime Error):
number = input(x=:)

x = int(number)

print(x***)

Fixed submission:
x = int(input())

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

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

c,d = a * b,(a + b) *2

print(str(c) + " " + str(d))

Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())

c = a * b
d = (a + b) *2

print(str(c,d))

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

c,d = a * b,(a + b) *2

print(str(c) + " " + str(d))

Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())

c = a * b
d = (a + b) *2

print(str(c,d))

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

c,d = a * b,(a + b) *2

print(str(c) + " " + str(d))

Buggy python submission (verdict: Runtime Error):
a,b = map(int, input().split())

c = a * b
d = (a + b) *2

print(c d)

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

c,d = a * b,(a + b) *2

print(str(c) + " " + str(d))
Buggy python submission (verdict: Runtime Error):
x = int(input())

a = x / 60

hour = a / 60

minute = x - (hour * 60)

second = x - 60 * (hour + minute)

print(str(hour:minute:second))

Fixed submission:
S = int(input())

h = S // 3600

m = S % 3600 // 60

s = S % 3600 % 60

print(str(h) + ':' + str(m) + ':' + str(s))

Buggy python submission (verdict: Runtime Error):
S = int(input())

s = S % 3600

h = S / 3600

m = S - (h * 60) - s

print(str(h,m,s,sep=":"))

Fixed submission:
S = int(input())

h = S // 3600

m = S % 3600 // 60

s = S % 3600 % 60

print(str(h) + ':' + str(m) + ':' + str(s))

Buggy python submission (verdict: Runtime Error):
S = int(input())

h = intS // 3600

m = S % 3600 // 60

s = S % 3600 % 60

print(str(h) + ':' + str(m) + ':' + str(s))

Fixed submission:
S = int(input())

h = S // 3600

m = S % 3600 // 60

s = S % 3600 % 60

print(str(h) + ':' + str(m) + ':' + str(s))
Buggy python submission (verdict: Runtime Error):
a,b = map(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):
x= map(input().split())

print(x.sort, sep=" ")

Fixed submission:
print(*sorted(input().split(" ")))

Buggy python submission (verdict: Runtime Error):
x= [a,b,c]
a,b,c = (input().split())

x.sort()
print(x,sep=" ")

Fixed submission:
print(*sorted(input().split(" ")))

Buggy python submission (verdict: Runtime Error):
for i in x,input():

        if x == 0:
        break

print("Case " +i+ ": " + x)

Fixed submission:
print(*sorted(input().split(" ")))

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

for i in x:

        if x == 0:
        break

print("Case " +i+ ": " + x)

Fixed submission:
print(*sorted(input().split(" ")))

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

for i in x:

        if x == 0:
        break

    print("Case " +i+ ": " + x)

Fixed submission:
print(*sorted(input().split(" ")))
Buggy python submission (verdict: Runtime Error):
W,H,x,y,r = map(int,input().split())

if (x-r)< 0
   or (y-r) < 0 
   or (x+r) > W
   or (y+r) > H:
	print("No")
else:
	print("Yes")

Fixed submission:
W,H,x,y,r = map(int,input().split())

if (x-r)< 0 or (y-r) < 0 or(x+r) > W or (y+r) > H:
	print("No")
else:
	print("Yes")
Buggy python submission (verdict: Runtime Error):
for i in range(10000)
	x= input()
	print("Case i: x)

	if x = 0:
	break

Fixed submission:
import sys 

cnt =1

while 1:
    x = sys.stdin.readline().strip()
    if x == "0":
        break

    print("Case %d: %s"%(cnt,x))
    cnt+=1

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

for i in range(10000)

	print("Case i: x)

	if x = 0:
	break

Fixed submission:
import sys 

cnt =1

while 1:
    x = sys.stdin.readline().strip()
    if x == "0":
        break

    print("Case %d: %s"%(cnt,x))
    cnt+=1

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

for i in range(10000)

	print("Case i: x)

	if x = 0:
?????????????????????break

Fixed submission:
import sys 

cnt =1

while 1:
    x = sys.stdin.readline().strip()
    if x == "0":
        break

    print("Case %d: %s"%(cnt,x))
    cnt+=1

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

for i in range(10000)
	print("Case i: x)

	if x == 0:
		break

Fixed submission:
import sys 

cnt =1

while 1:
    x = sys.stdin.readline().strip()
    if x == "0":
        break

    print("Case %d: %s"%(cnt,x))
    cnt+=1

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

i = 1
for i in sys.stdin.readlines().strip()
	if i == 0:
		break
	print("Case i: x")
	i += 1

Fixed submission:
import sys 

cnt =1

while 1:
    x = sys.stdin.readline().strip()
    if x == "0":
        break

    print("Case %d: %s"%(cnt,x))
    cnt+=1

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

a = 1

for b in sys.stdin:
    if b.strip() == 0:
        break
    
    print"Case %d: %s" % (a,b.strip)
    a += 1

Fixed submission:
import sys 

cnt =1

while 1:
    x = sys.stdin.readline().strip()
    if x == "0":
        break

    print("Case %d: %s"%(cnt,x))
    cnt+=1

Buggy python submission (verdict: Runtime Error):
import sys 
cnt =1
while 1:
    x = sys.stdin.strip()
    if x == "0":
        break;
    print("Case %d: %s"%(cnt,x))
    cnt+=1

Fixed submission:
import sys 

cnt =1

while 1:
    x = sys.stdin.readline().strip()
    if x == "0":
        break

    print("Case %d: %s"%(cnt,x))
    cnt+=1

Buggy python submission (verdict: Runtime Error):

import sys 
cnt =1
while 1:
    x = sys.stdin.readline().strip()
    if x == "0":
        break:
    print("Case %d: %s"%(cnt,x))
    cnt+=1

Fixed submission:
import sys 

cnt =1

while 1:
    x = sys.stdin.readline().strip()
    if x == "0":
        break

    print("Case %d: %s"%(cnt,x))
    cnt+=1
Buggy python submission (verdict: Runtime Error):
N = int(input())
for i in range(N):
    a = list(map(int, input().split()))
    a = sorted(a)
    x,y,z = a[0],a[1],a[2]
    if x**2 + y**2 == z**2:
        print("yes")
    else:
        print("no")

Fixed submission:
N = int(input())
for i in range(N):
    a = list(map(int, input().split()))
    a = sorted(a)
    x = a[0]
    y = a[1]
    z = a[2]
    if x**2 + y**2 == z**2:
        print("YES")
    else:
        print("NO")

Buggy python submission (verdict: Runtime Error):
N = int(input())
for i in range(N):
    a = list(map(int, input().split()))
    a = sorted(a)
    x,y,z = a[0],a[1],a[2]
    if x**2 + y**2 == z**2:
        print("yes")
    else:
        print("no")

Fixed submission:
N = int(input())
for i in range(N):
    a = list(map(int, input().split()))
    a = sorted(a)
    x = a[0]
    y = a[1]
    z = a[2]
    if x**2 + y**2 == z**2:
        print("YES")
    else:
        print("NO")
Buggy python submission (verdict: Runtime Error):
x1,y1x2,y2=int(input().split())
print(sqrt((x2-x1)**2+(y2-y1**2)))

Fixed submission:
x1,y1,x2,y2=map(float,input().split())
print("%.6f"%((x2-x1)**2+(y2-y1)**2)**0.5)

Buggy python submission (verdict: Runtime Error):
import math
x1,y1,x2,y2=map(int,input().split())
print(math.sqrt((x2-x1)**2+(y2-y1**2)))

Fixed submission:
x1,y1,x2,y2=map(float,input().split())
print("%.6f"%((x2-x1)**2+(y2-y1)**2)**0.5)

Buggy python submission (verdict: Runtime Error):
import math
x1,y1,x2,y2=map(int,input().split())
print("%.6f"%math.sqrt((x2-x1)**2+(y2-y1**2)))

Fixed submission:
x1,y1,x2,y2=map(float,input().split())
print("%.6f"%((x2-x1)**2+(y2-y1)**2)**0.5)

Buggy python submission (verdict: Runtime Error):
x1,y1,x2,y2=map(int,input().split())
print("%.6f"%((x2-x1)**2+(y2-y1**2))**0.5)

Fixed submission:
x1,y1,x2,y2=map(float,input().split())
print("%.6f"%((x2-x1)**2+(y2-y1)**2)**0.5)
Buggy python submission (verdict: Runtime Error):
N = input()
print(N**3)

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

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

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