Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
input()
myarr = list(map(int, split(input())))
for i in range(1, len(myarr)):
    for j in range(i, 0,-1):
        if myarr[j] < myarr[j-1]:
            t = myarr[j]
            myarr[j] = myarr[j-1]
            myarr[j-1] = t
        else:
            break
    print(" ".join(map(str, myarr)))
        
    


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

for i in range(len(arr)):
    for j in range(i,0,-1):
        if(arr[j] < arr[j-1]):
            temp = arr[j]
            arr[j] = arr[j-1]
            arr[j-1] = temp
        else:
            continue
    print(' '.join(map(str,arr)))

Buggy python submission (verdict: Runtime Error):
input()
myarr = list(map(int, input().split())
for i in range(1, len(myarr)):
    for j in range(i, 0,-1):
        if myarr[j] < myarr[j-1]:
            t = myarr[j]
            myarr[j] = myarr[j-1]
            myarr[j-1] = t
        else:
            break
    print(" ".join(map(str, myarr)))
        
    


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

for i in range(len(arr)):
    for j in range(i,0,-1):
        if(arr[j] < arr[j-1]):
            temp = arr[j]
            arr[j] = arr[j-1]
            arr[j-1] = temp
        else:
            continue
    print(' '.join(map(str,arr)))

Buggy python submission (verdict: Runtime Error):
def insertion_sort(arr):
    for i in range(1,len(arr)):
        j = i
        while arr[j] < arr[j-1] and j > 0:
            arr[j-1], arr[j] = arr[j], arr[j-1]
            j -= 1
        print(" ".join(arr))

input()
arr = list(map(int, input().split()))
insertion_sort(arr)




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

for i in range(len(arr)):
    for j in range(i,0,-1):
        if(arr[j] < arr[j-1]):
            temp = arr[j]
            arr[j] = arr[j-1]
            arr[j-1] = temp
        else:
            continue
    print(' '.join(map(str,arr)))
Buggy python submission (verdict: Runtime Error):
import sys
n,q=map(int, input().split())
queue = list(map(lambda x: x.strip().split(),sys.stdin.readlines()))
i = 0
while len(queue) > 0:
    if queue[i%len(queue)][1]-=q < 0:
        print("{} {}".format(q[i%len(queue)][0], i*q + q + q[i%len(queue)][1]))
        q.pop(i%len(queue))
    i+=1
  



Fixed submission:
import sys
n, q = map(int, input().split())
queue = [[label, int(num)] for label, num in map(lambda line: line.strip().split(), sys.stdin.readlines())] 
i = 0
time = 0
while len(queue) > 0:
    i = i % len(queue)
    time += q
    queue[i][1] -= q
    if queue[i][1] <= 0:
        time += queue[i][1]
        print("{} {}".format(queue[i][0], time))
        queue.pop(i)
        i -= 1
    i += 1
Buggy python submission (verdict: Runtime Error):
arr = list(input())
down = list()
areas = list()
 
for i, el in enumerate(arr):
    if el == "\\":
        down.append(i)
    elif el == "/" and not len(down) == 0:
        start_ind = down.pop()
        area = i - start_ind
        while len(areas) > 0 and areas[-1][0] > start_ind:
            area += areas.pop()[1]
        areas.append((start_ind, area))
 
areas = [areas[i][1] for i in range(len(areas))]
print(sum(areas))
if len(areas) == 0:
    print("0")
else:
    print(len(areas), " ".join(map(str,areas)))


Fixed submission:
arr = list(input())
down = list()
areas = list()

for i, el in enumerate(arr):
    if el == "\\":
        down.append(i)
    elif el == "/" and not len(down) == 0:
        start_ind = down.pop()
        area = i - start_ind
        while len(areas) > 0 and areas[-1][0] > start_ind:
            area += areas.pop()[1]
        areas.append((start_ind, area))

areas = [areas[i][1] for i in range(len(areas))]
print(sum(areas))
print(str(len(areas)) + " " + " ".join(map(str,areas)) if not len(areas) == 0  else "0")

Buggy python submission (verdict: Runtime Error):
arr = list(input())
down = list()
areas = list()
 
for i, el in enumerate(arr):
    if el == "\\":
        down.append(i)
    elif el == "/" and not len(down) == 0:
        start_ind = down.pop()
        area = i - start_ind
        while len(areas) > 0 and areas[-1][0] > start_ind:
            area += areas.pop()[1]
        areas.append((start_ind, area))
    # print("LOOP: {}".format(i))
    # print("DOWN INDICES")
    # print(down)
    # print("AREAS")
    # print(areas)
    # print()
 
areas = [areas[i][1] for i in range(len(areas))]
print(sum(areas))
if len(areas) == 0:
    print("0")
else:
    print(len(areas), " ".join(map(str,areas)))


Fixed submission:
arr = list(input())
down = list()
areas = list()

for i, el in enumerate(arr):
    if el == "\\":
        down.append(i)
    elif el == "/" and not len(down) == 0:
        start_ind = down.pop()
        area = i - start_ind
        while len(areas) > 0 and areas[-1][0] > start_ind:
            area += areas.pop()[1]
        areas.append((start_ind, area))

areas = [areas[i][1] for i in range(len(areas))]
print(sum(areas))
print(str(len(areas)) + " " + " ".join(map(str,areas)) if not len(areas) == 0  else "0")
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())

