Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a, b = map(int, raw_input().split())
if   a < b:
    print "a < b"
else if 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):
W, H, x, y, r = map(int, raw_input().split())
if x+r <= W and y+r <= H:
    print"Yes"
else
    print"No"

Fixed submission:
W, H, x, y, r = map(int, raw_input().split())
if x-r<0 or y-r<0:
    print"No"

elif x+r <= W and y+r <= H:
    print"Yes"
else:
    print"No"
Buggy python submission (verdict: Runtime Error):
i = 0
while 1:
   x = raw_input()
   i = i +1
   if x == 0: 
     break
   print ("Case %d: %d") % (i,x)

Fixed submission:
i = 0
while 1:
   x = int(raw_input())
   i = 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 = i +1
   if x == 0: 
     break
   print ("Case %d: %d") % (i,x)

Fixed submission:
i = 0
while 1:
   x = int(raw_input())
   i = 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 = i +1
  
   print ("Case %d: %d") % (i,x)
   if x == 0: 
     break

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

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

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

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

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

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

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

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

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

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

Fixed submission:
i = 0
while 1:
   x = int(raw_input())
   i = 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 = i +1
   if x == '0': 
     break
   print "Case %s: %s" % (i,x)
  

Fixed submission:
i = 0
while 1:
   x = int(raw_input())
   i = 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 = i +1
   if x == '0': 
      break
   print "Case %s: %s" % (i,x)

Fixed submission:
i = 0
while 1:
   x = int(raw_input())
   i = 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 = i +1
   if x == '0': 
      break
   print 'Case %s: %s' % (i, x)

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

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

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

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

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

Fixed submission:
while 1:
   x,y = map(int, raw_input().split())
   if x == 0 and y == 0:
      break
   if y >= x:
      print '%s %s' % (x, y)
   else:
      print '%s %s' % (y, x)
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input_raw().split())
sum = 0
for i in range(a,b)
  if c%i == 0:
     sum = sum + 1
  else:
     sum = sum

print"%s" % (sum)

Fixed submission:
a, b, c = map(int, raw_input().split())
sum = 0

for i in range(a,b+1):
  if c%i == 0:
     sum = sum + 1

print sum

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input_raw().split())
sum = 0

for i in range(a,b):
  if c%i == 0:
     sum = sum + 1
  else:
     sum = sum

print"%s" % (sum)

Fixed submission:
a, b, c = map(int, raw_input().split())
sum = 0

for i in range(a,b+1):
  if c%i == 0:
     sum = sum + 1

print sum

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input_raw().split())
sum = 0

for i in range(a,b):
  if c%i == 0:
     sum = sum + 1
  else:
     sum = sum

print'%s' % (sum)

Fixed submission:
a, b, c = map(int, raw_input().split())
sum = 0

for i in range(a,b+1):
  if c%i == 0:
     sum = sum + 1

print sum

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input_raw().split())
sum = 0

for i in range(a,b+1):
  if c%i == 0:
     sum = sum + 1

print sum

Fixed submission:
a, b, c = map(int, raw_input().split())
sum = 0

for i in range(a,b+1):
  if c%i == 0:
     sum = sum + 1

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

print '%d, %d, %f', d, r, f 

Fixed submission:
a, b = map(int, raw_input().split())
d = a/b
r = a%b
f = float(a)/b

print'%d %d %f' % (d ,r ,f)
Buggy python submission (verdict: Runtime Error):
r = raw_input()

print"math.pi*2*%d math.pi*r**2" % (r)

Fixed submission:
import math
r = float(raw_input())
l = math.pi*2*r
s = math.pi*r**2
print'%f %f' % (s, l)

Buggy python submission (verdict: Runtime Error):
r = raw_input()
l = float(math.pi)*2*r
s =float(math.pi)*r**2 
print'l s' % (r)

Fixed submission:
import math
r = float(raw_input())
l = math.pi*2*r
s = math.pi*r**2
print'%f %f' % (s, l)

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

r = raw_input()
l = float(math.pi)*2*r
s =float(math.pi)*r**2 
print'l s' % (r)

Fixed submission:
import math
r = float(raw_input())
l = math.pi*2*r
s = math.pi*r**2
print'%f %f' % (s, l)

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

r = raw_input()
l = float(math.pi)*2*r
s =float(math.pi)*r**2 
print'l s' % (r)

Fixed submission:
import math
r = float(raw_input())
l = math.pi*2*r
s = math.pi*r**2
print'%f %f' % (s, l)

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

r = raw_input()
l = float(math.pi)*2*r
s =float(math.pi)*r**2 
print'l s' % (r)

