Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
N,M=map(int,raw_input().split(' '))

m_1=[]
m_N=[]
for _ in range(M):
    a,b=map(int,raw_input().split(' '))
    if a==1 and not a in m_1:
        m_1.append(b)
    if b==N and not a in m_N:
        m_N.append(a)

if len(set(m_1)-set(m_N))==len(set(m_1)):
    print 'IMPOSSIBLE'
else:
    print 'POSSIBLE'

Fixed submission:
N,M=map(int,raw_input().split(' '))

m_1=[0]*(N+1)
m_N=[0]*(N+1)
for _ in range(M):
    a,b=map(int,raw_input().split(' '))
    if a==1:
        m_1[b]=1
    if b==N:
        m_N[a]=1

a=''.join(map(str,m_1))
b=''.join(map(str,m_N))

c=int(a,2)
d=int(b,2)


if c&d==0:
    print 'IMPOSSIBLE'
else:
    print 'POSSIBLE'
Buggy python submission (verdict: Time Limit Exceeded):
n=int(raw_input())
a=map(int,raw_input().split(' '))

b=[]
for i in range(1,n+1):
    b.append(a[i-1])
    b=b[::-1]

print ' '.join(map(str,b))

Fixed submission:
n=int(raw_input())
a=map(int,raw_input().split(' '))

if len(a)%2==0:
    b=a[1::2][::-1]+a[0::2]
else:
    b=a[0::2][::-1]+a[1::2]

print ' '.join(map(str,b))
Buggy python submission (verdict: Time Limit Exceeded):
N=int(raw_input())
a=[-1]
for _ in range(N):
    a.append(int(raw_input()))


if not 2 in a:
    print -1
else:
    alr=[]
    i=1
    c=1
    while(c<=N):
        if a[i]==2:
            print c
            break
        elif i in alr:
            print -1
            break
        else:
            alr.append(i)
            i=a[i]
            c+=1

    if c>N:
        print -1
            
        

Fixed submission:
N=int(raw_input())
a=[-1]
for _ in range(N):
    a.append(int(raw_input()))
 
 
i=1
c=0
while(1):
    if i==2:
        print c
        break
    elif c>=N:
        print -1
        break
    c+=1
    i=a[i]

Buggy python submission (verdict: Time Limit Exceeded):
N=int(raw_input())
a=[-1]
for _ in range(N):
    a.append(int(raw_input()))


if not 2 in a:
    print -1
else:
    alr=[]
    i=1
    c=1
    while(1):
        if a[i]==2:
            print c
            break
        elif i in alr:
            print -1
            break
        else:
            alr.append(i)
            i=a[i]
            c+=1
            
        

Fixed submission:
N=int(raw_input())
a=[-1]
for _ in range(N):
    a.append(int(raw_input()))
 
 
i=1
c=0
while(1):
    if i==2:
        print c
        break
    elif c>=N:
        print -1
        break
    c+=1
    i=a[i]
Buggy python submission (verdict: Runtime Error):
    r,g,b=map(int,raw_input().split(' '))
     
    if (r*100+g*10+b)%4==0:
      print "YES"
    else:
      print "NO"

Fixed submission:
r,g,b=map(int,raw_input().split(' '))
                 
if (r*100+g*10+b)%4==0:
    print "YES"
else:
    print "NO"
Buggy python submission (verdict: Runtime Error):
N=int(raw_input())
S=raw_input()

op=0
cl=0

i=0
j=len(S)-1
while i<=j:
    if i==j:
        if S[i]=='(':
            cl+=1
        else:
            op+=1
        break
    while S[i]!='(':
        i+=1
        op+=1
    while S[j]!=')':
        j-=1
        cl+=1
    if i<j:
        i+=1
        j-=1

r='('*op+S+')'*cl

print r

Fixed submission:
N=int(raw_input())
S=raw_input()

s=list(S)

i=0
j=0
while i<N and j<N:
    #print i,s
    if s[i]=='(':
        j=i
        while j<N:
            #print i,j
            if s[j]==')':
                s[i]='x'
                s[j]='x'
                #print (i,j),s
                i+=1
                break
            else:
                j+=1
    else:
        i+=1

op=s.count(')')
cl=s.count('(')

print '('*op+S+')'*cl

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

op=S.count('(')
cl=S.count(')')

if op>cl:
    r=S+')'*(op-cl)
elif cl>op:
    r='('*(cl-op)+S

print r