print(a*b, 2a+2b)


Fixed submission:
a, b = map(int, input().split())
print(a*b, 2*a+2*b)
Buggy python submission (verdict: Time Limit Exceeded):
def div(x, y): #x>y
    A = 1
    for i in range(1, x+1):
        if x % i == 0 and y % i == 0:
            A = i
    return A

x, y = map(int, input().split(" "))
print(div(x,y))





Fixed submission:
import math
def div(x, y): #x>y
    A = 1
    for i in range(1, int(math.sqrt(x))+1):
        if x % i == 0 and y % i == 0:
            A = max(A, i)
        j = int(x/i)
        if x % j == 0 and y % j == 0:
            A = max(A, j)
    return A
x, y = map(int, input().split(" "))
print(div(x,y))
Buggy python submission (verdict: Time Limit Exceeded):
def check(P):
    lis = [[] for i in range(k)]
    su = [0 for i in range(k)]
    
    su.append(-10000)
    for i, bag in enumerate(baggage):
        cur = 0
        #print(su,cur,su[cur])
        while su[cur] + bag > P:
            cur += 1
        if cur == k:
            return False
        else:
            lis[cur].append(bag)
            su[cur] += bag
    #print(lis, su, P)
    return True

def main():
    min_P = 1000000000
    left = 1
    right = 1000000000
    while left < right:
        mid = (left + right)//2 + 1
        #print(left, mid, right, end=" ")
        if check(mid):
            right = mid
            if min_P > mid:
                min_P = mid
        else:
            left = mid+1
    
    #print(left,right)
    print(min_P)
       
if __name__ == '__main__':
    n, k = map(int, input().rstrip().split(" "))
    #n,k= 5,3
    baggage = [int(input()) for i in range(n)]
    #baggage = [8,1,7,3,9]
    
    main()


Fixed submission:
def check(P):
    lis = [[] for i in range(k)]
    su = [0 for i in range(k)]
    
    su.append(-10000)
    cur = 0
    for i, bag in enumerate(baggage):
        #cur = 0
        #print(su,cur,su[cur])
        while su[cur] + bag > P:
            cur += 1
        if cur == k:
            return False
        else:
            lis[cur].append(bag)
            su[cur] += bag
    #print(lis, su, P)
    return True

def main():
    min_P = 1000000000
    left = 1
    right = 1000000000
    mid = (left + right)//2
    while  left < right:
        '''if (left + right) % 2 == 0:
            mid = (left + right)//2
        else:
            mid = (left + right)//2 + 1
        #print(left, mid, right, end=" ")'''
        
        if check(mid):
            right = mid
            if min_P > mid:
                min_P = mid
        else:
            left = mid + 1
        mid = (left + right)//2
    #print(left,right)
    print(min_P)
