Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03547 (python)

Fixed submission:
X,Y = input().split()
 
if X > Y:
    print(">")
elif X==Y:
    print("=")
else:
    print("<")

Buggy submission (verdict: Runtime Error):
X,Y = input().split()

if X > Y:
    print(">")
elif X==Y:
    priint("=")
else:
    print("<")
Problem p03606 (python)

Fixed submission:
N = int(input())
ans = 0
for i in range(N):
    l,r = map(int,input().split())
    ans += r-l+1
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
ans = 0
for i in range(N):
    l,r = map(int,input())
    ans += r-l+1
print(ans)
Problem p03683 (python)

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

ex = [1]
mod = 10**9+7
for i in range(1,10**5+1):
    ex.append((ex[-1]*i)%mod)
    
if abs(N-M) >= 2:
    print(0)
elif N==M:
    print((2*ex[N]**2)%mod)
else:
    print((ex[N]*ex[M])%mod)

Buggy submission (verdict: Runtime Error):
[].pop()
Problem p03729 (python)

Fixed submission:
A,B,C = input().split()
if A[-1]==B[0] and B[-1] == C[0]:
    print("YES")
else:
    print("NO")

Buggy submission (verdict: Runtime Error):
A = input()
B = input()
C = input()

if A[-1]==B[0] and B[-1] == C[0]:
    print("YES")
else:
    print("NO")
Problem p04012 (python)

Fixed submission:
w = input()
from collections import defaultdict
D = defaultdict(int)
 
for i in w:
    D[i]+=1
flag = 0
for i in D:
    if D[i]%2==1:
        flag = 1
        break
if flag==1:
    print("No")
else:
    print("Yes")

Buggy submission (verdict: Runtime Error):
w = input()
from collection import defaultdict
D = defaultdict(int)

for i in w:
    D[i]+=1
flag = 0
for i in D:
    if D[i]%2==1:
        flag = 1
        break
if flag==1:
    print("No")
else:
    print("Yes")
Problem p02663 (python)

Fixed submission:
h1,m1,h2,m2,k =(int(x) for x in input().split())  
 
hrtom= (h2-h1)
 
if (m2-m1 < 0) and (h2-h1 >=0) : 
    min = (h2-h1)*60 + (m2-m1) - k
    print(min)
    
elif (m2-m1 >= 0) and (h2-h1 >=0 ):
    min = (h2-h1)*60 + (m2-m1) - k 
    print(min)

    

else:
    print('0')

Buggy submission (verdict: Runtime Error):
1,m1,h2,m2,k =(int(x) for x in input().split())  
 
hrtom= (h2-h1)
 
if (m2-m1 < 0) and (h2-h1 >=0) : 
    min = (h2-h1)*60 - (m2-m1) - k
    print(min)
    
elif (m2-m1 >= 0) and (h2-h1 >=0 ):
    min = (h2-h1)*60 + (m2-m1) - k 
    print(min)

elif (m2-m1 < 0) and (h2-h1) <=0 :
    min = (24-h1+h2)*60 - (m2-m1) -k 
    print(min) 
    
elif (m2-m1 >= 0) and (h2-h1) <=0 :
    min = (24-h1+h2)*60 + (m2-m1) -k 
    print(min) 
    
else:
    print('0')
Problem p02663 (python)

Fixed submission:
h1,m1,h2,m2,k=map(int, input().split())

ans=0
if m1>m2: ans=(h2-h1-1)*60+60-m1+m2
else: ans=(h2-h1)*60+m2-m1
print(ans-k)

Buggy submission (verdict: Runtime Error):
h1=int(input())
m1=int(input())
h2=int(input())
m2=int(input())
k=int(input())

ans=0
if m1>m2: ans=(h2-h1-1)*60+60-m1+m2
else: ans=(h2-h1)*60+m2-m1
print(ans-k)

Buggy submission (verdict: Runtime Error):
h1=int(input())
m1=int(input())
h2=int(input())
m2=int(input())
k=int(input())

ans=0
if m1>m2: ans=(h2-h1-1)*60+60-m1+m2
else: ans=(h2-h1)*60+m2-m1
print(ans-k)

Buggy submission (verdict: Runtime Error):
h1=int(input())
m1=int(input())
h2=int(input())
m2=int(input())
k=int(input())