Fixed submission:
N=int(raw_input())
S=raw_input()

s=list(S)

i=0
j=0
while i<N and j<N:
    #print i,s
    if s[i]=='(':
        j=i
        while j<N:
            #print i,j
            if s[j]==')':
                s[i]='x'
                s[j]='x'
                #print (i,j),s
                i+=1
                break
            else:
                j+=1
    else:
        i+=1

op=s.count(')')
cl=s.count('(')

print '('*op+S+')'*cl
Buggy python submission (verdict: Runtime Error):
a=int(raw_input())
b=int(raw_input())

if a>b:
    print "GREATER"
elif a<b:
    print "LESS"
else:
    print "EQUAL"

Fixed submission:
s1,s2,s3 = raw_input().split(' ')

print (s1[0]+s2[0]+s3[0]).upper()
Buggy python submission (verdict: Runtime Error):
a=int(raw_input)
b=int(raw_input)

if a>b:
    print "GREATER"
elif a<b:
    print "LESS"
else:
    print "EQUAL"

Fixed submission:
a=int(raw_input())
b=int(raw_input())

if a>b:
    print "GREATER"
elif a<b:
    print "LESS"
else:
    print "EQUAL"
Buggy python submission (verdict: Runtime Error):
import math

N=int(raw_input())

n=math.floor(math.sqrt(N))

while(N%n!=0): n-=1

m=N/n
n=int(n)
m=int(m)

if n>=m:
    print len(str(n))
else:
    print len(str(m))


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

print (a+b)%24
Buggy python submission (verdict: Runtime Error):
n=int(input())
s=[int(x) for x in input().split()]
s.sort()
a=s[0]
b=s[-1]
m=9999999999999
for i in range(a,b+1):
    sum=0    
    for j in s:
        sum+=(j-i)**2
    if sum < m:
        m=sum
        
print(m)