if __name__ == '__main__':
    n, k = map(int, input().rstrip().split(" "))
    #n,k= 5,3
    baggage = [int(input()) for i in range(n)]
    #baggage = [8,1,7,3,9]
    
    main()
Buggy python submission (verdict: Runtime Error):
for i in range():
    inpu = int(input())
    if inpu == 0:
        break
    else:
        print("Case %d: %d" % (i, inpu))


Fixed submission:
for i in range(1, 10001):
    inpu = int(input())
    if inpu == 0:
        break
    else:
        print("Case %d: %d" % (i, inpu))
Buggy python submission (verdict: Runtime Error):
repetition = True
while repetition == True:
    a, b = map(int, input().split(" "))
    if a > b:
        a, b = b, a
    print("%d %d" % (a,b))


Fixed submission:
while True:
    a, b = map(int, input().split(" "))
    if a == b == 0:
        break
    if a > b:
        a, b = b, a
    print("%d %d" % (a,b))
Buggy python submission (verdict: Runtime Error):
a, b, c = [int(i) for i in input()rstrip().split(" ")]
cnt = 0
for i in range(a, b+1):
    if c % i == 0:
        cnt += 1
print(cnt)


Fixed submission:
a, b, c = [int(i) for i in input().rstrip().split(" ")]
cnt = 0
for i in range(a, b+1):
    if c % i == 0:
        cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
import math
r = int(input())
print("%.5f %.5f" % (math.pi*r *r, 2*math.pi*r))


Fixed submission:
import math
r = float(input())
print("%.5f %.5f" % (math.pi*r *r, 2*math.pi*r))
Buggy python submission (verdict: Runtime Error):
while True:
    a, op, b = map(int, inptut().split(" "))
    if a == 0 and b == 0:
        break
    
    if op == "+":
        c = a + b
    elif op == "-":
        c = a - b
    elif op == "*":
        c = a + b
    else
        c = a / b
    print(c)


Fixed submission:
while True:
    a, op, b = map(str, input().split(" "))
    if op == "?":
        break
    a, b = int(a), int(b)
    if op == "+":
        c = a + b
    elif op == "-":
        c = a - b
    elif op == "*":
        c = a * b
    else:
        c = a // b
    print(c)

Buggy python submission (verdict: Runtime Error):
while True:
    a, op, b = map(int, inptut().split(" "))
    if a == 0 and b == 0:
        break
    
    if op == "+":
        c = a + b
    elif op == "-":
        c = a - b
    elif op == "*":
        c = a * b
    else
        c = a / b
    print(c)


Fixed submission:
while True:
    a, op, b = map(str, input().split(" "))
    if op == "?":
        break
    a, b = int(a), int(b)
    if op == "+":
        c = a + b
    elif op == "-":
        c = a - b
    elif op == "*":
        c = a * b
    else:
        c = a // b
    print(c)

Buggy python submission (verdict: Runtime Error):
while True:
    a, op, b = map(int, input().split(" "))
    if a == 0 and b == 0:
        break
    
    if op == "+":
        c = a + b
    elif op == "-":
        c = a - b
    elif op == "*":
        c = a * b
    else
        c = a / b
    print(c)


Fixed submission:
while True:
    a, op, b = map(str, input().split(" "))
    if op == "?":
        break
    a, b = int(a), int(b)
    if op == "+":
        c = a + b
    elif op == "-":
        c = a - b
    elif op == "*":
        c = a * b
    else:
        c = a // b
    print(c)

Buggy python submission (verdict: Runtime Error):
while True:
    a, op, b = map(int, input().split(" "))
    if a == 0 and b == 0:
        break
    
    if op == "+":
        c = a + b
    elif op == "-":
        c = a - b
    elif op == "*":
        c = a * b
    else:
        c = a / b
    print(c)


Fixed submission:
while True:
    a, op, b = map(str, input().split(" "))
    if op == "?":
        break
    a, b = int(a), int(b)
    if op == "+":
        c = a + b
    elif op == "-":
        c = a - b
    elif op == "*":
        c = a * b
    else:
        c = a // b
    print(c)

