Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
def IsPrime(n):
    '''

    :param n:??£??´??°
    :return: ?´???°?????????True, ????????????????????°?????????False
    ???????????§???????´???°??? 6k-1????????? 6k+1??§??¨?????????????????????k?????£??´??°
    '''
    if n == 2 or n == 3 or n== 5: return True
    if n == 1 or n%2 == 0 or n%3 == 0:return False
    d, l = 5, int(n**(1/2))
    while d <= l:
        if n%d == 0 or n%(d+2):return False
    return True
c = 0
for i in range(int(input())):
    if IsPrime(int(input())): c += 1
print(c)

Fixed submission:
def IsPrime(n):
    '''

    :param n:??£??´??°
    :return: ?´???°?????????True, ????????????????????°?????????False
    ???????????§???????´???°??? 6k-1????????? 6k+1??§??¨?????????????????????k?????£??´??°
    '''
    if n == 2 or n == 3 or n== 5: return True
    if n == 1 or n%2 == 0 or n%3 == 0:return False
    d, l = 5, int(n**(1/2))
    while d <= l:
        if n%d == 0 or n%(d+2) == 0:return False
        d += 6
    return True
c = 0
for i in range(int(input())):
    if IsPrime(int(input())): c += 1
print(c)
Buggy python submission (verdict: Runtime Error):
def bubblesort(N, A):
    c, flag = 0, 1
    while flag:
        flag = False
        for j in range(N-1, 0, -1):
            if A[j] < A[j-1]:
                A[j], A[j-1] = A[j- 1], A[j]
                c += 1
                flag = True
    return (A, c)

A, c = bubblesort(int(input()), list(map(int, input().split())))
print(A)
print(c)

Fixed submission:
def bubblesort(N, A):
    c, flag = 0, 1
    while flag:
        flag = False
        for j in range(N-1, 0, -1):
            if A[j] < A[j-1]:
                A[j], A[j-1] = A[j- 1], A[j]
                c += 1
                flag = True
    return (A, c)

A, c = bubblesort(int(input()), list(map(int, input().split())))
print(' '.join([str(v) for v in A]))
print(c)
Buggy python submission (verdict: Runtime Error):
ef ALDS1_3B():
    n, q = map(int, input().split())
    PQ = [[l[0], int(l[1])] for l in  [input().split() for i in range(n)]  ]
    times = 0
    while PQ:
        p = PQ.pop(0)
        if p[1] <= q:
            times += p[1]
            print('%s %d' %(p[0], times))
        else:
            times += q
            PQ.append([p[0], p[1]-q])


if __name__ == '__main__':
    ALDS1_3B()

Fixed submission:
def ALDS1_3B():
    n, q = map(int, input().split())
    PQ = [[l[0], int(l[1])] for l in  [input().split() for i in range(n)]  ]
    times = 0
    while PQ:
        p = PQ.pop(0)
        if p[1] <= q:
            times += p[1]
            print('%s %d' %(p[0], times))
        else:
            times += q
            PQ.append([p[0], p[1]-q])


if __name__ == '__main__':
    ALDS1_3B()

Buggy python submission (verdict: Runtime Error):
ef ALDS1_3B():
    n, q = map(int, input().split())
    PQ = [[l[0], int(l[1])] for l in  [input().split() for i in range(n)]  ]
    times = 0
    while PQ:
        p = PQ.pop(0)
        if p[1] <= q:
            times += p[1]
            print('%s %d' %(p[0], times))
        else:
            times += q
            PQ.append([p[0], p[1]-q])


if __name__ == '__main__':
    ALDS1_3B()

Fixed submission:
def ALDS1_3B():
    n, q = map(int, input().split())
    PQ = [[l[0], int(l[1])] for l in  [input().split() for i in range(n)]  ]
    times = 0
    while PQ:
        p = PQ.pop(0)
        if p[1] <= q:
            times += p[1]
            print('%s %d' %(p[0], times))
        else:
            times += q
            PQ.append([p[0], p[1]-q])


