Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a = input()
b = input()
s = a * b
print s

Fixed submission:
a , b= map(int,raw_input(). split())
S = a * b
O = 2 * a + 2 * b

print str(S) + ' ' +  str(O)

Buggy python submission (verdict: Runtime Error):
a = raw_input() . split()

print a[0] * a[1]
print 2 * (a[0] + a[1])

Fixed submission:
a , b= map(int,raw_input(). split())
S = a * b
O = 2 * a + 2 * b

print str(S) + ' ' +  str(O)

Buggy python submission (verdict: Runtime Error):
a = raw_input() . split()

S = a[0] * a[1]
O = 2 * (a[0] + a[1])

print S + O

Fixed submission:
a , b= map(int,raw_input(). split())
S = a * b
O = 2 * a + 2 * b

print str(S) + ' ' +  str(O)

Buggy python submission (verdict: Runtime Error):
a = raw_input() . split()

S = a[0] * a[1]
O = 2 * (a[0] + a[1])

print S
print O

Fixed submission:
a , b= map(int,raw_input(). split())
S = a * b
O = 2 * a + 2 * b

print str(S) + ' ' +  str(O)

Buggy python submission (verdict: Runtime Error):
a = raw_input() . split()

S = a[0] * a[1]
O = 2 * (a[0] + a[1])

print S, O

Fixed submission:
a , b= map(int,raw_input(). split())
S = a * b
O = 2 * a + 2 * b

print str(S) + ' ' +  str(O)

Buggy python submission (verdict: Runtime Error):
a = raw_input(). split()
S = a[0] * a[1]
O = 2 * a[0] + 2 * a[1]

print S , O

Fixed submission:
a , b= map(int,raw_input(). split())
S = a * b
O = 2 * a + 2 * b

print str(S) + ' ' +  str(O)

Buggy python submission (verdict: Runtime Error):
a , b= raw_input(). split()
S = a * b
O = 2 * a + 2 * b

print str(S) + ' ' str(O)

Fixed submission:
a , b= map(int,raw_input(). split())
S = a * b
O = 2 * a + 2 * b

print str(S) + ' ' +  str(O)

Buggy python submission (verdict: Runtime Error):
a , b= raw_input(). split()
S = a * b
O = 2 * a + 2 * b

print str(S) + ' ' +  str(O)

Fixed submission:
a , b= map(int,raw_input(). split())
S = a * b
O = 2 * a + 2 * b

print str(S) + ' ' +  str(O)
Buggy python submission (verdict: Runtime Error):
S = raw_input()
s = S % 60
h = (S - S % 3600) / 3600
m = (S - s - h * 3600) / 60

print h + ':' + m + ':' + s

Fixed submission:
S = input()
h = S / 3600
s = S % 60
m = (S - h * 3600 - s) / 60

print "%d:%d:%d" %(h,m,s)

Buggy python submission (verdict: Runtime Error):
S = raw_input()

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

print h + ':' + m + ':' + s

Fixed submission:
S = input()
h = S / 3600
s = S % 60
m = (S - h * 3600 - s) / 60

print "%d:%d:%d" %(h,m,s)

Buggy python submission (verdict: Runtime Error):
S = raw_input()

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

print h + ":" + m + ":" + s

Fixed submission:
S = input()
h = S / 3600
s = S % 60
m = (S - h * 3600 - s) / 60

print "%d:%d:%d" %(h,m,s)

Buggy python submission (verdict: Runtime Error):
S = raw_input()

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

print h + ":" + m + ":" + s

Fixed submission:
S = input()
h = S / 3600
s = S % 60
m = (S - h * 3600 - s) / 60

print "%d:%d:%d" %(h,m,s)

Buggy python submission (verdict: Runtime Error):
S = raw_input()

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

print "%d:%d:%d", (h,m,s)

Fixed submission:
S = input()
h = S / 3600
s = S % 60
m = (S - h * 3600 - s) / 60

print "%d:%d:%d" %(h,m,s)

Buggy python submission (verdict: Runtime Error):
S = raw_input()

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

print "%d:%d:%d" %(h,m,s)

Fixed submission:
S = input()
h = S / 3600
s = S % 60
m = (S - h * 3600 - s) / 60