Buggy python submission (verdict: Runtime Error):
while True:
    a, op, b = map(str, input().split(" "))
    if a == 0 and b == 0:
        break
    a, b = int(a), int(b)
    if op == "+":
        c = a + b
    elif op == "-":
        c = a - b
    elif op == "*":
        c = a * b
    else:
        c = a / b
    print(c)


Fixed submission:
while True:
    a, op, b = map(str, input().split(" "))
    if op == "?":
        break
    a, b = int(a), int(b)
    if op == "+":
        c = a + b
    elif op == "-":
        c = a - b
    elif op == "*":
        c = a * b
    else:
        c = a // b
    print(c)
Buggy python submission (verdict: Runtime Error):
n = int(input())
lis = map(int, input()split(" "))
big_num = 1000000
max_num, min_num, sum = -1*big_num, big_num, 0
for i in lis:
    if i > max_num:
        max_num = i
    if i < min_num:
        min_num = i
    sum += i
print("%d %d %d" % (min_num, max_num, sum))


Fixed submission:
n = int(input())
lis = list(map(int, input().split(" ")))
big_num = 1000000
max_num, min_num, sum = -1*big_num, big_num, 0
for i in lis:
    if i > max_num:
        max_num = i
    if i < min_num:
        min_num = i
    sum += i
print("%d %d %d" % (min_num, max_num, sum))

Buggy python submission (verdict: Runtime Error):
n = int(input())
lis = list(map(int, input()split(" ")))
big_num = 1000000
max_num, min_num, sum = -1*big_num, big_num, 0
for i in lis:
    if i > max_num:
        max_num = i
    if i < min_num:
        min_num = i
    sum += i
print("%d %d %d" % (min_num, max_num, sum))


Fixed submission:
n = int(input())
lis = list(map(int, input().split(" ")))
big_num = 1000000
max_num, min_num, sum = -1*big_num, big_num, 0
for i in lis:
    if i > max_num:
        max_num = i
    if i < min_num:
        min_num = i
    sum += i
print("%d %d %d" % (min_num, max_num, sum))
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = []
for i in range(n):
    s.append(int(input()))
max_s = -10**9
for i in range(n-1):
    for j in range(i+1,n):
        R = s[j] - s[i]
        if max_s < R:
            max_s = R

print(max_s)



Fixed submission:
n = int(input())
s = []
for i in range(n):
    s.append(int(input()))
max_s = -10**9
min_s = s[0]
for i in range(1, n):
    max_s = max(max_s, s[i] - min_s)
    min_s = min(min_s, s[i])

print(max_s)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
s = []
for i in range(n):
    s.append(int(input()))
max_s = -10**9
for i in range(n-1):
    R_i = s[i]
    s[i] = 0
    R_j = max(s)
    R = R_j - R_i
    if R > max_s:
        max_s = R

print(max_s)



Fixed submission:
n = int(input())
s = []
for i in range(n):
    s.append(int(input()))
max_s = -10**9
min_s = s[0]
for i in range(1, n):
    max_s = max(max_s, s[i] - min_s)
    min_s = min(min_s, s[i])

print(max_s)
Buggy python submission (verdict: Runtime Error):
import math
def isprime(n):
    m = int(math.sqrt(n)) + 1
    check = 1
    nums = [i for i in range(2, n)]
    while nums[0] <= m:
        p = nums[0]
        for j in range(1, int(n / p) + 1):
            nums.remove(p * j)
        if n not in nums:
            check = 0
            break
        else:
            pass
    return check
    
n = int(input())
ans = 0
for k in range(n):
    a = int(input())
    ans += isprime(a)
    
print(ans)


Fixed submission:
def isprime(n):
    check = 1
    if n == 2:
        pass
    elif n == 1 or n % 2 == 0:
        check = 0
    else:
        i = 3
        while i * i <= n:
            if n % i == 0:
                check = 0
                break
            else:
                i += 2
    return check
        

n = int(input())
ans = 0
for k in range(n):
    a = int(input())
    ans += isprime(a)
    
print(ans)