if __name__ == '__main__':
    ALDS1_3B()
Buggy python submission (verdict: Time Limit Exceeded):
class DoublyLinkedKist:
    DLlist = []

    def command(self, cmd):
        if cmd[0] == 'insert':
            self.DLlist[:0] = [cmd[1]]
        elif cmd[0] == 'delete':
            if cmd[1] in self.DLlist:
                self.DLlist.remove(cmd[1])
        elif cmd[0] == 'deleteFirst':
            self.DLlist.pop(0)
        elif cmd[0] == 'deleteLast':
            self.DLlist.pop()

if __name__ == '__main__':
    DL = DoublyLinkedKist()
    for i in range(int(input())):
        DL.command(input().split())
    print(*DL.DLlist)

Fixed submission:
from collections import deque
class DoublyLinkedKist:
    DLlist = deque()

    def command(self, cmd):
        if cmd[0] == 'insert':
            self.DLlist.appendleft(cmd[1])
        elif cmd[0] == 'delete':
            if cmd[1] in self.DLlist:
                self.DLlist.remove(cmd[1])
        elif cmd[0] == 'deleteFirst':
            self.DLlist.popleft()
        elif cmd[0] == 'deleteLast':
            self.DLlist.pop()

if __name__ == '__main__':
    DL = DoublyLinkedKist()
    for i in range(int(input())):
        DL.command(input().split())
    print(*DL.DLlist)
Buggy python submission (verdict: Time Limit Exceeded):
def binarySearch(e, n, A):
    if e<A[0] or e>A[-1]:
        return False
    l, r = 0, n
    while l<=r:
        m = (r+l)//2
        if e == A[m]:
            return True
        elif e < A[m]:
            r = m
        else:
            l = m
    return False


def ALDS1_4B():
    n, S = int(input()), list(map(int, input().split()))
    q, T = int(input()), list(map(int, input().split()))
    print(sum([1 for e in T if binarySearch(e, n, S)]))


if __name__ == '__main__':
    ALDS1_4B()

Fixed submission:
def binarySearch(e, n, A):
    if e<A[0] or e>A[-1]:
        return False
    l, r = 0, n
    while l<=r:
        m = (r+l)//2
        if m == r or m == l:
            return False
        if e == A[m]:
            return True
        elif e < A[m]:
            r = m
        else:
            l = m
    return False


def ALDS1_4B():
    n, S = int(input()), list(map(int, input().split()))
    q, T = int(input()), list(map(int, input().split()))
    print(sum([1 for e in T if binarySearch(e, n, S)]))


if __name__ == '__main__':
    ALDS1_4B()
Buggy python submission (verdict: Time Limit Exceeded):
def check(A, n,  mi):
    i, E, s = 0, [0 for i in range(n)], 0
    while i < n:
        if s == mi: return True
        if E[i] == 0:
            s += A[i]
            E[i] = 1
            i = 0
        else:
            E[i] = 0
            s -= A[i]
            i += 1
    return False

def ALDS1_5A():
    n, A, q = int(input()),list(map(int, input().split())), int(input())
    for m in input().split():
        if check(A, n, int(m)):
            print('yes')
        else:
            print('no')

if __name__ == '__main__':
    ALDS1_5A()

Fixed submission:
def ALDS1_5A():
    n, A, q = int(input()), list(map(int, input().split())), int(input())
    S=[False for i in range(2001)]
    for a in A:
        for i in range(2001-a, 0, -1):
            if S[i]: S[i+a] = True
        S[a] = True
    for mi in input().split():
        if S[int(mi)]:
            print('yes')
        else:
            print('no')

if __name__ == '__main__':
    ALDS1_5A()

Buggy python submission (verdict: Time Limit Exceeded):
def CanItBeCreated(A, n, i, m):
    if m == 0:return True
    if i >= n:return False
    res = CanItBeCreated(A, n, i+1, m) or CanItBeCreated(A, n, i+1, m-A[i])
    return res