ans=0
if m1>m2: ans=(h2-h1-1)*60+60-m1+m2
else: ans=(h2-h1)*60+m2-m1
print(ans-k)
Problem p02706 (python)

Fixed submission:
n,m = map(int,input().split())
l = list(map(int,input().split()))
s = sum(l)
if n-s<0:
  print(-1)
else:
  print(n-s)

Buggy submission (verdict: Runtime Error):
n,m = map(int,input())
l = list(map(int,input().split()))
s = sum(l)
if n-s<0:
  print(-1)
else:
  print(n-s)
Problem p02663 (python)

Fixed submission:
h1,m1,h2,m2,k = map(int, input().split())
print(m2-m1+(h2-h1)*60-k)

Buggy submission (verdict: Runtime Error):
h1 = int(input())
m1 = int(input())
h2 = int(input())
m2 = int(input())
k = int(input())
print(m2-m1+(h2-h1)*60-k)

Buggy submission (verdict: Runtime Error):
h1 = int(input())
m1 = int(input())
h2 = int(input())
m2 = int(input())
K = int(input())
print(m2 + h2*60 - m1 - h1*60 - K)

Buggy submission (verdict: Runtime Error):
H1 = int(input())
M1 = int(input())
H2 = int(input())
M2 = int(input())
K = int(input())
print((M2 + H2*60 - (M1 + H1*60)) - K)

Buggy submission (verdict: Runtime Error):
H1 = int(input())
M1 = int(input())
H2 = int(input())
M2 = int(input())
K = int(input())

if H1<H2:
    print((M2 + H2*60 - (M1 + H1*60)) - K)
else:
    print(M2 + H2*60 + ((60-M1)+(24-H1)*60) - K)

Buggy submission (verdict: Runtime Error):
H1 = int(input())
M1 = int(input())
H2 = int(input())
M2 = int(input())
K = int(input())
if H1<H2:
    print((M2 + H2*60 - (M1 + H1*60)) - K)
else:
    print(M2 + H2*60 + ((60-M1)+(24-H1)*60) - K)
Problem p02664 (python)

Fixed submission:
t=list(input())
for i in range(len(t)):
    if t[i] == '?':
        t[i] = 'D'
print(''.join(t))

Buggy submission (verdict: Runtime Error):
t=input()
for i in range(len(t)):
    if t[i] == '?':
        t[i] = 'D'
Problem p03369 (python)

Fixed submission:
l = list(input())
m =700
for i in range(3):
 if l[i] == 'o':
  m += 100

print(m)

Buggy submission (verdict: Runtime Error):
l = list(input().split())
c = 0
for i in l:
 l[c] = int(i)
 c+=1

k = min(l[3],l[4])
money = min((l[0]+l[1])*k, l[2]*2*k)

if l[3]>l[4]:
 m = l[3]-l[4]
 money += min(l[0], l[2]*2)*m
else:
 m = l[4]-l[3]
 money += min(l[1], l[2]*2)*m

print(money)
Problem p03371 (python)

Fixed submission:
l = list(input().split())
c = 0
for i in l:
 l[c] = int(i)
 c+=1

k = min(l[3],l[4])
money = min((l[0]+l[1])*k, l[2]*2*k)

if l[3]>l[4]:
 m = l[3]-l[4]
 money += min(l[0], l[2]*2)*m
else:
 m = l[4]-l[3]
 money += min(l[1], l[2]*2)*m

print(money)

Buggy submission (verdict: Runtime Error):
l = list(input().split())
c = 0
for i in l:
 l[c] = int(l)
 c += 1

k = min(l[3],l[4])
money = min((l[0]+l[1])*k, l[2]*2*k)

if l[3]>l[4]:
 m = l[3]-l[4]
 money += min(l[0], l[2]*2)*m
else:
 m = l[4]-l[3]
 money += min(l[1], l[2]*2)*m

print(money)
Problem p02690 (python)

Fixed submission:
n = int(input())

for i in range(-1000,1000):
    for j in range(-1000,1000):
        if i**5 - j**5 == n:
            print(i,j)
            exit()

Buggy submission (verdict: Runtime Error):
n = int(input())