Buggy python submission (verdict: Runtime Error):
import math
def isprime(n):
    check = 1
    if n == 1:
        check = 0
    else:
        m = int(math.sqrt(n)) + 1
        nums = [i for i in range(2, n)]
        while nums[0] <= m:
            p = nums[0]
            for j in range(1, int(n / p) + 1):
                nums.remove(p * j)
            if n not in nums:
                check = 0
                break
            else:
                pass
    return check
    
n = int(input())
ans = 0
for k in range(n):
    a = int(input())
    ans += isprime(a)
    
print(ans)


Fixed submission:
def isprime(n):
    check = 1
    if n == 2:
        pass
    elif n == 1 or n % 2 == 0:
        check = 0
    else:
        i = 3
        while i * i <= n:
            if n % i == 0:
                check = 0
                break
            else:
                i += 2
    return check
        

n = int(input())
ans = 0
for k in range(n):
    a = int(input())
    ans += isprime(a)
    
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque


def main():
    d = deque()
    for _ in range(int(input())):
        d.append(int(input()))
    
    result = min(d) - max(d)

    while d:
        c = d.popleft()
        if not d:
            break

        if max(d) - c > result:
            result = max(d) - c
    
    print(result)



if __name__ == '__main__':
    main()


Fixed submission:
def main():
    r = []
    for _ in range(int(input())):
        r.append(int(input()))

    n = len(r)
    maxv = -20000000000
    minv = r[0]

    for i in range(1, n):
        maxv = max([maxv, r[i] - minv])
        minv = min([minv, r[i]])
    
    print(maxv)


if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
from sys import stdin

s = int(stdin.readline().rstrip().split())
h = s//3600
m = (s%3600)//60
sec = (s%3600)%60
print("{}:{}:{}".format(h, m, sec))