def ALDS1_5A():
    n, A, q = int(input()), list(map(int, input().split())), int(input())
    for Mj in input().split():
        if CanItBeCreated(A, n, 0, int(Mj)):
            print('yes')
        else:
            print('no')
if __name__ == '__main__':
    ALDS1_5A()

Fixed submission:
def ALDS1_5A():
    n, A, q = int(input()), list(map(int, input().split())), int(input())
    S=[False for i in range(2001)]
    for a in A:
        for i in range(2001-a, 0, -1):
            if S[i]: S[i+a] = True
        S[a] = True
    for mi in input().split():
        if S[int(mi)]:
            print('yes')
        else:
            print('no')

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

Fixed submission:
import math
x1, y1, x2, y2 = map(float, input().split())
print('%f' %(math.sqrt((x1-x2)**2 + (y1-y2)**2)))
Buggy python submission (verdict: Runtime Error):
class Dice2(Dice1):

    def __init__(self, v): # v [Top, Front, Right, Left, Back, Bottom ]
        super().__init__(v)

        self.dTFR = {}
        for i, j, k in ((ii, (ii++2)%6, (ii+4)%6) for ii in  range(6)):
            self.dTFR[self.view[i]]=[self.view[v] for v in (j, k, 5-j, 5-k, j)]


d2, q = Dice2(list(map(int, input().split()))), int(input())
for i in range(q):
    t, f = map(int, input().split())
    print(d2.dTFR[t][d2.dTFR[t].index(f)+1] )

Fixed submission:
class Dice2():

    def __init__(self, v): # v [Top, Front, Right, Left, Back, Bottom ]
        self.view = v
        self.dTFR = {}
        for i, j, k in ((ii, (ii++2)%6, (ii+4)%6) for ii in  range(6)):
            self.dTFR[self.view[i]]=[self.view[v] for v in (j, k, 5-j, 5-k, j)]


d2, q = Dice2(list(map(int, input().split()))), int(input())
for i in range(q):
    t, f = map(int, input().split())
    print(d2.dTFR[t][d2.dTFR[t].index(f)+1] )

Buggy python submission (verdict: Runtime Error):
class Dice2(Dice1):

    def __init__(self, v): # v [Top, Front, Right, Left, Back, Bottom ]
        super().__init__(v)

        self.dTFR = {}
        for i, j, k in ((ii, (ii++2)%6, (ii+4)%6) for ii in  range(6)):
            self.dTFR[self.view[i]]=[self.view[v] for v in (j, k, 5-j, 5-k, j)]


d2, q = Dice2(list(map(int, input().split()))), int(input())
for i in range(q):
    t, f = map(int, input().split())
    print(d2.dTFR[t][d2.dTFR[t].index(f)+1] )

Fixed submission:
class Dice2():

    def __init__(self, v): # v [Top, Front, Right, Left, Back, Bottom ]
        self.view = v
        self.dTFR = {}
        for i, j, k in ((ii, (ii++2)%6, (ii+4)%6) for ii in  range(6)):
            self.dTFR[self.view[i]]=[self.view[v] for v in (j, k, 5-j, 5-k, j)]


d2, q = Dice2(list(map(int, input().split()))), int(input())
for i in range(q):
    t, f = map(int, input().split())
    print(d2.dTFR[t][d2.dTFR[t].index(f)+1] )
Buggy python submission (verdict: Runtime Error):
for i, x in enumerate((input()).strip()):
    x = int(input())
    if x == '0':
        break
    print('case ' + str(i) + ': ' + x)

Fixed submission:
import sys
for i, x in enumerate(sys.stdin):
    x = x.strip()
    if x == '0':
        break
    print('Case %d: %s'%(i+1, x))