Fixed submission:
import math
r = float(raw_input())
l = math.pi*2*r
s = math.pi*r**2
print'%f %f' % (s, l)

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

r = raw_input()
l = math.pi*2*r
s = math.pi*r**2 
print'l s' 

Fixed submission:
import math
r = float(raw_input())
l = math.pi*2*r
s = math.pi*r**2
print'%f %f' % (s, l)

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

r = raw_input()
l = math.pi*2*r
s = math.pi*r**2 
print'%f %f' % (l, s) 

Fixed submission:
import math
r = float(raw_input())
l = math.pi*2*r
s = math.pi*r**2
print'%f %f' % (s, l)

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

r = raw_input()
l = math.pi*2*r
s = math.pi*r**2 
print'%f %f' % (l, s) 

Fixed submission:
import math
r = float(raw_input())
l = math.pi*2*r
s = math.pi*r**2
print'%f %f' % (s, l)

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

r = int(raw_input())
l = math.pi*2*r
s = math.pi*r**2 
print'%f %f' % (s, l) 

Fixed submission:
import math
r = float(raw_input())
l = math.pi*2*r
s = math.pi*r**2
print'%f %f' % (s, l)

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

r = int(raw_input())
l = math.pi*2*r
s = math.pi*r*r 
print'%f %f' % (s, l) 

Fixed submission:
import math
r = float(raw_input())
l = math.pi*2*r
s = math.pi*r**2
print'%f %f' % (s, l)
Buggy python submission (verdict: Runtime Error):
while true:
 
  x = raw_input().split()
  a = int(x[0])
  op = x[1]
  b = int(x[2])
 
  if op == '+':
    print a+b
  elif op == '-':
    print a-b
  elif op == '*':
    print a*b
  elif op == '/':
    print a/b
  elif op == '?':
    break

Fixed submission:
while 1:
 
  x = raw_input().split()
  a = int(x[0])
  op = x[1]
  b = int(x[2])
 
  if op == '+':
    print a+b
  elif op == '-':
    print a-b
  elif op == '*':
    print a*b
  elif op == '/':
    print a/b
  elif op == '?':
    break
Buggy python submission (verdict: Runtime Error):
n = int(raw_input())
k[0] = 0;

for i in range(n-1);
  k[i] = int(raw_input())
  if(k[0]<=k[i]);
    max = k[i]
  elif(k[0]>=k[i]);
    min = k[i]
print max,min

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

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

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

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

Fixed submission:
n = raw_input()
x = map(int, raw_input().split())
print ("%d %d %d") %(min(x), max(x), sum(x))
Buggy python submission (verdict: Runtime Error):
while 1;
 H = input()
 W = input()

  for i in range(H);{
    for k in range(W);{
      print'#'
     }
      print"/n"
  }
  if(H =0 and W =0);
    break

Fixed submission:
while 1:
  H, W = map(int, raw_input().split())
  
  if W == 0 and H == 0:
    break
  
  for i in range(H):
    print "#" * W
  print""

Buggy python submission (verdict: Runtime Error):
while 1;
 H = input()
 W = input()

  for i in range(H);{
    for k in range(W);{
      print'#'
     }
      print"/n"
      if(H =0 and W =0);
        break
  }

Fixed submission:
while 1:
  H, W = map(int, raw_input().split())
  
  if W == 0 and H == 0:
    break
  
  for i in range(H):
    print "#" * W
  print""
Buggy python submission (verdict: Runtime Error):
while 1:
  H, W = map(int, raw_input().split())
  if H == 0 and W == 0:
    break
  for i in range(H):
    print "#" 
    print "." * W-2
    print "#"
  print""

Fixed submission:
while 1:
  H, W = map(int, raw_input().split())
  if (H == 0 and W == 0):
    break
 
  print ('#' * W)
  for i in range(1,H-1):
    print ('#' + '.' * (W - 2) + '#' )
  print ('#'* W)
  print""

Buggy python submission (verdict: Runtime Error):
while 1:
  H, W = map(int, raw_input().split())
  if (H == 0 and W == 0):
    break
 
      print ('#' * W)
      for i in range(H-2):
        print ('#' + '.' * (W - 2) + '#' )
      print ('#'* W)
  print" "
 

Fixed submission:
while 1:
  H, W = map(int, raw_input().split())
  if (H == 0 and W == 0):
    break
 
  print ('#' * W)
  for i in range(1,H-1):
    print ('#' + '.' * (W - 2) + '#' )
  print ('#'* W)
  print""