for i in range(-1000,1000):
  for for j in range(-1000,1000):
    if i**5 - j**5 == n:
      print(i,j)
      exit()
Problem p02727 (python)

Fixed submission:

x,y,a,b,c = map(int, input().split())
A = list(map(int, input().split())) 
B = list(map(int, input().split())) 
C = list(map(int, input().split())) 

A.sort()
B.sort()
C.sort(reverse=True)

X = A[len(A)-x:]
Y = B[len(B)-y:]

#print(X,Y,C)

xi = 0
yi = 0
ci = 0
for ci in range(c):
    #print(ci,xi,yi)
    if xi < len(X) and yi < len(Y):
        if C[ci] <= X[xi] and C[ci] <= Y[yi]:
            break
        
        if X[xi] < Y[yi]:
            if C[ci] > X[xi]:
                X[xi] = C[ci]
                xi = xi + 1
        else:
            if C[ci] > Y[yi]:
                Y[yi] = C[ci]
                yi = yi + 1
                
    elif xi < len(X):
        if C[ci] <= X[xi]:
            break
        
        if C[ci] > X[xi]:
            X[xi] = C[ci]
            xi = xi + 1
        
    elif yi < len(Y):
        if C[ci] <= Y[yi]:
            break
        
        if C[ci] > Y[yi]:
            Y[yi] = C[ci]
            yi = yi + 1
            
    else:
        break

print(sum(X)+sum(Y))

Buggy submission (verdict: Runtime Error):

x,y,a,b,c = map(int, input().split())
A = list(map(int, input().split())) 
B = list(map(int, input().split())) 
C = list(map(int, input().split())) 

A.sort()
B.sort()
C.sort(reverse=True)

X = A[len(A)-x:]
Y = B[len(B)-y:]


xi = 0
yi = 0
ci = 0
for ci in range(c):
    if C[ci] <= X[xi] and C[ci] <= Y[yi]:
        break
    
    if X[xi] < Y[yi]:
        if C[ci] > X[xi]:
            X[xi] = C[ci]
            xi = xi + 1
    else:
        if C[ci] > Y[yi]:
            Y[yi] = C[ci]
            yi = yi + 1

print(sum(X)+sum(Y))

Buggy submission (verdict: Runtime Error):

x,y,a,b,c = map(int, input().split())
A = list(map(int, input().split())) 
B = list(map(int, input().split())) 
C = list(map(int, input().split())) 

A.sort()
B.sort()
C.sort(reverse=True)

X = A[len(A)-x:]
Y = B[len(B)-y:]

print(X,Y,C)

xi = 0
yi = 0
ci = 0
for ci in range(c):
    if C[ci] <= X[xi] and C[ci] <= Y[yi]:
        break
    
    if X[xi] < Y[yi]:
        if C[ci] > X[xi]:
            X[xi] = C[ci]
            xi = xi + 1
    else:
        if C[ci] > Y[yi]:
            Y[yi] = C[ci]
            yi = yi + 1

print(X,Y)
print(sum(X)+sum(Y))

Buggy submission (verdict: Runtime Error):

x,y,a,b,c = map(int, input().split())
A = list(map(int, input().split())) 
B = list(map(int, input().split())) 
C = list(map(int, input().split())) 

A.sort()
B.sort()
C.sort(reverse=True)

X = A[len(A)-x:]
Y = B[len(B)-y:]


xi = 0
yi = 0
ci = 0
for ci in range(c):
    if C[ci] <= X[xi] and C[ci] <= Y[yi]:
        break
    
    if X[xi] < Y[yi]:
        if C[ci] > X[xi]:
            X[xi] = C[xi]
            xi = xi + 1
    else:
        if C[ci] > Y[yi]:
            Y[yi] = C[xi]
            yi = yi + 1

#print(X,Y)
print(sum(X)+sum(Y))
Problem p02765 (python)

Fixed submission:
a, b = map(int, input().split(" "))
print([b,b+(100*(10-a))][a<10])

Buggy submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split(" ")))

ave = round(sum(a) / len(a))

ans = 0
for i in a:
  ans += (i - ave)**2
  
print(ans)
Problem p03456 (python)

Fixed submission:


def is_square_num(n):
    
    mod256 = [
        0, 1, 4, 9, 16, 17, 25, 33, 36, 41,
        49, 57, 64, 65, 68, 73, 81, 89, 97, 100,
        105, 113, 121, 129, 132, 137, 144, 145, 153, 161,
        164, 169, 177, 185, 193, 196, 201, 209, 217, 225,
        228, 233, 241, 249 ]

    mod100 = [
        0, 1, 4, 9, 16, 21, 24, 25, 29, 36, 41, 44, 49, 56, 61, 64, 69, 76, 81, 84, 89, 96
    ]
    if not n % 256 in mod256:
        return False
    
    if not n % 100 in mod100:
        return False

    import math
    x = math.sqrt(n)

    # import numpy
    # x = numpy.sqrt(n)
    
    return x.is_integer()


n = input().replace(" ","")

print(['No','Yes'][is_square_num(int(n))])

Buggy submission (verdict: Runtime Error):
n = input().replace(" ","")

print(['No','Yes'][is_square_num(n)])



def is_square_num(n):
    
    mod256 = [
        0, 1, 4, 9, 16, 17, 25, 33, 36, 41,
        49, 57, 64, 65, 68, 73, 81, 89, 97, 100,
        105, 113, 121, 129, 132, 137, 144, 145, 153, 161,
        164, 169, 177, 185, 193, 196, 201, 209, 217, 225,
        228, 233, 241, 249 ]

    mod100 = [
        0, 1, 4, 9, 16, 21, 24, 25, 29, 36, 41, 44, 49, 56, 61, 64, 69, 76, 81, 84, 89, 96
    ]
    if not n % 256 in mod256:
        return False
    
    if not n % 100 in mod100:
        return False

    import math
    x = math.sqrt(n)

    # import numpy
    # x = numpy.sqrt(n)
    
    return x.is_integer()
Problem p02664 (python)

Fixed submission:
T = input()
ret = ""

for i in range(len(T)):
    if T[i]=="?":
        ret += "D"
    else:
        ret += T[i]

print(ret)

Buggy submission (verdict: Runtime Error):
ret = ""
for i in range(len(T)):
    if T[i]=="?":
        ret += "D"
    else:
        ret += T[i]

print(ret)
Problem p02760 (python)

Fixed submission:
A11,A12,A13 = map(int, input().split())
A21,A22,A23 = map(int, input().split())
A31,A32,A33 = map(int, input().split())
N = int(input())
b = []
for i in range(N):
    b.append(int(input()))

def check_bingo(bingo_card):
    bingo_cnt = 0
    ret = False
    bingo_list = [[0, 1, 2],
                  [3, 4, 5],
                  [6, 7, 8],
                  [0, 3, 6],
                  [1, 4, 5],
                  [2, 5, 8],
                  [0, 4, 8],
                  [2, 4, 6],]    

    for i in range(len(bingo_list)):
        for j in range(len(bingo_list[i])):
            if bingo_card[bingo_list[i][j]] == 0:
                bingo_cnt +=1
            else:
                break
        
        if bingo_cnt == 3:
            ret = True
            break
        else:
            bingo_cnt = 0
    
    return(ret)

def main():
    bingo_card = [A11,A12,A13,A21,A22,A23,A31,A32,A33]
    cnt = 0
    for i in range(N):
        for j in range(len(bingo_card)):
            if b[i] == bingo_card[j]:
                bingo_card[j] = 0
                cnt += 1
                break
            else:
                pass

    if cnt <= 2:
        print('No')                
        
    elif 3 <= cnt <= 6:
        judge_bingo = check_bingo(bingo_card)
        if judge_bingo == True:
            print('Yes')
        else:
            print('No')
    else:
        print('Yes')                
    
if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
A11,A12,A13 = map(int, input().split())
A21,A22,A23 = map(int, input().split())
A31,A32,A33 = map(int, input().split())
N = int(input())
b = []
for i in range(N):
    b.append(int(input()))

def check_bingo(bingo_card):
    bingo_cnt = 0
    bingo_list = [[0, 1, 2],
                  [3, 4, 5],
                  [6, 7, 8],
                  [0, 3, 6],
                  [1, 4, 5],
                  [2, 5, 8],
                  [0, 4, 8],
                  [2, 4, 6],]    

    for i in range(len(bingo_list)):
        for j in range(len(bingo_list[i])):
            if bingo_card[bingo_list[i][j]] == 0:
                bingo_cnt +=1
            else:
                break
        
        if bingo_cnt == 3:
            return(True)
            break
        else:
            bingo_cnt = 0
            return(False)