Buggy python submission (verdict: Runtime Error):
import sys
for xy in sys.stdin:
    x, y  = xy.split()
    i   if x == '0' and y == '0':
        break
    elif int(x) > int(y):
        x, y = y, x
    print('%s %s'%(x, y))

Fixed submission:
import sys
for xy in sys.stdin:
    x, y  = xy.split()
    if x == '0' and y == '0':
        break
    elif int(x) > int(y):
        x, y = y, x
    print('%s %s'%(x, y))
Buggy python submission (verdict: Runtime Error):
hile True:
    H, W = map(int, input().split())
    if H == 0  and W == 0:
        break
    print(('#' * W +'\n') * H + '\n')

Fixed submission:
while True:
    H, W = map(int, input().split())
    if H == 0  and W == 0:
        break
    w = '#'*W
    for i in range(H):
        print(w)
    print()
Buggy python submission (verdict: Time Limit Exceeded):
(n, x) = map(int, input().split())
while True:
    if n == 0 and x == 0:
        break
    c = 0
    for i in range(1,n-1):
        for j in range(i,n):
            for k in range(j, n+1):
                s = i + j + k
                if s == x:
                    c += 1
                if s > x:
                    break
            if s > x:
                break
        if s > x:
            break
    print(c)

Fixed submission:
while True:
    (n, x) = map(int, input().split())
    if n == 0 and x == 0:
        break
    c = 0
    for i in range(1,n - 1):
        xi = x - i
        for j in range(i+1,n):
            if xi - j - j <= 0:
                break
            if xi - j <= n:
                c += 1
    print(c)
Buggy python submission (verdict: Runtime Error):
for c in input():
    if c.islower():
        s += c.upper()
    elif c.isupper():
        s += c.lower()
    else:
        s += c
print (s)

Fixed submission:
print(input().swapcase())

Buggy python submission (verdict: Runtime Error):
for c in input():
    if c.islower():
        s += c.upper()
    elif c.isupper():
        s += c.lower()
    else:
        s += c
print (s)

Fixed submission:
print(input().swapcase())
Buggy python submission (verdict: Runtime Error):
W = input()
print(((sys.stdin.read()).lower()).count(W))

Fixed submission:
W, c = input(), 0
for line in iter(input, 'END_OF_TEXT'):
    for Ti in  line.lower().split():
        if W == Ti:
            c +=1
print(c)
Buggy python submission (verdict: Runtime Error):
kazu=input()
A=[int(i) for i in range(kazu)]
# kazu=6
# A=[5,2,4,6,1,3]

j=0
for i in range(kazu - 1):
    print(A[i], end=" ")
print(A[kazu-1])

for i in range(1,kazu):
    v=A[i]
    j=i-1

    while j>=0 and A[j] >v:
        A[j+1]=A[j]
        j =j -1
        A[j+1]=v
    for i in range(kazu-1):
        print(A[i],end=" ")
    print(A[kazu-1])

Fixed submission:
kazu=int(input())
A=[int(i) for i in input().split()]
# kazu=6
# A=[5,2,4,6,1,3]

j=0
for i in range(kazu - 1):
    print(A[i], end=" ")
print(A[kazu-1])

for i in range(1,kazu):
    v=A[i]
    j=i-1

    while j>=0 and A[j] >v:
        A[j+1]=A[j]
        j =j -1
        A[j+1]=v
    for i in range(kazu-1):
        print(A[i],end=" ")
    print(A[kazu-1])

Buggy python submission (verdict: Runtime Error):
kazu=int(input())
A=[int(i) for i in input().spllit()]
# kazu=6
# A=[5,2,4,6,1,3]

j=0
for i in range(kazu - 1):
    print(A[i], end=" ")
print(A[kazu-1])

for i in range(1,kazu):
    v=A[i]
    j=i-1

    while j>=0 and A[j] >v:
        A[j+1]=A[j]
        j =j -1
        A[j+1]=v
    for i in range(kazu-1):
        print(A[i],end=" ")
    print(A[kazu-1])