print "%d:%d:%d" %(h,m,s)

Buggy python submission (verdict: Runtime Error):
S = raw_input()

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

print"%d:%d:%d" %(h,m,s)

Fixed submission:
S = input()
h = S / 3600
s = S % 60
m = (S - h * 3600 - s) / 60

print "%d:%d:%d" %(h,m,s)
Buggy python submission (verdict: Runtime Error):
W, H , x, y, r = map(int, raw_input().split())

if x + r < W and x - r < W and y +r < H and y - r < H
  print "Yes"

else:
  print "No"

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

if (0 <= x + r <= W) and (0 <= x - r <= W) and (0 <= y + r <= H) and (0 <= y - r <= H):
  print "Yes"

else:
  print "No"
Buggy python submission (verdict: Runtime Error):
x = map(int, raw_input().split())

for i in range():
  print "case %d: %d" %(i + 1, x[i])

Fixed submission:
i = 1
while(1):
  x = int(raw_input())

  if x == 0:
    break

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

Buggy python submission (verdict: Runtime Error):
x = map(int, raw_input().split())
i = 1
while(1):
  if x[i] == 0:
    break
  print "Case %d: %d" %(i + 1, x[i])
  i += 1

Fixed submission:
i = 1
while(1):
  x = int(raw_input())

  if x == 0:
    break

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

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

Fixed submission:
i = 1
while(1):
  x = int(raw_input())

  if x == 0:
    break

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

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

Fixed submission:
i = 1
while(1):
  x = int(raw_input())

  if x == 0:
    break

  print "Case %d: %d" %(i,x)
  i += 1
Buggy python submission (verdict: Runtime Error):
while 1:
  x,y = map(int, input().split)
  if x == 0 and y == 0:
    break
  min = min(x,y)
  max = max(x,y)
  print x + y

Fixed submission:
while 1:
  x, y = map(int, raw_input().split())
  if x == 0 and y == 0:
    break
  elif x > y:
    print "%d %d" % (y,x)
  else:
    print "%d %d" % (x,y)

Buggy python submission (verdict: Runtime Error):
while 1:
  x,y = map(int, input().split)
  if x == 0 and y == 0:
    break
  min = min(x,y)
  max = max(x,y)
  print "%d %d", (min,max)

Fixed submission:
while 1:
  x, y = map(int, raw_input().split())
  if x == 0 and y == 0:
    break
  elif x > y:
    print "%d %d" % (y,x)
  else:
    print "%d %d" % (x,y)

Buggy python submission (verdict: Runtime Error):
while 1:
  x, y = map(int,raw_input().split)
  if x == 0 and y == 0:
    break
  min = min(x,y)
  max = max(x,y)
  print "%d %d", (min,max)

Fixed submission:
while 1:
  x, y = map(int, raw_input().split())
  if x == 0 and y == 0:
    break
  elif x > y:
    print "%d %d" % (y,x)
  else:
    print "%d %d" % (x,y)

Buggy python submission (verdict: Runtime Error):
while 1:
  x, y = map(int,raw_input().split)
  if x == 0 and y == 0:
    break
  min = min(x,y)
  max = max(x,y)
  print "%d %d", %(min,max)

Fixed submission:
while 1:
  x, y = map(int, raw_input().split())
  if x == 0 and y == 0:
    break
  elif x > y:
    print "%d %d" % (y,x)
  else:
    print "%d %d" % (x,y)
Buggy python submission (verdict: Runtime Error):
import math

r = float(raw_input())

S = r ** 2 * pi
R = 2 * r * pi

print "%f %f" %(S,R)

Fixed submission:
import math

r = float(raw_input())

S = r ** 2 * math.pi
R = 2 * r * math.pi

print "%f %f" %(S,R)
Buggy python submission (verdict: Runtime Error):
n = input()
N = int(raw_input().split())
sum = 0
for i in range (n):
  sum += N[i]

print "%d %d %d" %(min(N), max(N), sum)
    

Fixed submission:
n = input()
N = map(int,raw_input().split())
sum = 0
for i in range (n):
  sum += N[i]

print "%d %d %d" %(min(N), max(N), sum)