def main():
    bingo_card = [A11,A12,A13,A21,A22,A23,A31,A32,A33]
    cnt = 0
    for i in range(N):
        if b[i] in bingo_card:
            bingo_card[i] = 0
            cnt += 1
        else:
            pass

    if cnt <= 2:
        print('No')                
        
    elif 3 <= cnt <= 6:
        judge_bingo = check_bingo(bingo_card)
        if judge_bingo == True:
            print('Yes')
        else:
            print('No')
    else:
        print('Yes')                
    
if __name__ == "__main__":
    main()
Problem p02811 (python)

Fixed submission:
K, X = list(map(int,input().split()))

def main():
    coin = 500
    if X <= coin*K:
        print("Yes")

    else:
        print("No")

if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
K, X = list(map(int,input().split()))

def main():
    coin = 500
    if x <= coin*K:
        print("Yes")

    else:
        print("No")

if __name__ == "__main__":
    main()
Problem p02817 (python)

Fixed submission:
S,T = map(str, input().split())
print(T + S)

Buggy submission (verdict: Runtime Error):
import argparse

def make_parser():
    parser = argparse.ArgumentParser()

    parser.add_argument('S')
    parser.add_argument('T')

    args = parser.parse_args()

    return args

def main():
    args = make_parser()
    T = args.T
    S = args.S

    print(T + S)

if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
import argparse

def make_parser():
    parser = argparse.ArgumentParser()

    parser.add_argument('S')
    parser.add_argument('T')

    args = parser.parse_args()

    return args

def main():
    args = make_parser()
    T = args.T
    S = args.S

    print(T + S)

if __name__ == "__main__":
    main()

Buggy submission (verdict: Runtime Error):
import argparse

def make_parser():
    parser = argparse.ArgumentParser

    parser.add_argument('S')
    parser.add_argument('T')

    args = parser.parse_args()

    return args

def main():
    args = make_parser()
	T = arg.T
    S = arg.S
    
    printf(S + T)


if __name__ == "__main__":
    main()
Problem p02818 (python)

Fixed submission:
A,B,K = map(int, input().split())

takahashi_cookie = A
aoki_cookie = B
iteration = K

if 0 <= takahashi_cookie - iteration:
  takahashi_cookie -= iteration
 
elif 0 <= aoki_cookie + takahashi_cookie - iteration:
  aoki_cookie = aoki_cookie + takahashi_cookie - iteration
  takahashi_cookie = 0

else:
  takahashi_cookie = 0
  aoki_cookie = 0

print(str(takahashi_cookie) + ' ' + str(aoki_cookie))

Buggy submission (verdict: Runtime Error):
A,B,K = map(str, input().split())     

takahashi_cookie = A
aoki_cookie = B
iteration = K
     
while(0 < iteration):
    if(1 <= takahashi_cookie):
        takahashi_cookie -= 1
     
    elif(1 <= aoki_cookie):
        aoki_cookie -= 1
     
    else:
        pass
     
    iteration -= 1
     
    print(str(takahashi_cookie) + ' ' + str(aoki_cookie))
     A,B,KT = map(str, input().spl
          it())

Buggy submission (verdict: Runtime Error):
import argparse

def make_parser():
    parser = argparse.ArgumentParser()

    parser.add_argument('A', type=int)
    parser.add_argument('B', type=int)
    parser.add_argument('K', type=int)

    args = parser.parse_args()

    return args

def main():
    args = make_parser()

    takahashi_cookie = args.A
    aoki_cookie = args.B
    iteration = args.K

    while(0 < iteration):
        if(1 <= takahashi_cookie):
            takahashi_cookie -= 1

        elif(1 <= aoki_cookie):
            aoki_cookie -= 1

        else:
            pass

        iteration -= 1

    print(str(takahashi_cookie) + ' ' + str(aoki_cookie))

if __name__ == "__main__":
    main()
Problem p02993 (python)