Buggy python submission (verdict: Runtime Error):
while 1:
  H, W = map(int, raw_input().split())
  if (H == 0 and W == 0):
    break
 
      print ('#' * W)
      for i in range(1,H-1):
        print ('#' + '.' * (W - 2) + '#' )
      print ('#'* W)
  print" "
 

Fixed submission:
while 1:
  H, W = map(int, raw_input().split())
  if (H == 0 and W == 0):
    break
 
  print ('#' * W)
  for i in range(1,H-1):
    print ('#' + '.' * (W - 2) + '#' )
  print ('#'* W)
  print""

Buggy python submission (verdict: Runtime Error):
while 1:
  H, W = map(int, raw_input().split())
  if (H == 0 and W == 0):
    break
 
      print ('#' * W)
      for i in range(1,H-1):
        print ('#' + '.' * (W - 2) + '#' )
      print ('#'* W)
      print" "
 

Fixed submission:
while 1:
  H, W = map(int, raw_input().split())
  if (H == 0 and W == 0):
    break
 
  print ('#' * W)
  for i in range(1,H-1):
    print ('#' + '.' * (W - 2) + '#' )
  print ('#'* W)
  print""
Buggy python submission (verdict: Runtime Error):
while 1:
  H,W = map(raw_input().split())
  if H == 0 and W == 0:
    break

  for i in range(H):
    if i%2 == 0:
      if W%2 == 0:
        print "#."*(W/2)
      else:
        print "#."*(W/2) + "#"
    else:
      if W%2 == 0:
        print ".#"*(W/2)
      else:
        print ".#"*(W/2) + "."
  print ""

Fixed submission:
while 1:
  H,W = map(int,raw_input().split())
  if H == 0 and W == 0:
    break

  for i in range(H):
    if i%2 == 0:
      if W%2 == 0:
        print "#."*(W/2)
      else:
        print "#."*(W/2) + "#"
    else:
      if W%2 == 0:
        print ".#"*(W/2)
      else:
        print ".#"*(W/2) + "."
  print ""
Buggy python submission (verdict: Runtime Error):
n = raw_input()
a = map(int, raw_input().split())
 
for i in range(n):
    print a[-i-1],

Fixed submission:
n =int(raw_input())
a = map(int, raw_input().split())
 
for i in range(n):
    print a[-i-1],
Buggy python submission (verdict: Runtime Error):
MAX = 100
INF = 1000000
WHITE = 0
GRAY = 1
BLACK = 2
n = int(raw_input())

def prim():
    for i in range(n):
        d[i] = INF
        p[i] = -1
        Color[i] = WHITE
    d[0] = 0
    
    while True:
        minv = INF
        u = -1
        for i in range(n):
            if minv > d[i] and Color[i] != BLACK:
                u = i
                minv = d[i]
        if u == -1:
            break
        Color[u] = BLACK
        for v in range(n):
            if Color[v] != BLACK and M[u][v] != INF:
                if d[v] > M[u][v]:
                    d[v] = M[u][v]
                    p[v] = u
                    Color[v] = GRAY
    sum = 0
    for i in range(n):
        if p[i] != -1:
            sum += M[i][p[i]]
    return sum
    
for i in range(n):
    a = map(int, raw_input().split())
    for j in range(n):
        e = a[j]
        if e == -1:
            M[i][j] = INF
        else:
            M[i][j] = e
            
print prim()

Fixed submission:
MAX = 100
INF = 1000000
WHITE = 0
GRAY = 1
BLACK = 2
n = int(raw_input())

M = [[0 for i in range(n)]for j in range(n)]
d = [0 for i in range(MAX)]
p = [0 for i in range(MAX)]
Color = [0 for i in range(MAX)]
for i in range(n):
    a = map(int, raw_input().split())
    for j in range(n):
        e = a[j]
        if e == -1:
            M[i][j] = INF
        else:
            M[i][j] = e

#def prim():
for i in range(n):
    d[i] = INF
    p[i] = -1
    Color[i] = WHITE
d[0] = 0
    
while True:
    minv = INF
    u = -1
    for i in range(n):
        if minv > d[i] and Color[i] != BLACK:
            u = i
            minv = d[i]
    if u == -1:
        break
    Color[u] = BLACK
    for v in range(n):
        if Color[v] != BLACK and M[u][v] != INF:
            if d[v] > M[u][v]:
                d[v] = M[u][v]
                p[v] = u
                Color[v] = GRAY
sum = 0
for i in range(n):
    if p[i] != -1:
        sum += M[i][p[i]]
print sum
Buggy python submission (verdict: Runtime Error):
def gcd(x, y):
    if x < y:
        x = tmp
        x = y
        y = tmp
    while y > 0:
        r = x % y
        x = y
        y = r
    return x