Buggy python submission (verdict: Runtime Error):
n = input()
N = input().split()
sum = 0
for i in range (n):
  sum += N[i]

print "%d %d %d" %(min(N), max(N), sum)
    

Fixed submission:
n = input()
N = map(int,raw_input().split())
sum = 0
for i in range (n):
  sum += N[i]

print "%d %d %d" %(min(N), max(N), sum)
Buggy python submission (verdict: Runtime Error):
while 1:
  h, w = map(int, input().split)
  if h == w == 0:
    break
  for i in  range(h)
    if i == 0 or i == h-1:
      print "#" * w
    else:
      print "#" + "." * (w - 2) + "#"
  print ""

Fixed submission:
while 1:
  h, w = map(int, raw_input().split())
  if h == w == 0:
    break
  for i in  range(h):
    if i == 0 or i == h-1:
      print "#" * w
    else:
      print "#" + "." * (w - 2) + "#"
  print ""

Buggy python submission (verdict: Runtime Error):
while 1:
  h, w = map(int, input().split)
  if h == w == 0:
    break
  for i in  range(h)
    if i == 0 or i == h-1:
      print "#" * w
    else:
      print "#" + "." * (w - 2) + "#"
  print ""

Fixed submission:
while 1:
  h, w = map(int, raw_input().split())
  if h == w == 0:
    break
  for i in  range(h):
    if i == 0 or i == h-1:
      print "#" * w
    else:
      print "#" + "." * (w - 2) + "#"
  print ""

Buggy python submission (verdict: Runtime Error):
while 1:
  h, w = map(int, input().split)
  if h == w == 0:
    break
  for i in  range(h):
    if i == 0 or i == h-1:
      print "#" * w
    else:
      print "#" + "." * (w - 2) + "#"
  print ""

Fixed submission:
while 1:
  h, w = map(int, raw_input().split())
  if h == w == 0:
    break
  for i in  range(h):
    if i == 0 or i == h-1:
      print "#" * w
    else:
      print "#" + "." * (w - 2) + "#"
  print ""

Buggy python submission (verdict: Runtime Error):
while 1:
  h, w = map(int, input().split())
  if h == w == 0:
    break
  for i in  range(h):
    if i == 0 or i == h-1:
      print "#" * w
    else:
      print "#" + "." * (w - 2) + "#"
  print ""

Fixed submission:
while 1:
  h, w = map(int, raw_input().split())
  if h == w == 0:
    break
  for i in  range(h):
    if i == 0 or i == h-1:
      print "#" * w
    else:
      print "#" + "." * (w - 2) + "#"
  print ""

Buggy python submission (verdict: Runtime Error):
while 1:
  h, w = map(int, input().split())
  if h == w == 0:
    break
  for i in  range(h):
    if i == 0 or i == h-1:
      print "#" * w
    else:
      print "#" + "."*(w - 2) + "#"
  print ""

Fixed submission:
while 1:
  h, w = map(int, raw_input().split())
  if h == w == 0:
    break
  for i in  range(h):
    if i == 0 or i == h-1:
      print "#" * w
    else:
      print "#" + "." * (w - 2) + "#"
  print ""
Buggy python submission (verdict: Runtime Error):
check = [#.] * 300
while 1:
  h, w = map(int, raw_input().split())
  if h == w == 0:
    break
  for i in range(h):
    if h % 2 == 0:
      print check[:w]
    else:
      print check[1:w+1]
  print ""
  

Fixed submission:
import sys
while 1:
  H, W = map(int, raw_input().split())
  if H == 0 and W == 0:
    break
  else:
    for h in range(H):
      for w in range(W):
         if (h + w) % 2 == 0:
           sys.stdout.write("#")
         else:
           sys.stdout.write(".")
      print ""
    print ""

Buggy python submission (verdict: Runtime Error):
import sys
while 1:
  H, W = map(int, raw_input().split())
  if H == 0 and W == 0:
    break
  else:
    for h in range(H):
      for w in range(W):
         if (h + w) % 2 == 0:
           sys.stdout.write("#")
         else:
           sys.stdout.write(".")
       print ""
    print ""
 
  

Fixed submission:
import sys
while 1:
  H, W = map(int, raw_input().split())
  if H == 0 and W == 0:
    break
  else:
    for h in range(H):
      for w in range(W):
         if (h + w) % 2 == 0:
           sys.stdout.write("#")
         else:
           sys.stdout.write(".")
      print ""
    print ""
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[i-1], p[i] = map(int, raw_input().split())
     
for l in range(2, n + 1):
    for i in range(1, n - l + 2):
        j = i + l - 1
        m[i][j] = float("inf")
        for k in range(i, j):
            m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1]* p[k] * 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 l in range(2, n + 1):
    for i in range(1, n - l + 2):
        j = i + l - 1
        m[i][j] = float("inf")
        for k in range(i, j):
            m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1]* p[k] * 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[i-1], p[i] = map(int, raw_input().split())
     