Fixed submission:
passward = input()
last = None
for i in passward:
    if last == i:
        print("Bad")
        break
    else:
        last = i
else:
    print("Good")

Buggy submission (verdict: Runtime Error):
pass = input()
last = Nane
for i in pass:
	if last == i:
        print("Bad")
        break
    else:
        last = i
else:
    print("Good")
Problem p02675 (python)

Fixed submission:
book = int(input())
if book % 10 == 0 or book % 10 == 1 or book % 10 == 6 or book % 10 == 8 :
	print('pon')
elif book % 10 == 2 or book % 10 == 4 or book % 10 == 5 or book % 10 == 7 or book % 10 == 9:
	print('hon')
elif book % 10 == 3 :
	print('bon')

Buggy submission (verdict: Runtime Error):
book = int(input())
if book % 10 == 0 or if book % 10 == 1 or if book % 10 == 6 or if book % 10 == 8 :
	print('pon')
elif book % 10 == 2 or book % 10 == 4 or book % 10 == 5 or book % 10 == 7 or book % 10 == 9:
	print('hon')
elif book % 10 == 3 :
	print('bon')

Buggy submission (verdict: Runtime Error):
book = input()
if book % 10 == 0 or if book % 10 == 1 or if book % 10 == 6 or if book % 10 == 8 :
	print(pon)
elif book % 10 == 2 or book % 10 == 4 or book % 10 == 5 or book % 10 == 7 or book % 10 == 9:
	print(hon)
elif book % 10 == 3 :
	print(bon)

Buggy submission (verdict: Runtime Error):
book = input()
if book % 10 = 0 or if book % 10 = 1 or if book % 10 = 6 or if book % 10 = 8 :
	print(pon)
elif book % 10 = 2 or book % 10 = 4 or book % 10 = 5 or book % 10 = 7 or book % 10 = 9:
	print(hon)
elif book % 10 = 3 :
	print(bon)
Problem p02677 (python)

Fixed submission:
short , long , hour1 , mini = map(int, input().split())
hour2 = hour1 + mini / 60
import math
shortx = short * math.sin(math.radians( hour2 * 30 ))
shorty = short * math.cos(math.radians( hour2 * 30 ))
longx = long * math.sin(math.radians( mini * 6 ))
longy = long * math.cos(math.radians( mini * 6 ))
c = math.sqrt((shortx - longx) ** 2 + (shorty - longy) ** 2 )
print(c)

Buggy submission (verdict: Runtime Error):
short = int(input())
long = int(input())
hour = int(input())
mini = int(input())
import math
shortx = short * math.sin( hour / 6 * math.pi )
shorty = short * math.cos( hour / 6 * math.pi )
longx = long * math.sin( mini / 30 * math.pi )
longy = long * math.cos( mini / 30 * math.pi )
c = math.sqrt((shortx - longx) ** 2 + (shorty - longy) ** 2 )
print(c)

Buggy submission (verdict: Runtime Error):
long = int(input())
short = int(input())
hour = int(input())
mini = int(input())
longx = long * math.sin( hour / 6 * math.pi )
longy = long * math.cos( mini / 30 * math.pi )
shortx = short * math.sin( hour / 6 * math.pi )
shorty = short * math.cos( mini / 30 * math.pi )
c = math.sqrt((shortx - longx) ** 2 + (shorty - longy) ** 2 )
print(c)
Problem p03477 (python)

Fixed submission:
A,B,C,D = (int(i) for i in input().split())

x = A + B
y = C + D

if x > y:
    print('Left')
elif x < y:
    print('Right')
else:
    print('Balanced')

Buggy submission (verdict: Runtime Error):
a,b,c,d = (int(i) for i in input(.split()))

x = a + b
y = c + d

if x > y:
    print('Left')
elif x < y:
    print('Right')
else:
    print('Balanced')
Problem p03493 (python)

Fixed submission:
a = input()
a = list(a)
x = int(a[0])
y = int(a[1])
z = int(a[2])

if x + y + z == 0:
    print('0')
elif x + y + z == 1:
    print('1')
elif x + y + z == 2:
    print('2')
elif x + y + z == 3:
    print('3')

Buggy submission (verdict: Runtime Error):
a,b,c = (int(i) for i in input().split())

if a + b + c == 0:
    print(0)