Fixed submission:
kazu=int(input())
A=[int(i) for i in input().split()]
# kazu=6
# A=[5,2,4,6,1,3]

j=0
for i in range(kazu - 1):
    print(A[i], end=" ")
print(A[kazu-1])

for i in range(1,kazu):
    v=A[i]
    j=i-1

    while j>=0 and A[j] >v:
        A[j+1]=A[j]
        j =j -1
        A[j+1]=v
    for i in range(kazu-1):
        print(A[i],end=" ")
    print(A[kazu-1])
Buggy python submission (verdict: Runtime Error):
a=int(input().split())
print(a[0]*a[1],(a[0]+a[1])*2)

Fixed submission:
x,y=[int(i) for i in input().split()]
print(x*y,(x+y)*2)

Buggy python submission (verdict: Runtime Error):

a=input().split()

b=a[0]*a[1]
c=(a[0]+a[1])*2
print(b,c)

Fixed submission:
x,y=[int(i) for i in input().split()]
print(x*y,(x+y)*2)

Buggy python submission (verdict: Runtime Error):
x,y=[int(i) for i in input(num).split()]
print(x*y,(x+y)*2)

Fixed submission:
x,y=[int(i) for i in input().split()]
print(x*y,(x+y)*2)
Buggy python submission (verdict: Runtime Error):
num=int(input().split())
if num[0]>num[1]:
    print("a>b")
elif num[0]==num[1]:
    print("a==b")
else:
    print("a<b")

Fixed submission:
num=[int(i) for i in input().split()]
if num[0]>num[1]:
    print("a > b")
elif num[0]==num[1]:
    print("a == b")
else:
    print("a < b")
Buggy python submission (verdict: Runtime Error):
num=[int(i) for i in input().split()]
for i in range(len(num)):
    for j in range(i+1,len(num)+1):
        if num[i]>num[j]:
            bigger = num[i]
            num[i]=num[j]
            num[j]=bigger
for i in range(len(num)):
    print(num[i],end="")

Fixed submission:
num=[int(i) for i in input().split()]
for i in range(len(num)):
    for j in range(i+1,len(num)):
        if num[i]>num[j]:
            bigger = num[i]
            num[i]=num[j]
            num[j]=bigger
for i in range(len(num)-1):
    print(num[i],end=" ")
print(num[len(num)-1])
Buggy python submission (verdict: Runtime Error):
W=int(input())
H=int(input())
x=int(input())
y=int(input())
r=int(input())

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

Fixed submission:
W,H,x,y,r=[int(i) for i in input().split()]
if x-r>=0 and y-r>=0 and x+r<=W and y+r<=H:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
flag=0
i=0
while flag==0:
    num=input()
    if num==0 or num=="":
        flag=1
    else:
        print("Case {0}: {1}".format(i + 1, num))
        i = i + 1
        num = int(input())

Fixed submission:
flag=0
i=0
while flag==0:
    num=int(input())
    if num==0:
        flag=1
    else:
        print("Case {0}: {1}".format(i + 1, num))
        i = i + 1
Buggy python submission (verdict: Runtime Error):
import math
# a,b =[int(i) for i in input().split()]

r=int(input())
#r=2

A=[math.pi*r**2,2*math.pi*r]
print("{0:.6f} {1:.6f}".format(A[0],A[1]))

Fixed submission:
#import math
# a,b =[int(i) for i in input().split()]

r=float(input())
#r=2
pi=3.141592653589793
A=[pi*r**2,2*pi*r]
print("{0:.5f} {1:.5f}".format(A[0],A[1]))

Buggy python submission (verdict: Runtime Error):
#import math
# a,b =[int(i) for i in input().split()]

r=int(input())
#r=2
pi=3.1415926535
A=[pi*r**2,2*pi*r]
print("{0:.6f} {1:.6f}".format(A[0],A[1]))