Fixed submission:
def main():
    s = int(input())
    print("{}:{}:{}".format(s//3600, (s%3600)//60, (s%3600)%60))

if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
from sys import stdin

while True:
    a, op, b = stdin.readline().rstrip().split()
    else if op == "+":
        print(int(a)+int(b))
    else if op == "-":
        print(int(a)-int(b))
    else if op == "*":
        print(int(a)*int(b))
    else if op == "/":
        print(int(a)//int(b))
    else: # op == "?"
        break



Fixed submission:
from sys import stdin

while True:
    a, op, b = stdin.readline().rstrip().split()
    if op == "+":
        print(int(a)+int(b))
    elif op == "-":
        print(int(a)-int(b))
    elif op == "*":
        print(int(a)*int(b))
    elif op == "/":
        print(int(a)//int(b))
    else: # op == "?"
        break

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

while True:
    a, op, b = stdin.readline().rstrip().split()
    else if op == '+':
        print(int(a)+int(b))
    else if op == '-':
        print(int(a)-int(b))
    else if op == '*':
        print(int(a)*int(b))
    else if op == '/':
        print(int(a)//int(b))
    else: # op == '?'
        break



Fixed submission:
from sys import stdin

while True:
    a, op, b = stdin.readline().rstrip().split()
    if op == "+":
        print(int(a)+int(b))
    elif op == "-":
        print(int(a)-int(b))
    elif op == "*":
        print(int(a)*int(b))
    elif op == "/":
        print(int(a)//int(b))
    else: # op == "?"
        break
Buggy python submission (verdict: Runtime Error):
from sys import stdin
import numpy as np

n, m = [int(x) for x in stdin.readline().rstrip().split()]
a = np.asarray([[int(x) for x in stdin.readline().rstrip().split()] for _ in range(n)])
b = np.asarray([[int(stdin.readline().rstrip())] for _ in range(m)])
c = a.dot(b)
for i in range(n):
    print(*c[i])


Fixed submission:
from sys import stdin

n, m = [int(x) for x in stdin.readline().rstrip().split()]
a = [[int(x) for x in stdin.readline().rstrip().split()] for _ in range(n)]
b = [[int(stdin.readline().rstrip())] for _ in range(m)]
c = [[0] for _ in range(n)]
for i in range(n):
    for j in range(m):
    	c[i][0] += (a[i][j]*b[j][0])

for i in range(n):
    print(*c[i])
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
cnt = 0
for i in range(n):
    x = int(input())
    j = 2
    flag = 0
    while j <= x ** 1/2:
        if x % j == 0:
            flag = 1
            break
        j += 1
    if flag == 0:
        cnt += 1
print(cnt)


Fixed submission:
import math


def isprime(x):
    for i in range(2,int(math.sqrt(x)) + 1):
        if x % i == 0:
            return 0
    return 1


n = int(input())
cnt = 0
for i in range(n):
    x = int(input())
    if isprime(x):
        cnt += 1
print(cnt)

Buggy python submission (verdict: Runtime Error):
def get_sieve_of_eratosthenes(x):
    data = [True] * (x + 1)
    data[0] = data[1] = False
    i = 2
    while i ** 2 <= x:
        if data[i]:
            for j in range(i + 1, x + 1):
                if j % i == 0:
                    data[j] = False
        i += 1
    return data


pn = get_sieve_of_eratosthenes(1000)
n = int(input())
cnt = 0
for i in range(n):
    a = int(input())
    if pn[a]:
        cnt += 1
print(cnt)



Fixed submission:
import math


def isprime(x):
    for i in range(2,int(math.sqrt(x)) + 1):
        if x % i == 0:
            return 0
    return 1


n = int(input())
cnt = 0
for i in range(n):
    x = int(input())
    if isprime(x):
        cnt += 1
print(cnt)
Buggy python submission (verdict: Runtime Error):
import math
n=input().split()
x=int(n[2])-int(n[0])
y=int(n[3])-int(n[1])

print(math.sqrt(x**2+y**2))



Fixed submission:
import math
n=input().split()
x=float(n[2])-float(n[0])
y=float(n[3])-float(n[1])

print(math.sqrt(x**2+y**2))
Buggy python submission (verdict: Runtime Error):
import statistics

a=int(input())
while True:
	if a==0:
		break
	else:
	num=list(map(int,input().split()))
	print(statistics.pstdev(num))



Fixed submission:
import statistics

while True:
	a=int(input())
	num=[]
	if a==0:
		break
	else:
		num=list(map(int,input().split()))
	print(statistics.pstdev(num))

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

a=int(input())
while True:
	if a==0:
		break
	else:
		num=list(map(int,input().split()))
		print(statistics.pstdev(num))



Fixed submission:
import statistics

while True:
	a=int(input())
	num=[]
	if a==0:
		break
	else:
		num=list(map(int,input().split()))
	print(statistics.pstdev(num))
Buggy python submission (verdict: Runtime Error):
while True:
	a=0
	num=list(map(int,input().split()))
	if num[0]==0 and n[1]==0:
		break
	else:
		for i in range(1,num[0]+1):
			for j in range(i+1,num[0]+1):
				for k in range(j+1,num[0]+1):
					if i+j+k==num[1]:
						a+=1
						print(i,j,k)
					
			


Fixed submission:
while True:
	a=0
	num=list(map(int,input().split()))
	if num[0]==0 and num[1]==0:
		break
	else:
		for i in range(1,num[0]+1):
			for j in range(i+1,num[0]+1):
				for k in range(j+1,num[0]+1):
					if i+j+k==num[1]:
						a+=1
		print(a)
Buggy python submission (verdict: Runtime Error):
alp=[]
txt=[]
for i in range(97,97+26):
	alp.append(chr(i))	
while True:
	if input()=='':
		break
	else:
		a=input()
		for i in a:
			txt.append(str.lower(i))

for i in alp:
	num=0
	for j in txt:
		if i==j:
			num+=1
	print(i+' : '+str(num))



Fixed submission:
import sys

alp=[]
for i in range(97,97+26):
	alp.append(chr(i))

s=sys.stdin.read().lower()

for i in alp:
	num=0
	for j in s:
		if i==j:
			num+=1
	print(i+' : '+str(num))
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,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 -= j
    A[j+1] = v



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

def sort(N,A):
    for i in range(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
        pr(A)

def pr(list):
    n = len(list)
    for i in range(n):
        if i < n-1:
            print(list[i],end=" ")
        else:
            print(list[i],end="\n")

sort(N,A)
Buggy python submission (verdict: Runtime Error):
int(i) = input()
print(i**3)

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