for l in range(2, n + 1):
    for i in range(1, n - l + 2):
        j = i + l - 1
        m[i][j] = float("inf")
        for k in range(i, j):
            m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1]* p[k] * 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 l in range(2, n + 1):
    for i in range(1, n - l + 2):
        j = i + l - 1
        m[i][j] = float("inf")
        for k in range(i, j):
            m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1]* p[k] * 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[i-1], p[i] = map(int, raw_input().split())
     
for l in range(2, n + 1):
    for i in range(1, n - l + 2):
        j = i + l - 1
        m[i][j] = float("inf")
        for k in range(i, j):
            m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1]* p[k] * 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 l in range(2, n + 1):
    for i in range(1, n - l + 2):
        j = i + l - 1
        m[i][j] = float("inf")
        for k in range(i, j):
            m[i][j] = min(m[i][j], m[i][k] + m[k+1][j] + p[i-1]* p[k] * p[j])
 
print m[1][n]
Buggy python submission (verdict: Runtime Error):
 solve():
    seq1 = raw_input()
    seq2 = raw_input()
 
    x, y = len(seq1), len(seq2)
    a1 = [0 for i in range(y+1)]
    for i in range(x):
        e1 = seq1[i]
        a2 = a1+[]
        for j in range(y):
            if e1 == seq2[j]:
                a1[j+1] = a2[j] + 1
            elif a1[j+1] < a1[j]:
                a1[j+1] = a1[j]
    return a1[-1]
 
n = input()
for i2 in range(n):
    print solve()

Fixed submission:
def solve():
    seq1 = raw_input()
    seq2 = raw_input()
 
    x, y = len(seq1), len(seq2)
    a1 = [0 for i in range(y+1)]
    for i in range(x):
        e1 = seq1[i]
        a2 = a1+[]
        for j in range(y):
            if e1 == seq2[j]:
                a1[j+1] = a2[j] + 1
            elif a1[j+1] < a1[j]:
                a1[j+1] = a1[j]
    return a1[-1]
 
n = input()
for i2 in range(n):
    print solve()

Buggy python submission (verdict: Runtime Error):
def solve():
    seq1 = raw_input()
    seq2 = raw_input()
 
    x, y = len(seq1), len(seq2)
    a1 = [0 for i in range(y+1)]
    for i in range(x):
        e1 = seq1[i]
        a2 = a1+[]
        for j in range(y):
            if e1 == seq2[j]:
                a1[j+1] = a2[j] + 1
            elif a1[j+1] < a1[j]:
                a1[j+1] = a1[j]
    return a1[-1]
 
n = imput()
for i2 in range(n):
    print solve()

Fixed submission:
def solve():
    seq1 = raw_input()
    seq2 = raw_input()
 
    x, y = len(seq1), len(seq2)
    a1 = [0 for i in range(y+1)]
    for i in range(x):
        e1 = seq1[i]
        a2 = a1+[]
        for j in range(y):
            if e1 == seq2[j]:
                a1[j+1] = a2[j] + 1
            elif a1[j+1] < a1[j]:
                a1[j+1] = a1[j]
    return a1[-1]
 
n = input()
for i2 in range(n):
    print solve()

