Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a,b=map(int, raw_input().split())
d=a/b
e=a%b
print ('%d %d %f' % (d,e,(float(a)/float(b)))

Fixed submission:
a,b=map(int, raw_input().split())
c=a/b
d=a%b
e=float(a)/float(b)
print ('%d %d %f' % (c,d,e))

Buggy python submission (verdict: Runtime Error):
a,b=map(int, raw_input().split())
d=a/b
e=a%b
print ('%d %d %f' % (d,e,float(a)/float(b))

Fixed submission:
a,b=map(int, raw_input().split())
c=a/b
d=a%b
e=float(a)/float(b)
print ('%d %d %f' % (c,d,e))

Buggy python submission (verdict: Runtime Error):
a,b=map(int, raw_input().split())
c=a/b
d=a%b
e=float(a)/float(b)
print ('%d %d %f' % (c,d,e)

Fixed submission:
a,b=map(int, raw_input().split())
c=a/b
d=a%b
e=float(a)/float(b)
print ('%d %d %f' % (c,d,e))
Buggy python submission (verdict: Runtime Error):
import sys
 
c = 0
for line in sys.stdin:
	if int(line) == 0:
		break
    c+=1
    print 'Case %s: %s' %(c,line),

Fixed submission:
import sys
 
c = 0
for line in sys.stdin:
	if line[0] == '0':
		break
	c+=1
	print 'Case %s: %s' %(c,line),
Buggy python submission (verdict: Runtime Error):
import sys
n = input()
a = [[[0]*10 for i in range(3)] for i in range(4)]
for i in xrange(n):
	b = map(int, raw_input().split())
	a[b[0]-1][b[1]-1][b[2]-1] += b[3]

for i in range(4):
	for j in range(3):
		for k in range(10):
			sys.stdout.write(' %s' % a[i][j][k])
		print ""
	if i != 3
	print '#'*20

Fixed submission:
import sys
n = input()
a = [[[0]*10 for i in range(3)] for i in range(4)]
for i in xrange(n):
	b = map(int, raw_input().split())
	a[b[0]-1][b[1]-1][b[2]-1] += b[3]

for i in range(4):
	for j in range(3):
		for k in range(10):
			sys.stdout.write(' %s' % a[i][j][k])
		print ""
	if i != 3:
		print '#'*20

Buggy python submission (verdict: Runtime Error):
import sys
n = input()
a = [[[0]*10 for i in range(3)] for i in range(4)]
for i in xrange(n):
	b = map(int, raw_input().split())
	a[b[0]-1][b[1]-1][b[2]-1] += b[3]

for i in range(4):
	for j in range(3):
		for k in range(10):
			sys.stdout.write(' %s' % a[i][j][k])
		print ""
	if i != 3
	print '#'*20

Fixed submission:
import sys
n = input()
a = [[[0]*10 for i in range(3)] for i in range(4)]
for i in xrange(n):
	b = map(int, raw_input().split())
	a[b[0]-1][b[1]-1][b[2]-1] += b[3]

for i in range(4):
	for j in range(3):
		for k in range(10):
			sys.stdout.write(' %s' % a[i][j][k])
		print ""
	if i != 3:
		print '#'*20
Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
p = [0 for i in xrange(1, 101)]
m = [0 for i in xrange(1, 101)] for j in range(1, 101)

for i in xrange(1, n+1):
    p[n-1],p[n] = map(int, raw_input.split())

for k in xrange(2, n+1):
    for i in range(1, n-k+2):
       j = i+k-1
       m[i][j] = float("inf")
       for l in range(i,j):
          m[i][j] =  min(m[i][j], m[i][l]+m[l+1][j]+p[i-1]*p[l]*p[j])

print m[1][n]

Fixed submission:
n = int(raw_input())
p = [0 for i in range(0, 101)]
m = [[0 for i in range(0, 101)] for j in range(0, 101)]

for i in range(1, n+1):
   p[i-1], p[i] = map(int, raw_input().split())
     
for k in range(2, n+1):
   for i in range(1, n-k+2):
      j = i+k-1
      m[i][j] = float("inf")
      for l in range(i, j):
         m[i][j] = min(m[i][j], m[i][l] + m[l+1][j] + p[i-1]*p[l]*p[j])
 
print m[1][n]

Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
p = [0 for i in xrange(0, 101)]
m = [0 for i in xrange(0, 101)] for j in range(0, 101)

for i in xrange(1, n+1):
    p[n-1],p[n] = map(int, raw_input.split())

for k in xrange(2, n+1):
    for i in range(1, n-k+2):
       j = i+k-1
       m[i][j] = float("inf")
       for l in range(i,j):
          m[i][j] =  min(m[i][j], m[i][l]+m[l+1][j]+p[i-1]*p[l]*p[j])

print m[1][n]

Fixed submission:
n = int(raw_input())
p = [0 for i in range(0, 101)]
m = [[0 for i in range(0, 101)] for j in range(0, 101)]

for i in range(1, n+1):
   p[i-1], p[i] = map(int, raw_input().split())
     
for k in range(2, n+1):
   for i in range(1, n-k+2):
      j = i+k-1
      m[i][j] = float("inf")
      for l in range(i, j):
         m[i][j] = min(m[i][j], m[i][l] + m[l+1][j] + p[i-1]*p[l]*p[j])
 
print m[1][n]

Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
p = [0 for i in range(0, 101)]
m = [0 for i in range(0, 101)] for j in range(0, 101)

for i in range(1, n+1):
    p[n-1],p[n] = map(int, raw_input.split())

for k in range(2, n+1):
    for i in range(1, n-k+2):
       j = i+k-1
       m[i][j] = float("inf")
       for l in range(i,j):
          m[i][j] =  min(m[i][j], m[i][l]+m[l+1][j]+p[i-1]*p[l]*p[j])

print m[1][n]

Fixed submission:
n = int(raw_input())
p = [0 for i in range(0, 101)]
m = [[0 for i in range(0, 101)] for j in range(0, 101)]

for i in range(1, n+1):
   p[i-1], p[i] = map(int, raw_input().split())
     
for k in range(2, n+1):
   for i in range(1, n-k+2):
      j = i+k-1
      m[i][j] = float("inf")
      for l in range(i, j):
         m[i][j] = min(m[i][j], m[i][l] + m[l+1][j] + p[i-1]*p[l]*p[j])
 
print m[1][n]
Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
A = map(int, raw_input().split())
q = int(raw_input())
M = map(int, raw_input().split())
  
def solve(i,m):
  if m == 0:
    return True
  if i >= n or m - sum(A) > 0:
    return False
  res = solve(i+1,m) or solve(i+1, m-A[i]
  return res

for j in range(q):
   if solve(0,m[j]):
      print "yes"
   else:
      print "no"
 

Fixed submission:
n = int(raw_input())
A = map(int, raw_input().split())
q = int(raw_input())
M = map(int, raw_input().split())
  
def solve(i,m):
  if m == 0:
    return True
  if i >= n or m - sum(A) > 0:
    return False
  res = solve(i+1,m) or solve(i+1, m-A[i])
  return res

for j in range(q):
   if solve(0,M[j]):
      print "yes"
   else:
      print "no"

Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
A = map(int, raw_input().split())
q = int(raw_input())
M = map(int, raw_input().split())
  
def solve(i,m):
  if m == 0:
    return True
  if i >= n or m - sum(A) > 0:
    return False
  res = solve(i+1,m) or solve(i+1, m-A[i]
  return res

for j in range(q):
   if solve(0,M[j]):
      print "yes"
   else:
      print "no"
 

Fixed submission:
n = int(raw_input())
A = map(int, raw_input().split())
q = int(raw_input())
M = map(int, raw_input().split())
  
def solve(i,m):
  if m == 0:
    return True
  if i >= n or m - sum(A) > 0:
    return False
  res = solve(i+1,m) or solve(i+1, m-A[i])
  return res

for j in range(q):
   if solve(0,M[j]):
      print "yes"
   else:
      print "no"
Buggy python submission (verdict: Runtime Error):
x = row_input()
x = int(x)
print x * x * x

Fixed submission:
x = raw_input()
x = int(x)
print x*x*x
Buggy python submission (verdict: Runtime Error):
a, b=map(int,raw_input().split())
if a > b:
   print "a > b"
if a < b:
   print "a < b"
if a = b:
   print "a == b"
   

Fixed submission:
a,b = map(int, raw_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(raw_input().split())
if a > b:
  print 'a > b'
elif (a == b):
  print 'a == b'
else:
  print 'a < b'

Fixed submission:
a,b = map(int, raw_input().split())
if a > b:
  print 'a > b'
elif (a == b):
  print 'a == b'
else:
  print 'a < b'
Buggy python submission (verdict: Runtime Error):
i = 0
while 1:
   x = raw_input()
   i += 1
   if x == 0: 
     break
   print "Case %s : %s" % (i,x)

Fixed submission:
i = 0
while 1:
   x = raw_input()
   i += 1
   if x == '0': 
     break
   print "Case %s: %s" % (i,x)

Buggy python submission (verdict: Runtime Error):
i = 0
while 1:
   x = raw_input()
   i += 1
   if x == 0: 
     break
   print "Case %s : %s" % (i,x)

Fixed submission:
i = 0
while 1:
   x = raw_input()
   i += 1
   if x == '0': 
     break
   print "Case %s: %s" % (i,x)

Buggy python submission (verdict: Runtime Error):
i = 0
while 1:
   x = raw_input()
   i += 1
   if x == 0: 
     break
   print "Case %s: %s" % (i,x)

Fixed submission:
i = 0
while 1:
   x = raw_input()
   i += 1
   if x == '0': 
     break
   print "Case %s: %s" % (i,x)
Buggy python submission (verdict: Runtime Error):
i = 0
while 1:
   x,y = map(int, raw_input().split())
   i += 1
   if x == '0' and y == '0':
      break
   if x >= y:
      print '%s %s' % (y,x)
   else:
      print '%s %s' % (x,y)
   

Fixed submission:
while True:
   x,y = map(int, raw_input().split())
   if x == 0 and y == 0:
      break
   if x >= y:
      print '%s %s' % (y, x)
   else:
      print '%s %s' % (x, y)

Buggy python submission (verdict: Runtime Error):
i = 0
while 1:
   x,y = map(int, raw_input().split())
   i += 1
   if x == '0' and y == '0':
      break
   if x >= y:
      print '%s %s' % (y,x)
   if y >= x:
      print '%s %s' % (x,y)
   

Fixed submission:
while True:
   x,y = map(int, raw_input().split())
   if x == 0 and y == 0:
      break
   if x >= y:
      print '%s %s' % (y, x)
   else:
      print '%s %s' % (x, y)

Buggy python submission (verdict: Runtime Error):
i = 0
while 1:
   x,y = map(int, raw_input().split())
   i += 1
   if x == '0' and y == '0':
      break
   elif x >= y:
      print '%s %s' % (y,x)
   else:
      print '%s %s' % (x,y)
   

Fixed submission:
while True:
   x,y = map(int, raw_input().split())
   if x == 0 and y == 0:
      break
   if x >= y:
      print '%s %s' % (y, x)
   else:
      print '%s %s' % (x, y)

Buggy python submission (verdict: Runtime Error):
i = 0
while 1:
   x,y = map(int, raw_input().split())
   i += 1
   if x == '0' and y == '0':
      break
   else:
      if x >= y:
         print 'y x'
      else:
         print 'x y'
   

Fixed submission:
while True:
   x,y = map(int, raw_input().split())
   if x == 0 and y == 0:
      break
   if x >= y:
      print '%s %s' % (y, x)
   else:
      print '%s %s' % (x, y)

Buggy python submission (verdict: Runtime Error):
while 1:
   x,y = map(int, raw_input().split())
   if x == '0' and y == '0':
      break
   else:
      if x >= y:
         print 'y x'
      else:
         print 'x y'
   

Fixed submission:
while True:
   x,y = map(int, raw_input().split())
   if x == 0 and y == 0:
      break
   if x >= y:
      print '%s %s' % (y, x)
   else:
      print '%s %s' % (x, y)

Buggy python submission (verdict: Runtime Error):
while True:
   x,y = map(int, raw_input().split())
   if x == '0' and y == '0':
      break
   else:
      if x >= y:
         print 'y x'
      else:
         print 'x y'
   

Fixed submission:
while True:
   x,y = map(int, raw_input().split())
   if x == 0 and y == 0:
      break
   if x >= y:
      print '%s %s' % (y, x)
   else:
      print '%s %s' % (x, y)

Buggy python submission (verdict: Runtime Error):
while True:
   x,y = map(int, input().split())
   if x == 0 and y == 0:
      break
   if x >= y:
      print '%s %s' % (y, x)
   else:
      print '%s %s' % (x, y)

Fixed submission:
while True:
   x,y = map(int, raw_input().split())
   if x == 0 and y == 0:
      break
   if x >= y:
      print '%s %s' % (y, x)
   else:
      print '%s %s' % (x, y)
Buggy python submission (verdict: Runtime Error):
def sircle():
   r = raw_input()
   r = int(r)
   a = r*r*3.141592
   b = 2 * r 3.141592
   print "a b"

Fixed submission:
import math
r = raw_input()
r = float(r)
a = r*r*math.pi
b = 2 * r *math.pi
print "%.9f %.9f"%(a,b)

Buggy python submission (verdict: Runtime Error):

   r = raw_input()
   r = int(r)
   a = r*r*3.141592
   b = 2 * r 3.141592
   print "a b"

Fixed submission:
import math
r = raw_input()
r = float(r)
a = r*r*math.pi
b = 2 * r *math.pi
print "%.9f %.9f"%(a,b)

Buggy python submission (verdict: Runtime Error):
r = raw_input()
r = float(r)
a = r*r*3.141592653
b = 2 * r 3.141592653
print "%.9f %.9f"%(a,b)

Fixed submission:
import math
r = raw_input()
r = float(r)
a = r*r*math.pi
b = 2 * r *math.pi
print "%.9f %.9f"%(a,b)
Buggy python submission (verdict: Runtime Error):
while True
  a,op,b = raw_input().split
  a,b = map(int,[a,b])

  if op == "+";
     print a+b
  if op == "-";
     print a-b
  if op == "*";
     print a*b
  if op == "/";
     print a/b

Fixed submission:
while True:
  a,op,b = raw_input().split()
  a,b = map(int,[a,b])

  if op == "?":
     break

  if op == "+":
     print (a+b)
  elif op == "-":
     print (a-b)
  elif op == "*":
     print (a*b)
  elif op == "/":
     print (a/b)

Buggy python submission (verdict: Runtime Error):
while True
  a,op,b = raw_input().split
  a,b = map(int,[a,b])

  if op == "?":
     break

  if op == "+":
     print a+b
  if op == "-":
     print a-b
  if op == "*":
     print a*b
  if op == "/":
     print a/b

Fixed submission:
while True:
  a,op,b = raw_input().split()
  a,b = map(int,[a,b])

  if op == "?":
     break

  if op == "+":
     print (a+b)
  elif op == "-":
     print (a-b)
  elif op == "*":
     print (a*b)
  elif op == "/":
     print (a/b)

Buggy python submission (verdict: Runtime Error):
while True
  a,op,b = raw_input().split
  a,b = map(int,[a,b])

  if op == "?":
     break

  if op == "+":
     print a+b
  elif op == "-":
     print a-b
  elif op == "*":
     print a*b
  elif op == "/":
     print a/b

Fixed submission:
while True:
  a,op,b = raw_input().split()
  a,b = map(int,[a,b])

  if op == "?":
     break

  if op == "+":
     print (a+b)
  elif op == "-":
     print (a-b)
  elif op == "*":
     print (a*b)
  elif op == "/":
     print (a/b)

Buggy python submission (verdict: Runtime Error):
while True
  a,op,b = raw_input().split
  a,b = map(int,[a,b])

  if op == "?":
     break

  if op == "+":
     print a+b
  elif op == "-":
     print a-b
  elif op == "*":
     print a*b
  elif op == "/":
     print a/b

Fixed submission:
while True:
  a,op,b = raw_input().split()
  a,b = map(int,[a,b])

  if op == "?":
     break

  if op == "+":
     print (a+b)
  elif op == "-":
     print (a-b)
  elif op == "*":
     print (a*b)
  elif op == "/":
     print (a/b)

Buggy python submission (verdict: Runtime Error):
while True:
  a,op,b = raw_input().split
  a,b = map(int,[a,b])

  if op == "?":
     break

  if op == "+":
     print a+b
  elif op == "-":
     print a-b
  elif op == "*":
     print a*b
  elif op == "/":
     print a/b

Fixed submission:
while True:
  a,op,b = raw_input().split()
  a,b = map(int,[a,b])

  if op == "?":
     break

  if op == "+":
     print (a+b)
  elif op == "-":
     print (a-b)
  elif op == "*":
     print (a*b)
  elif op == "/":
     print (a/b)

Buggy python submission (verdict: Runtime Error):
while True:
  a,op,b = raw_input().split
  a,b = map(int,[a,b])

  if op == "?":
     break

  if op == "+":
     print (a+b)
  elif op == "-":
     print (a-b)
  elif op == "*":
     print (a*b)
  elif op == "/":
     print (a/b)

Fixed submission:
while True:
  a,op,b = raw_input().split()
  a,b = map(int,[a,b])

  if op == "?":
     break

  if op == "+":
     print (a+b)
  elif op == "-":
     print (a-b)
  elif op == "*":
     print (a*b)
  elif op == "/":
     print (a/b)
Buggy python submission (verdict: Runtime Error):
n = raw_input()

for i in range(n):
   x[i] = map(int,raw_input())

amax = x[1]
for i in range(n):
   if x[i] > amax:
      amax = x[i]

amin = x[1]
for i in range(n):
   if x[i] < amax:
      amin = x[i]

asum = 0
for i in range(n):
    asum = asum + x[i]

print "amin amax asum"
   

Fixed submission:
n = raw_input()
a = map(int, raw_input().split())
print ("%d %d %d") % (min(a), max(a), sum(a))

Buggy python submission (verdict: Runtime Error):
n = raw_input()
a = map(int raw_input().split())
print "min(a) max(a) sum(a)"

Fixed submission:
n = raw_input()
a = map(int, raw_input().split())
print ("%d %d %d") % (min(a), max(a), sum(a))

Buggy python submission (verdict: Runtime Error):
n = raw_input()
a = map(int raw_input().split())
print (%d %d %d) % (min(a), max(a), sum(a))

Fixed submission:
n = raw_input()
a = map(int, raw_input().split())
print ("%d %d %d") % (min(a), max(a), sum(a))

Buggy python submission (verdict: Runtime Error):
n = raw_input()
a = map(int raw_input().split())
print ("%d %d %d") % (min(a), max(a), sum(a))

Fixed submission:
n = raw_input()
a = map(int, raw_input().split())
print ("%d %d %d") % (min(a), max(a), sum(a))

Buggy python submission (verdict: Runtime Error):
n = input()
a = map(int raw_input().split())
print ("%d %d %d") % (min(a), max(a), sum(a))

Fixed submission:
n = raw_input()
a = map(int, raw_input().split())
print ("%d %d %d") % (min(a), max(a), sum(a))
Buggy python submission (verdict: Runtime Error):
while True:
   a,b = map(int, raw_input().split())

   if a == 0 && b == 0:
      break
    
   for i in range(a):
      print b*'#'
      

Fixed submission:
while True:
   a,b = map(int, raw_input().split())

   if a + b ==0:
      break
    
   else:
      for i in range(a):
         print b*'#'
      print ""

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

   if a == 0 && b == 0:
      break
    
   else
      for i in range(a):
         print b*'#'
      print ""

Fixed submission:
while True:
   a,b = map(int, raw_input().split())

   if a + b ==0:
      break
    
   else:
      for i in range(a):
         print b*'#'
      print ""

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

   if a + b ==0:
      break
    
   else
      for i in range(a):
         print b*'#'
      print ""

Fixed submission:
while True:
   a,b = map(int, raw_input().split())

   if a + b ==0:
      break
    
   else:
      for i in range(a):
         print b*'#'
      print ""

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

   if a + b ==0:
      break
    
   else
      for i in range(a):
         print b*'#'
      print ""

Fixed submission:
while True:
   a,b = map(int, raw_input().split())

   if a + b ==0:
      break
    
   else:
      for i in range(a):
         print b*'#'
      print ""
Buggy python submission (verdict: Runtime Error):
def BFS(s, r):
    d[s] = r
    for i in range(1, n+1):
        if G[s][i] == 1 and flag[i] == 0:
            BFS(i, r+1)

n = int(raw_input())
G = [[0 for i in range(n+1)] for j in range(n+1)]
d = [-1 for i in range(n+1)]

for i in range(n):
    v = map(int, raw_input().split())
    for j in range(v[1]):
        G[v[0]][v[2+j]] = 1

flag = [0 for i in range(n+1)]
BFS(1, 0)

for i in range(1, n+1):
    print(str(i) + " " + str(d[i]))

Fixed submission:
n = int(raw_input())
G = [[0 for i in range(n+1)] for j in range(n+1)]
d = [-1 for i in range(n+1)]

for i in range(n):
    v = map(int, raw_input().split())
    for j in range(v[1]):
        G[v[0]][v[2+j]] = 1

flag = [0 for i in range(n+1)]
tn = [[0 for i in range(n+1)] for j in range(n+1)]
tn[0][1] = 1
r = 0
for i in range(n):
    for j in range(1, n+1):
        if flag[j] == 0 and tn[i][j] == 1:
            flag[j] = 1
            d[j] = r
            for k in range(1, n+1):
                if G[j][k] == 1:
                    tn[i+1][k] = 1
    r += 1

for i in range(1, n+1):
    print(str(i) + " " + str(d[i]))
Buggy python submission (verdict: Time Limit Exceeded):
def Serch():
    unit = [2001]
    for j in Tree:
        for i in range(1, n):
            G[j][i] = int(G[j][i])
            if G[j][i] != -1 and i not in Tree:
                unit.append(G[j][i])
    for j in Tree:
        for i in range(1, n):
            if G[j][i] == min(unit) and i not in Tree:
                ans.append(int(G[j][i]))
                Tree.append(i)
                Serch()
                break


n = int(input())
G = []
for i in range(n):
    G.append(input().split())

ans = []
Tree = [0]
Serch()
print(sum(ans))

Fixed submission:
n = int(input())
G = []
for i in range(n):
    G.append(input().split())
    for j in range(len(G[i])):
        G[i][j] = int(G[i][j])

ans = 0
mincost = [2001] * n
flag = [0] * n
mincost[0] = 0
while True:
    v = -1
    for j in range(n):
        if flag[j] != 1 and (v == -1 or mincost[j] < mincost[v]):
            v = j
    if v == -1:
        break
    flag[v] = 1
    ans += mincost[v]
    for j in range(n):
        if G[v][j] == -1: continue
        mincost[j] = min(mincost[j], G[v][j])

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
def Serch():
    unit = [2001]
    for j in Tree:
        for i in range(1, n):
            if G[j][i] != -1 and i not in Tree:
                unit.append(G[j][i])
    for j in Tree:
        for i in range(1, n):
            if G[j][i] == min(unit) and i not in Tree:
                ans.append(int(G[j][i]))
                Tree.append(i)
                Serch()
                break


n = int(input())
G = []
for i in range(n):
    G.append(input().split())
    for j in range(len(G[i])):
        G[i][j] = int(G[i][j])

ans = []
Tree = [0]
Serch()
print(sum(ans))

Fixed submission:
n = int(input())
G = []
for i in range(n):
    G.append(input().split())
    for j in range(len(G[i])):
        G[i][j] = int(G[i][j])

ans = 0
mincost = [2001] * n
flag = [0] * n
mincost[0] = 0
while True:
    v = -1
    for j in range(n):
        if flag[j] != 1 and (v == -1 or mincost[j] < mincost[v]):
            v = j
    if v == -1:
        break
    flag[v] = 1
    ans += mincost[v]
    for j in range(n):
        if G[v][j] == -1: continue
        mincost[j] = min(mincost[j], G[v][j])

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
DifMax = -99999999999

R = [int(input())]
for i in range(1, n):
  RMin = min(R)
  R.append(int(input()))
  if DifMax < R[i] - RMin:
    DifMax = R[i] - RMin

print(DifMax)

Fixed submission:
n = int(input())
DifMax = -9999999999999

R = [int(input())]
RMin = R[0]
for i in range(1, n):
  if RMin > R[i-1]:
      RMin = R[i-1]
  R.append(int(input()))
  if DifMax < R[i] - RMin:
    DifMax = R[i] - RMin

print(DifMax)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
DifMax = -999999999

R = [int(input())]
for i in range(1, n):
  RMin = min(R)
  R.append(int(input()))
  if DifMax < R[i] - RMin:
    DifMax = R[i] - RMin

print(DifMax)

Fixed submission:
n = int(input())
DifMax = -9999999999999

R = [int(input())]
RMin = R[0]
for i in range(1, n):
  if RMin > R[i-1]:
      RMin = R[i-1]
  R.append(int(input()))
  if DifMax < R[i] - RMin:
    DifMax = R[i] - RMin

print(DifMax)
Buggy python submission (verdict: Runtime Error):
x = int(row_input())
print(x ** 3)

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

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

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