Fixed submission:
n=int(input())
print(n*(n+1)//2)

Buggy python submission (verdict: Runtime Error):
n=int(input())
s=[int(x) for x in input().split()]
s.sort()
a=s[0]
b=s[-1]
m=9999999999999
for i in range(a,b+1):
    sum=0    
    for j in s:
        sum+=(j-i)**2
    if sum < m:
        m=sum
        
print(m)

Fixed submission:
n=int(input())
print(n*(n+1)//2)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int, input().split()))

sum_a = [sum(a[0:i]) for i in range(1, N)]
a.reverse()
sum_b = [sum(a[0:i]) for i in range(1, N)]

res = abs(sum_a[0] - sum_b[N-2])
for i in range(N-1):
  res = min(res, abs(sum_a[i] - sum_b[N-2-i]))
  
print(res)

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

for i in range(1, N):
  a[i] += a[i-1]

res = abs(a[0] - (a[-1]-a[0]))
for i in range(N-1):
  res = min(res, abs(a[i] - (a[-1] - a[i])))

print(res)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
a = list(map(int, input().split()))

res = abs(sum(a[0:1]) - sum(a[1:]))
for i in range(2, N-1):
  temp_a = sum(a[0:i])
  temp_b = sum(a[i:])
  if abs(temp_a - temp_b) < res:
  	res = abs(temp_a - temp_b)
print(res)

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

for i in range(1, N):
  a[i] += a[i-1]

res = abs(a[0] - (a[-1]-a[0]))
for i in range(N-1):
  res = min(res, abs(a[i] - (a[-1] - a[i])))

print(res)
Buggy python submission (verdict: Runtime Error):
N = int(input())
ret = 10000
for A in range(1, N):
    ret = min(ret, digit_sum(A) + digit_sum(N-A))
print(ret)

Fixed submission:
def digit_sum(i):
    return sum([int(digit) for digit in list(str(i))])

N = int(input())
ret = 10000
for A in range(1, N):
    ret = min(ret, digit_sum(A) + digit_sum(N-A))
print(ret)
Buggy python submission (verdict: Runtime Error):
import string

S = input()
if len(S) < 26:
    for c in string.ascii_lowercase:
        if c not in S:
            break
    print(S + c)
else:
    ret = None
    for i in range(26):
        if max(S[25-i:]) != S[25-i]:
            mc = 'z'
            for c in S[25-i:]:
                if c > S[25-i]:
                    mc = min(c, mc)
            ret = S[:25-i] + mc
            break
            
    if ret is None:
        print(-1)
    else:
        print(ret)
S = input()
if len(S) < 26:
    for c in string.ascii_lowercase:
        if c not in S:
            break
    print(S + c)
else:
    ret = None
    for i in range(26):
        if max(S[25-i:]) != S[25-i]:
            mc = 'z'
            for c in S[25-i:]:
                if c > S[25-i]:
                    mc = min(c, mc)
            ret = S[:25-i] + mc
            break
            
    if ret is None:
        print(-1)
    else:
        print(ret)


Fixed submission:
import string
 
S = input()
if len(S) < 26:
    for c in string.ascii_lowercase:
        if c not in S:
            break
    print(S + c)
else:
    ret = None
    for i in range(26):
        if max(S[25-i:]) != S[25-i]:
            mc = 'z'
            for c in S[25-i:]:
                if c > S[25-i]:
                    mc = min(c, mc)
            ret = S[:25-i] + mc
            break
            
    if ret is None:
        print(-1)
    else:
        print(ret)

Buggy python submission (verdict: Runtime Error):
S = input()
if len(S) < 26:
    for c in string.ascii_lowercase:
        if c not in S:
            break
    print(S + c)
else:
    ret = None
    for i in range(26):
        if max(S[25-i:]) != S[25-i]:
            mc = 'z'
            for c in S[25-i:]:
                if c > S[25-i]:
                    mc = min(c, mc)
            ret = S[:25-i] + mc
            break
            
    if ret is None:
        print(-1)
    else:
        print(ret)

Fixed submission:
import string
 
S = input()
if len(S) < 26:
    for c in string.ascii_lowercase:
        if c not in S:
            break
    print(S + c)
else:
    ret = None
    for i in range(26):
        if max(S[25-i:]) != S[25-i]:
            mc = 'z'
            for c in S[25-i:]:
                if c > S[25-i]:
                    mc = min(c, mc)
            ret = S[:25-i] + mc
            break
            
    if ret is None:
        print(-1)
    else:
        print(ret)
Buggy python submission (verdict: Runtime Error):
def prity(mat, line):
    for i in range(line):
        for j in range(100):
            print(mat[i][j], end='')
        print()

A, B = map(int, input().split())

if A*B == 1:
    print(".#")
    exit(1)

mat = [['' for i in range(100)] for j in range(100)]

line=0
if B > 1 and A > 1: # start with white
    B -= 1
    while A > 1:
        for j in range(50):
            if A > 1:
                mat[line][2*j] = "."
                A -= 1
            else:
                mat[line][2*j] = "#"
            mat[line][2*j+1] = "#"
        for j in range(100):
            mat[line+1][j] = "#"
        line += 2
        
for j in range(100):
    mat[line][j] = "."
A -= 1
line += 1
assert A == 0

if B > 1:
    while B > 0:
        for j in range(50):
            if B > 0:
                mat[line][2*j] = "#"
                B -= 1
            else:
                mat[line][2*j] = "."
            mat[line][2*j+1] = "."
        for j in range(100):
            mat[line+1][j] = "."
        line += 2
        
prity(mat, line)

Fixed submission:
def prity(mat, line):
    print(line, 100)
    for i in range(line):
        for j in range(100):
            print(mat[i][j], end='')
        print()

A, B = map(int, input().split())

if A*B == 1:
    print(1, 2)
    print(".#")
else:

    mat = [['' for i in range(100)] for j in range(100)]

    # start with white
    line=0
    if A > 1: 
        B -= 1
        while A > 1:
            for j in range(50):
                if A > 1:
                    mat[line][2*j] = "."
                    A -= 1
                else:
                    mat[line][2*j] = "#"
                mat[line][2*j+1] = "#"
            for j in range(100):
                mat[line+1][j] = "#"
            line += 2

    # one line of white
    for j in range(100):
        mat[line][j] = "."
    A -= 1
    line += 1
    assert A == 0
    
    # finish black
    if B > 0:
        while B > 0:
            for j in range(50):
                if B > 0:
                    mat[line][2*j] = "#"
                    B -= 1
                else:
                    mat[line][2*j] = "."
                mat[line][2*j+1] = "."
            for j in range(100):
                mat[line+1][j] = "."
            line += 2

    prity(mat, line)
Buggy python submission (verdict: Runtime Error):
import numpy as np

class Solver:
    def __init__(self, N, edge):
        self.N = N
        self.edge = edge
        
    def dfs(self, i, x):
        self.x_arr[i] = x
        self.visited[i] = True

        isValid = True
        for (to, cost) in self.edge[i]:
            if self.visited[to] and self.x_arr[to] != x + cost:
                isValid = False
            elif not(self.visited[to]):
                isValid = self.dfs(to, x + cost)
            if not(isValid):
                break
        return isValid
        
    def solve(self):
        self.x_arr = np.zeros(self.N).astype(int)
        self.visited = np.zeros(self.N).astype(bool)
        
        isValid = True
        for i in range(self.N):
            if not(self.visited[i]):
                isValid = self.dfs(i, 0)
                if not(isValid):
                    break
        return isValid
    
def main():
    N, M = [int(_) for _ in input().split()]
    edge = [[] for _ in range(N)]

    for _ in range(M):
        left, right, dist = [int(_) for _ in input().split()]
        left -= 1
        right -= 1
        edge[left].append((right, dist))
        edge[right].append((left, -dist))
        
    solver = Solver(N, edge)
    if (solver.solve()):
        print("Yes")
    else:
        print("No")
        
if __name__=="__main__":
    main()

Fixed submission:
import numpy as np

def solve(N, edge):
    x_arr = np.zeros(N).astype(int)
    visited = np.zeros(N).astype(bool)
    
    isValid = True
    for n in range(N):
        if not(visited[n]):
#            print("start with {}".format(n))
            stack = []
            stack.append((n, 0))
            while len(stack) > 0:
#                print(stack)
                i, x = stack[-1]
                stack.pop()
                
                if visited[i] and x_arr[i] != x: # if already visited
#                    print("err", i, x, x_arr[i])
                    isValid = False
                elif not(visited[i]): # if first time to visit
                    visited[i] = True
                    x_arr[i] = x
                    for j, c in edge[i]:
                        stack.append((j, x + c))
    return isValid
  
N, M = [int(_) for _ in input().split()]
edge = [[] for _ in range(N)]

for _ in range(M):
    left, right, dist = [int(_) for _ in input().split()]
    left -= 1
    right -= 1
    edge[left].append((right, dist))
    edge[right].append((left, -dist))
    
if solve(N, edge):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
import math
K=int(input())
A_lst=[int(_) for _ in input().split() ]

assert A_lst[-1]==2
stt, end=2,4
failed=False
for a in A_lst[-2::-1]:
    #print(stt, end, a)
    stt=a*math.ceil(stt/a)
    if stt>= end:
        failed=True
        break
    end=a*math.ceil(end/a)

if failed:
    print(-1)
else:
    print(stt, end-1)

Fixed submission:
import math
K=int(input())
A_lst=[int(_) for _ in input().split() ]

failed=False
if A_lst[-1]!=2:
    failed=True
else:
    stt, end=2,4
    for a in A_lst[-2::-1]:
        #print(stt, end, a)
        stt=a*math.ceil(stt/a)
        if stt>= end:
            failed=True
            break
        end=a*math.ceil(end/a)

if failed:
    print(-1)
else:
    print(stt, end-1)
Buggy python submission (verdict: Runtime Error):
N=int(input())
a_lst=[int(_) for _ in input().split()]
a_arr=np.array(a_lst)
idx=np.absolute(a_arr).argmax() + 1 #1origin

print(2*N-2)
for i in range(1, N+1):
    if i != idx:
        print(idx, i)
if a_lst[idx-1]>0:
    for i in range(1, N):
        print(i, i+1)
elif a_lst[idx-1]<0:
    for i in range(N, 1):
        print(i, i-1)
else:
    pass

Fixed submission:
import numpy as np

N=int(input())
a_lst=[int(_) for _ in input().split()]
a_arr=np.array(a_lst)
idx=np.absolute(a_arr).argmax() + 1 #1origin

if a_lst[idx-1]==0:
    print(0)
else:
    print(2*N-2)
    for i in range(1, N+1):
        if i != idx:
            print(idx, i)
    if a_lst[idx-1]>0:
        for i in range(1, N):
            print(i, i+1)
    elif a_lst[idx-1]<0:
        for i in range(N, 1, -1):
            print(i, i-1)
Buggy python submission (verdict: Runtime Error):
import numpy as np
import math

def comb(n, k):
    if k<0 or n<k:
        return 0

    if n-k<k:
        k=n-k
    return round(math.factorial(n)/math.factorial(k)/math.factorial(n-k))

n=int(input())
a=np.array([int(i) for i in input().split()])

count_lst=[[] for _ in range(n)]
for i in range(n+1):
    count_lst[a[i]-1].append(i)

for i in range(n):
    if len(count_lst[i])==2:
        left=count_lst[i][0]
        right=count_lst[i][1]
gapLen=right-left-1

del count_lst


base=10**9+7

for k in range(1, n+2):
    #print("k={}".format(k))
    retVal=0
    #retVal+=comb(n-1, k-2)#両方in
    #print(retVal)
    #retVal+=comb(n-1, k)#両方out
    #print(retVal)
    
    #retVal+=comb(n-1-gapLen, k-1)#片方in, gapから1つも選ばれない
    #print(retVal)    
    retVal+=2*(comb(n-1, k-1)-comb(n-1-gapLen, k-1))
    print(retVal%base)

Fixed submission:
import math
import numpy as np

n=int(input())
a=np.array([int(i)  for i in input().split()])

b=np.zeros(n, dtype=int)
pos=math.ceil((n-1)/2)

forward=True
for i in range(n):
    #print("i:{0}, pos:{1}, a[i]:{2}".format(i, pos, a[i]))
    b[pos]=a[i]
    if forward:
        forward=False
        pos-=(i+1)
    else:
        forward=True
        pos+=(i+1)
        
if forward:
    for i in range(n):
        print(b[i],end=' ')
else:
    for i in range(n):
        print(b[n-1-i],end=' ')
Buggy python submission (verdict: Runtime Error):
s=input()
#s="whbrjpjyhsrywlqjxdbrbaomnw"
minCost=len(s)
for char in char_set:
    m=max([len(_) for _ in s.split(char)])
    if m<minCost:
        minCost=m
print(minCost)

Fixed submission:
s=input()
#s="whbrjpjyhsrywlqjxdbrbaomnw"
minCost=len(s)
char_set=set(s)
for char in char_set:
    m=max([len(_) for _ in s.split(char)])
    if m<minCost:
        minCost=m
print(minCost)
Buggy python submission (verdict: Runtime Error):
N=int(input())
s_arr=np.zeros(N, dtype=np.int8)
for i in range(N):
    s_arr[i]=int(input())

total=np.sum(s_arr)
if total%10!=0:
    print(total)
else:
    msk=(s_arr%10!=0)
    if np.sum(msk)==0:
        print(0)
    else:
        print(total-np.min(s_arr[msk]))

Fixed submission:
import numpy as np

N=int(input())
s_arr=np.zeros(N, dtype=np.int8)
for i in range(N):
    s_arr[i]=int(input())

total=np.sum(s_arr)
if total%10!=0:
    print(total)
else:
    msk=(s_arr%10!=0)
    if np.sum(msk)==0:
        print(0)
    else:
        print(total-np.min(s_arr[msk]))
Buggy python submission (verdict: Runtime Error):
a,b,c,d = map(int,input().split())

ab = abs(a - b)
bc = abs(b - c)
if (abs(a-c) =< d)or(ab =< d and bc =< d):
    print("Yes")
else:
    print("No")

Fixed submission:
a,b,c,d = map(int,input().split())

ab = abs(a-b)
bc = abs(b-c)
if (abs(a-c)<= d)or(ab <= d and bc <= d):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
w,a,b=map(int,input().split())
x,y=a+w,a-w
print(0 if x<b<y else min(abs(x-b,y-b)))

Fixed submission:
w,a,b=map(int,input().split())
print(0 if a<=b+w and b<=a+w else min(abs(a+w-b),abs(a-w-b)))
Buggy python submission (verdict: Runtime Error):
n,s=int(input()),input()
print(max([s[0:i].count('I')-s[0:i].count('D') for i in range(n)]))

Fixed submission:
a,b,c,d=map(int, input().split())
print(max(a*b,c*d))
Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
if(a>8 or b>8):
    print (":(")
else:
    print("Yay!")
        

Fixed submission:
a,b = map(int,input().split())
if(a>8 or b>8):
    print (":(")
else:
    print("Yay!")

Buggy python submission (verdict: Runtime Error):
import sys
array =[]
for line in sys.stdin.readlines():
    array.append(line.rstrip())
num1 = array[0]
box =list()
num2 = array[1]
print(num2)
for i in range(0,len(num2.split(" "))) :
    box.append(int(num2.split(" ")[i]))
count =0
for j in range(len(box)):
    while(True):
        if box[j]%2==0:
            count+=1
            box[j]=box[j]//2
        else:
            break;
print(count)    

Fixed submission:
input_lines = input()
if int(input_lines.split(" ")[0])<=8 and int(input_lines.split(" ")[1])<=8:
    print("Yay!")
else:
    print(":(")
Buggy python submission (verdict: Runtime Error):
input_data = input()
if input_data <= 999:
    print(str(ABC))
else:
    print(str(ABD))

Fixed submission:
input_data = int(input())
if input_data <= 999:
    print('ABC')
else:
    print('ABD')

Buggy python submission (verdict: Runtime Error):
input_data = input()
if input_data <= 999:
    print(ABC)
else:
    print(ABD)

Fixed submission:
input_data = int(input())
if input_data <= 999:
    print('ABC')
else:
    print('ABD')

Buggy python submission (verdict: Runtime Error):
input_data = input()
if input_data <= 999:
    print('ABC')
else:
    print('ABD')

Fixed submission:
input_data = int(input())
if input_data <= 999:
    print('ABC')
else:
    print('ABD')

Buggy python submission (verdict: Runtime Error):
input_data = input()
if input_data <= 999:
    print('ABC')
print('ABD')

Fixed submission:
input_data = int(input())
if input_data <= 999:
    print('ABC')
else:
    print('ABD')

Buggy python submission (verdict: Runtime Error):
N = input()
N=int(N)
if N>=1,N<=999:
    print('ABC')
if N>=1000,N<=1998:
    print('ABD')

Fixed submission:
N = input()
N=int(N)
if N>=1 and N<=999:
    print('ABC')
if N>=1000 and N<=1998:
    print('ABD')

Buggy python submission (verdict: Runtime Error):
N = int(input())
if N>=1,N<=999:
    print('ABC')
if N>=1000,N<=1998:
    print('ABD')

Fixed submission:
N = input()
N=int(N)
if N>=1 and N<=999:
    print('ABC')
if N>=1000 and N<=1998:
    print('ABD')

Buggy python submission (verdict: Runtime Error):
N = int(input())
if N>=1,N<=999:
    print('ABC')
if N>=1000,N<=1998
    print('ABD')

Fixed submission:
N = input()
N=int(N)
if N>=1 and N<=999:
    print('ABC')
if N>=1000 and N<=1998:
    print('ABD')
Buggy python submission (verdict: Runtime Error):
A = int(raw_input())
B = int(raw_input())

if (A <= 8) and (B <= 8):print "Yay!"
else : print ":("

Fixed submission:

A,B = map(int, raw_input().split())

if (A <= 8) and (B <= 8):print "Yay!"
else : print ":("

Buggy python submission (verdict: Runtime Error):
if (A <= 8) and (B <= 8):print "Yay!"
else : print ":("

Fixed submission:

A,B = map(int, raw_input().split())

if (A <= 8) and (B <= 8):print "Yay!"
else : print ":("
Buggy python submission (verdict: Runtime Error):
D,N = map(int, raw_input().split( ))

if N < 100:
	print pow(100,D)*N

else:
	print (N+1)*pow(100,d)

Fixed submission:
D,N = map(int, raw_input().split( ))

if N < 100:
	print pow(100,D)*N

else:
	print (N+1)*pow(100,D)

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

if n < 100:
	print pow(100,D)*N
else:
	print (N+1)*pow(100,d)

Fixed submission:
D,N = map(int, raw_input().split( ))

if N < 100:
	print pow(100,D)*N

else:
	print (N+1)*pow(100,D)
Buggy python submission (verdict: Runtime Error):
n = int(input())

a = sorted(list(map(int, input().split())), reversed=True)
ans = sum(a[::2]) - sum(a[1::2])
print(ans)

Fixed submission:
n = int(input())

a = sorted(list(map(int, input().split())), reverse=True)
ans = sum(a[::2]) - sum(a[1::2])
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().sp;it())
print((a+b)//2)

Fixed submission:
a, b = map(int, input().split())
import math
x = (a + b) /2 
print(math.ceil(x))

Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split)
print((a+b)//2)

Fixed submission:
a, b = map(int, input().split())
import math
x = (a + b) /2 
print(math.ceil(x))
Buggy python submission (verdict: Runtime Error):
t=input().split(" ")
X=int(t[0])
Y = int(t[1])
Z = int(t[2])
print((X-Z)//(Y+Z))

Fixed submission:
t=input().split(" ")
X=(t[0])
Y =(t[1])
if X>Y:
    print(">")
if X<Y:
    print("<")
if X==Y:
    print("=")