Buggy python submission (verdict: Runtime Error):
def solve():
    seq1 = raw_input()
    seq2 = raw_input()
 
    x, y = len(seq1), len(seq2)
    a1 = [0 for i in range(y+1)]
    for i in range(x):
        e1 = seq1[i]
        a2 = a1+[]
        for j in range(y):
            if e1 == seq2[j]:
                a1[j+1] = a2[j] + 1
            elif a1[j+1] < a1[j]:
                a1[j+1] = a1[j]
    return a1[-1]
 
n = imput()
for i2 in range(n):
    print solve()

Fixed submission:
def solve():
    seq1 = raw_input()
    seq2 = raw_input()
 
    x, y = len(seq1), len(seq2)
    a1 = [0 for i in range(y+1)]
    for i in range(x):
        e1 = seq1[i]
        a2 = a1+[]
        for j in range(y):
            if e1 == seq2[j]:
                a1[j+1] = a2[j] + 1
            elif a1[j+1] < a1[j]:
                a1[j+1] = a1[j]
    return a1[-1]
 
n = input()
for i2 in range(n):
    print solve()
Buggy python submission (verdict: Runtime Error):


n = int(raw_input())
  
d = [99999 for i in range(n)]
G = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
  
def BFS(s):
    for e in range(n):
        if M[s][e] == 1:
            if d[e] > d[s] + 1:
                d[e] = d[s]+1
                BFS(e)
  
for i in range(n):
    G = map(int, raw_input().split())
    for j in range(G[1]):
        M[G[0]-1][G[2+j]-1] = 1
  
d[0] = 0
for s in range(n):
        BFS(s)
for s in range(n):
    if d[s] == 99999:
        d[s] = -1
for s in range(n):
    print'{0} {1}'.format(s+1, d[s])
 

 
Compile Error Logs: 

You are not authorized to see the message. 
 
 

Fixed submission:


n = int(raw_input())
  
d = [99999 for i in range(n)]
G = [0 for i in range(n)]
M = [[0 for i in range(n)] for j in range(n)]
  
def BFS(s):
    for e in range(n):
        if M[s][e] == 1:
            if d[e] > d[s] + 1:
                d[e] = d[s]+1
                BFS(e)
  
for i in range(n):
    G = map(int, raw_input().split())
    for j in range(G[1]):
        M[G[0]-1][G[2+j]-1] = 1
  
d[0] = 0
for s in range(n):
        BFS(s)
for s in range(n):
    if d[s] == 99999:
        d[s] = -1
for s in range(n):
    print'{0} {1}'.format(s+1, d[s])
Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
 
p1_x = float(0)
p1_y = float(0)
p2_x = float(100)
p2_y = float(0)
 
def KC(i, n, x1, y1, x2, y2):
    v = [0]*5
    w = [0]*5
    if i < n:
        v[0] = x1
        w[0] = y1
        v[1] = (2*x1+x2)/3.0
        w[1] = (2*y1+y2)/3.0
        v[2] = (x1+2*x2)/3.0
        w[2] = (y1+2*y2)/3.0
        v[3] = (v[2] - v[1])*math.cos(math.pi/3) - (w[2] - w[1])*math.sin(math.pi/3) + v[1]
        w[3] = (w[2] - w[1])*math.cos(math.pi/3) + (v[2] - v[1])*math.sin(math.pi/3) + w[1]
        v[3] = x2
        w[3] = y2
        KC(i+1, n, v[0], w[0], v[1], w[1])
        print v[1], w[1]
        KC(i+1, n, v[1], w[1], v[3], w[3])
        print v[3], w[3]
        KC(i+1, n, v[3], w[3], v[2], w[2])
        print v[2], w[2]
        KC(i+1, n, v[2], w[2], v[4], w[4])
 
print p1_x, p1_y
KC(0, n, p1_x, p1_y, p2_x, p2_y)
print p2_x, p2_y

Fixed submission:
import math
n = int(raw_input())
 
p1_x = float(0)
p1_y = float(0)
p2_x = float(100)
p2_y = float(0)
 