if __name__ == '__main__':
    a, b = [int(x) for x in input().split()]
    print (gcd(a, b))


Fixed submission:
def gcd(x, y):
    if x < y:
        tmp = x
        x = y
        y = tmp
    while y > 0:
        r = x % y
        x = y
        y = r
    return x

if __name__ == '__main__':
    a, b = [int(x) for x in input().split()]
    print (gcd(a, b))

Buggy python submission (verdict: Runtime Error):
def gcd(x, y):
    if x < y:
        x = tmp
        x = y
        y = tmp
    while y > 0:
        r = x % y
        x = y
        y = r
    return x

if __name__ == '__main__':
    a, b = [int(x) for x in input().split()]
    print (gcd(a, b))


Fixed submission:
def gcd(x, y):
    if x < y:
        tmp = x
        x = y
        y = tmp
    while y > 0:
        r = x % y
        x = y
        y = r
    return x

if __name__ == '__main__':
    a, b = [int(x) for x in input().split()]
    print (gcd(a, b))
Buggy python submission (verdict: Time Limit Exceeded):
def hoge(z):
    yuki = 0
    for i in range(2, z):
        if z % i == 0:
            yuki += 1
        if yuki:
            return False
    return True

if __name__ == '__main__':
    n = int(input())
    c = 0
    for _ in range(n):
        if hoge(int(input())):
            c += 1
    print (c)


Fixed submission:
import math

def isprime(z):
    if z == 2:
        return True
    
    if z < 2 or z % 2 == 0:
        return False
    i = 3
    while i <= math.sqrt(z):
        if z % i == 0:
            return False
        i += 2
    return True

if __name__ == '__main__':
    n = int(input())
    c = 0
    for _ in range(n):
        if isprime(int(input())):
            c += 1
    print (c)
Buggy python submission (verdict: Runtime Error):
num = input()
l =[]

for i in range(num):
   l.append(input())

max = l[1] - l[0]
for i in range(num):
   for j in range(num-1):
      if max < l[j] - l[i]
         max = l[j] - l[i]
print max

Fixed submission:
length = int(input())
minv = int(input())
maxv = -2000000000
for j in range(1, length):
    hoge = int(input())
    maxv = max(maxv, hoge-minv)
    minv = min(minv, hoge)
print (maxv)
Buggy python submission (verdict: Time Limit Exceeded):
num, track = [int(x) for x in input().split()]
hoge_l = list()
for _ in range(num):
    hoge_l.append(int(input()))
hoge_i = sum(hoge_l)
if hoge_i % track == 0:
    hoge_i = hoge_i // track
else:
    hoge_i = hoge_i // track + 1

while True:
    tmp = 0
    c = 1
    for v in hoge_l:
        tmp += v
        if tmp > hoge_i:
            c += 1
            tmp = 0
            tmp += v
    if c == track:
        break
    elif c > track:
        hoge_i += 1
max_num = max(hoge_l)
if max_num > hoge_i:
    hoge_i = max_num
print (hoge_i)


Fixed submission:
def imas(hoge_l, p, track):
    s_weights = 0
    now_track = 1
    for val in hoge_l:
        s_weights += val
        if s_weights > p:
            s_weights = val
            now_track += 1
        if now_track > track:
            return False
    return True

num, track = [int(x) for x in input().split()]
hoge_l = list()
for _ in range(num):
    hoge_l.append(int(input()))
left = 0
right = 100000 * 10000

while left < right :
    mid = (right + left) // 2
    if imas(hoge_l, mid, track):
        right = mid 
    else:
        left = mid + 1
        
max_num = max(hoge_l)
if max_num > right:
    right = max_num
print (right)
Buggy python submission (verdict: Runtime Error):
def partition(hoge, p, r):
    x = int(hoge[r-1][1])
    i = p-1
    for j in range(p, len(hoge)):
        if int(hoge[j][1]) <= x:
            i += 1
            tmp = hoge[i]
            hoge[i] = hoge[j]
            hoge[j] = tmp
    return i
    
def qSort(hoge, p, r):
    if p < r:
        q = partition(hoge, p, r)
        qSort(hoge, p, q-1)
        qSort(hoge, q+1, r)
    
def isStable(input_array, output_array):
    N = len(input_array)
    for i in range(1, N-1):
        for j in range(i+1, N):
            for a in range(1, N-1):
                for b in range(a+1, N):
                    if input_array[i][1] == output_array[j][1] and input_array[i] == output_array[b] and input_array[j] == output_array[a]:
                        return 'Not stable'
    return 'Stable'
    