Fixed submission:
#import math
# a,b =[int(i) for i in input().split()]

r=float(input())
#r=2
pi=3.141592653589793
A=[pi*r**2,2*pi*r]
print("{0:.5f} {1:.5f}".format(A[0],A[1]))

Buggy python submission (verdict: Runtime Error):
#import math
# a,b =[int(i) for i in input().split()]

r=int(input())
#r=2
pi=3.141592653589793
A=[pi*r**2,2*pi*r]
print("{0:.5f} {1:.5f}".format(A[0],A[1]))

Fixed submission:
#import math
# a,b =[int(i) for i in input().split()]

r=float(input())
#r=2
pi=3.141592653589793
A=[pi*r**2,2*pi*r]
print("{0:.5f} {1:.5f}".format(A[0],A[1]))
Buggy python submission (verdict: Runtime Error):

flag =0
while flag==0:
    a,b,c=[ i for i in input().split()])
    if b=="?":
        flag=1
        break
    elif b=="+":
        n=int(a)+int(c)
    elif b=="-":
        n=int(a)-int(c)
    elif b=="*":
        n=int(a)*int(c)
    elif b=="/":
        n=int(a)/int(c)
    print(int(b)

Fixed submission:
flag =0
while flag==0:
    a,b,c=[ i for i in input().split()]
    if b=="?":
        flag=1
        break
    elif b=="+":
        n=int(a)+int(c)
    elif b=="-":
        n=int(a)-int(c)
    elif b=="*":
        n=int(a)*int(c)
    elif b=="/":
        n=int(a)/int(c)
    print(int(n))
Buggy python submission (verdict: Runtime Error):
flag =0
while flag==0:
    a,b,c=[ i for i in input().split()]
    if b=="?":
        flag=1
        break
    elif b=="+":
        n=int(a)+int(c)
    elif b=="-":
        n=int(a)-int(c)
    elif b=="*":
        n=int(a)*int(c)
    elif b=="/":
        n=int(a)/int(c)
    print(int(n))

Fixed submission:
n=int(input())
num=[int(i) for i in input().split()]
# num=[1,2,3,4,6]
M=max(num)
m=min(num)
s=sum(num)
print("{0} {1} {2}".format(m,M,s))
Buggy python submission (verdict: Runtime Error):
flag=0
while flag==0:
    a,b=[int(i) for i in input().split()]
    for i in range(a):
        print("#"*b)

Fixed submission:

flag=0
while flag==0:
    a,b=[int(i) for i in input().split()]
    if a==0 and b==0:
        flag=1
        break
    else:
        for i in range(a):
            print("#"*b)
    print("")

Buggy python submission (verdict: Runtime Error):
flag=0
while flag==0:
    a,b=[int(i) for i in input().split()]
    if a=0,b=0:
        flag=1
        break
    else:
        for i in range(a):
        print("#"*b)

Fixed submission:

flag=0
while flag==0:
    a,b=[int(i) for i in input().split()]
    if a==0 and b==0:
        flag=1
        break
    else:
        for i in range(a):
            print("#"*b)
    print("")

Buggy python submission (verdict: Runtime Error):
flag=0
while flag==0:
    a,b=[int(i) for i in input().split()]
    if a=0 and b=0:
        flag=1
        break
    else:
        for i in range(a):
        print("#"*b)

Fixed submission:

flag=0
while flag==0:
    a,b=[int(i) for i in input().split()]
    if a==0 and b==0:
        flag=1
        break
    else:
        for i in range(a):
            print("#"*b)
    print("")
Buggy python submission (verdict: Runtime Error):

def isprime(number):
    if number == 2 or 2 ** (number -1) % number == 1:
        return 1 
    else:
        return 0
def countPrime(number,count):
    if isprime(number)== 1:
        count +=1
    return count
        
n = int(input())
c = 0
for i in range(n):
    c = countPrime(i,c)
print (c)

Fixed submission:
import sys
 
 
def is_prime(x):
    if x == 2:
        return True
    elif x < 2 or not x % 2:
        return False
 
    return pow(2, x - 1, x) == 1
 
 
def solve(_c_list):
    cnt = 0
    for ele in _c_list:
        if is_prime(ele):
            cnt += 1
    return cnt
 
 
if __name__ == '__main__':
    _input = sys.stdin.readlines()
    c_num = int(_input[0])
    c_list = list(map(int, _input[1:]))
    ans = solve(c_list)
    print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
min_n = 0
max_n = -2 * 10**9
for i in range(n):
    x = int(input())
    min_n = min(x,min_n)
    max_n = max(max_n,x - min_n)
print max_n

Fixed submission:
n = int(input())
min_n = 2 * 10**9
max_n = -2 * 10**9
for i in range(n):
    x = int(input())
    max_n = max(max_n,x - min_n)
    min_n = min(x,min_n)
print (max_n)
Buggy python submission (verdict: Runtime Error):
a,b = int(raw_input().split(" "))
print a * b, 2*(a + b)

Fixed submission:
x = raw_input().split(" ")
a = int(x[0])
b = int(x[1])
print a * b, 2*(a + b)

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

Fixed submission:
x = raw_input().split(" ")
a = int(x[0])
b = int(x[1])
print a * b, 2*(a + b)

Buggy python submission (verdict: Runtime Error):
x = raw_input().split(" ")
a = x[0]
b = x[1]

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

Fixed submission:
x = raw_input().split(" ")
a = int(x[0])
b = int(x[1])
print a * b, 2*(a + b)

Buggy python submission (verdict: Runtime Error):
x = raw_input().split(" ")
a = x[0]
b = x[1]
print a * b, 2*(a + b)

Fixed submission:
x = raw_input().split(" ")
a = int(x[0])
b = int(x[1])
print a * b, 2*(a + b)
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int,raw_input().split())
if a>b and b > c:
  print ("Yes")