def KC(i, n, x1, y1, x2, y2):
    v = [0] * 5
    w = [0] * 5
    if i < n:
        v[0] = x1
        w[0] = y1
        v[1] = (2 * x1 + x2) / 3.0
        w[1] = (2 * y1 + y2) / 3.0
        v[2] = (x1 + 2 * x2) / 3.0
        w[2] = (y1 + 2 * y2) / 3.0
        v[3] = (v[2] - v[1]) * math.cos(math.pi/3) - (w[2] - w[1]) * math.sin(math.pi/3) + v[1]
        w[3] = (w[2] - w[1]) * math.cos(math.pi/3) + (v[2] - v[1]) * math.sin(math.pi/3) + w[1]
        v[4] = x2
        w[4] = y2
        KC(i+1, n, v[0], w[0], v[1], w[1])
        print v[1], w[1]
        KC(i+1, n, v[1], w[1], v[3], w[3])
        print v[3], w[3]
        KC(i+1, n, v[3], w[3], v[2], w[2])
        print v[2], w[2]
        KC(i+1, n, v[2], w[2], v[4], w[4])
 
print p1_x, p1_y
KC(0, n, p1_x, p1_y, p2_x, p2_y)
print p2_x, p2_y
Buggy python submission (verdict: Runtime Error):
def sanjou(x):
 reeturn x * x * x

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

Fixed submission:

l = map(int, raw_input().split())
 
print "%d %d" % (l[0]*l[1], (l[0]+l[1])*2)

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

Fixed submission:

l = map(int, raw_input().split())
 
print "%d %d" % (l[0]*l[1], (l[0]+l[1])*2)

Buggy python submission (verdict: Runtime Error):
a b = input()

print a * b
print a * 2 + b * 2

Fixed submission:

l = map(int, raw_input().split())
 
print "%d %d" % (l[0]*l[1], (l[0]+l[1])*2)

Buggy python submission (verdict: Runtime Error):
def suuji(a,b):

print a * b
print a * 2 + b * 2

Fixed submission:

l = map(int, raw_input().split())
 
print "%d %d" % (l[0]*l[1], (l[0]+l[1])*2)

Buggy python submission (verdict: Runtime Error):
def suuji(a,b):

print a * b ,
print a * 2 + b * 2

Fixed submission:

l = map(int, raw_input().split())
 
print "%d %d" % (l[0]*l[1], (l[0]+l[1])*2)

Buggy python submission (verdict: Runtime Error):
a = input() ,
b = input()

print a * b ,
print a * 2 + b * 2

Fixed submission:

l = map(int, raw_input().split())
 
print "%d %d" % (l[0]*l[1], (l[0]+l[1])*2)

Buggy python submission (verdict: Runtime Error):
a,b= input() , input()
 

print a * b ,
print a * 2 + b * 2

Fixed submission:

l = map(int, raw_input().split())
 
print "%d %d" % (l[0]*l[1], (l[0]+l[1])*2)

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

print a * b ,
print a * 2 + b * 2

Fixed submission:

l = map(int, raw_input().split())
 
print "%d %d" % (l[0]*l[1], (l[0]+l[1])*2)

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

print a * b , a * 2 + b * 2

Fixed submission:

l = map(int, raw_input().split())
 
print "%d %d" % (l[0]*l[1], (l[0]+l[1])*2)
Buggy python submission (verdict: Runtime Error):
a, b = map(int, raw_imput(), split())

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"
elif a == b:
 print "a == b"

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

if a < b:
 print "a < b" 
elif a == b:
 print "a == b"
elif 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"
elif a == b:
 print "a == b"

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

if a < b:
 print 'a < b' 
elif a == b:
 print 'a == b'
elif 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"
elif a == b:
 print "a == b"

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

if a < b:
 print 'a < b' 
elif a == b:
 print 'a == b'
elif 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"
elif a == b:
 print "a == b"

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

 if a < b:
  print 'a < b' 
 elif a == b:
  print 'a == b'
 elif 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"
elif a == b:
 print "a == b"

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

 if a < b:
  print 'a < b' 
 elif a > b:
  print 'a > b'
 elif 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"
elif a == b:
 print "a == b"

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

 if a < b:
  print 'a < b' 
 elif a > b:
  print 'a > b'
 elif 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"
elif a == b:
 print "a == b"

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

 if a < b:
  print 'a < b' 
 elif a > b:
  print 'a > b'
 elif 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"
elif a == b:
 print "a == b"