if __name__ == '__main__':
    num = int(input())
    hoge = list()
    for _ in range(num):
        c, s = input().split()
        hoge.append(c+s)
    origin = hoge[:]
    qSort(hoge, 0, len(hoge))
    print(isStable(origin, hoge))
    print('\n'.join(['{0[0]} {0[1]}'.format(x) for x in hoge]))


Fixed submission:
def partition(hoge, p, r):
    x = int(hoge[r][1])
    i = p-1
    for j in range(p, r):
        if int(hoge[j][1]) <= x:
            i += 1
            tmp = hoge[i]
            hoge[i] = hoge[j]
            hoge[j] = tmp
    tmp = hoge[i+1]
    hoge[i+1] = hoge[r]
    hoge[r] = tmp
    return i+1
    
def qSort(hoge, p, r):
    if p < r:
        q = partition(hoge, p, r)
        qSort(hoge, p, q-1)
        qSort(hoge, q+1, r)
    
def isStable(input_array, output_array):
    same_nums = list()
    now_num = 0
    for elem in output_array:
        if now_num != int(elem[1]):
            now_num = int(elem[1])
            same_nums = list()
        else:
            for c in same_nums:
                if input_array.index(c) > input_array.index(elem):
                    return 'Not stable'
        same_nums.append(elem)
    return 'Stable'
    
if __name__ == '__main__':
    num = int(input())
    hoge = list()
    for _ in range(num):
        c, s = input().split()
        hoge.append((c,s))
    origin = hoge[:]
    qSort(hoge, 0, len(hoge)-1)
    print(isStable(origin, hoge))
    print('\n'.join(['{0[0]} {0[1]}'.format(x) for x in hoge]))
Buggy python submission (verdict: Runtime Error):
import math
def hoge(a):
    return a * a
x1, y1, x2, y2 = map(int, input().split())
print (math.sqrt(hoge(math.fabs(x1-x2)) + hoge(math.fabs(y1-y2))))


Fixed submission:
import math
def hoge(a):
    return a * a
x1, y1, x2, y2 = map(float, input().split())
print (math.sqrt(hoge(math.fabs(x1-x2)) + hoge(math.fabs(y1-y2))))

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


Fixed submission:
import math
def hoge(a):
    return a * a
x1, y1, x2, y2 = map(float, input().split())
print (math.sqrt(hoge(math.fabs(x1-x2)) + hoge(math.fabs(y1-y2))))
Buggy python submission (verdict: Runtime Error):
x = raw_input()
y = raw_input()

x = int(x)
y = int(y)

print x * y 2 * x + 2 * y 

Fixed submission:
length = raw_input()
a, b = length.split()

a = int(a)
b = int(b)

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

S = int(S)

m = S / 60
h = m / 60
s = S - 60 * (m + s * 60) 

print h:m:s

Fixed submission:
S = raw_input()
 
S = int(S)
 
h = S / 60 / 60
m = S / 60 % 60
s = S % 60 % 60
 
print "%d:%d:%d" %(h, m, s)
Buggy python submission (verdict: Runtime Error):
a=list()
while True:
  a.append(input())


Fixed submission:
c = 1
while True:
    n = int(input())
    if n == 0:
        break
    print ('Case {}: {}'.format(c, n))
    c += 1

Buggy python submission (verdict: Runtime Error):
a = list()
while True:
    n = input()
    if n == 0:
        break
    a.append(n)
for i in range(len(a)):
    print ('case {}: {}'.format(i, a[i]))


Fixed submission:
c = 1
while True:
    n = int(input())
    if n == 0:
        break
    print ('Case {}: {}'.format(c, n))
    c += 1

Buggy python submission (verdict: Runtime Error):
a = list()
c = 1
while True:
    n = input()
    if n == 0:
        break
    print ('case {}: {}'.format(c, n))
    c += 1


Fixed submission:
c = 1
while True:
    n = int(input())
    if n == 0:
        break
    print ('Case {}: {}'.format(c, n))
    c += 1

Buggy python submission (verdict: Runtime Error):
c = 1
while True:
    n = input()
    if n == 0:
        break
    print ('case {}: {}'.format(c, n))
    c += 1


Fixed submission:
c = 1
while True:
    n = int(input())
    if n == 0:
        break
    print ('Case {}: {}'.format(c, n))
    c += 1
Buggy python submission (verdict: Runtime Error):
import math
x = int(input())
print ('{} {}'.format(math.pi*x*x, 2*math.pi*x))


Fixed submission:
import math
x = float(input())
print ('{} {}'.format(math.pi*x*x, 2*math.pi*x))