else
  print ("No")

Fixed submission:
a,b,c=map(int, raw_input().split())
if a < b and b < c:
  print ('Yes')
else:
  print ('No')

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int,raw_input().split())
if a > b and b > c:
  print ("Yes")
else
  print ("No")

Fixed submission:
a,b,c=map(int, raw_input().split())
if a < b and b < c:
  print ('Yes')
else:
  print ('No')

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int,raw_input().split())
if a < b and b < c:
  print ("Yes")
else
  print ("No")

Fixed submission:
a,b,c=map(int, raw_input().split())
if a < b and b < c:
  print ('Yes')
else:
  print ('No')

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int,raw_input().split())
if a < b and b < c:
  print ('Yes')
else
  print ('No')

Fixed submission:
a,b,c=map(int, raw_input().split())
if a < b and b < c:
  print ('Yes')
else:
  print ('No')

Buggy python submission (verdict: Runtime Error):
a,b,c=map(int, raw_input().split())
if a < b and b < c:
  print ('Yes')
else
  print ('No')

Fixed submission:
a,b,c=map(int, raw_input().split())
if a < b and b < c:
  print ('Yes')
else:
  print ('No')
Buggy python submission (verdict: Runtime Error):
w,h,x,y,r = map(int,raw_input().split())
if r =< x <= w - r and r =< y <= h - r:
  print ("Yes")
else
  print ("No")  

Fixed submission:
w,h,x,y,r = map(int,raw_input().split())
if r <= x <= w - r and r <= y <= h - r:
  print ("Yes")
else:
  print ("No")

Buggy python submission (verdict: Runtime Error):
w,h,x,y,r = map(int,raw_input().split())
if r =< x <= w - r and r =< y <= h - r:
  print ("Yes")
else:
  print ("No")  

Fixed submission:
w,h,x,y,r = map(int,raw_input().split())
if r <= x <= w - r and r <= y <= h - r:
  print ("Yes")
else:
  print ("No")