elif a + b + c == 1:
    print(1)
elif a + b + c == 2:
    print(2)
elif a + b + c == 3:
    print(3)
Problem p03494 (python)

Fixed submission:
n = int(input())
b = list(map(int, input().strip().split()))


num = 0
for j in range(100):
    count = 0
    for i in range(n):
        if b[i] % 2 == 0:
            count = 1 + count


    if count == n:
        b = [c/2 for c in b]
        num = 1 + num

print(num)

Buggy submission (verdict: Runtime Error):
n = int(input())
b = list(map(int, input().strip().split()))


num = 0
for j in range(100):
    count = 0
    for i in range(a):
        if b[i] % 2 == 0:
            count = 1 + count


    if count == a:
        b = [c/2 for c in b]
        num = 1 + num

print(num)

Buggy submission (verdict: Runtime Error):
a = int(input())
b = [int(input()) for x in range(a)]


num = 0
for j in range(100):
    count = 0
    for i in range(a):
        if b[i] % 2 == 0:
            count = 1 + count


    if count == a:
        b = [c/2 for c in b]
        num = 1 + num

print(num)
Problem p02663 (python)

Fixed submission:
h1,m1,h2,m2,k = input().split()
s = (int(h2)-int(h1))*60 +(int(m2)-int(m1)) -int(k)
print(s)

Buggy submission (verdict: Runtime Error):
h1,m1,h2,m2,k = int(input().split()) 
s = (h2-h1)*60 +(m2-m1) -k
print(s)

Buggy submission (verdict: Runtime Error):
h1,m1,h2,m2,k = int(input()).split()
print((h2-h1)*60+(m2-m1+k))
Problem p02664 (python)

Fixed submission:
l1 = list(input())
k = l1.count('?')
for i in range(len(l1)):
  if l1[i] == '?':
    l1[i] = 'D'
s = ''.join(l1)
print(s)

Buggy submission (verdict: Runtime Error):
l1 = list(input())
k = l1.count('?')
for i in range(l1):
  if l1[i] == '?':
    l1[i] = 'D'
s = l1.join('')
print(s)
Problem p02687 (python)

Fixed submission:
S = input()
if S == 'ABC':
  print('ARC')
else:
  print('ABC')

Buggy submission (verdict: Runtime Error):
s = input()
if input() == 'ABC':
  print('ARC')
else:
  print('ABC')
Problem p02741 (python)

Fixed submission:
x = '1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51'
l = list(x.split(','))
i = int(input())
s = str(l[i-1])
print(s.replace(' ',''))

Buggy submission (verdict: Runtime Error):
x = '1, 1, 1, 2, 1, 2, 1, 5, 2, 2, 1, 5, 1, 2, 1, 14, 1, 5, 1, 5, 2, 2, 1, 15, 2, 2, 5, 4, 1, 4, 1, 51'
l = list(x.split(','))
i = int(input())
s = str(l[i])
print(s.replace(' ',''))
Problem p02690 (python)

Fixed submission:
x = int(input())
for i in range(-120, 120):
    for j in range(-120, 120):
        if i**5+j**5 == x:
            print(i,-j)
            exit(0)

Buggy submission (verdict: Runtime Error):
x = int(input()
for i in range(120):
  for j in range(120):
    if i**5-j**5 == x:
        print(i, j)
        break

Buggy submission (verdict: Runtime Error):
x = int(input()
for i in range(120):
  for j i range(120):
    if i**5-j**5 == x:
        print(i, j)
        break
Problem p02705 (python)

Fixed submission:
print(2*3.141592653589793238*int(input()))

Buggy submission (verdict: Runtime Error):
a, b = input().split()
lis = list(map(int, input().split()))
print(int(a) - sum(lis) if int(a)>sum(lis) else "-1")
Problem p02706 (python)

Fixed submission:
a, b = input().split()
lis = list(map(int, input().split()))
print(int(a) - sum(lis) if int(a) >= sum(lis) else "-1")

Buggy submission (verdict: Runtime Error):
import math
print(2*math.pi*int(input()))
Problem p02717 (python)

Fixed submission:
b, c, a= input().split()
print(a, b, c)

Buggy submission (verdict: Runtime Error):
c, a, b= input().split()
Print(a, b, c)