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

Fixed submission:
N=int(input())
ans=0
for i in range(N):
    x,u=map(str,input().split())
    x=float(x)
    if u=="JPY":
        ans+=x
    else:
        ans+=380000.0*x
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
x = [0] * N
u = [0] * N

ans = []

btc_1 = 380000.0


for i in range(N):
    x[i],u[i] = map(int, input().split())

        if u[i] == "JPY":
            ans.append(x[i])
    　　else:
        yen = ((x[i])*(btc_1))
        ans.append(yen)



print(sum(ans))

Buggy submission (verdict: Runtime Error):
N = int(input())
x = [0] * N
u = [0] * N
for i in range(N):
    x[i],u[i] = map(int, input().split())


ans = []

btc_1 = 380000.0

for i  in range(N):
    if u[i] == "JPY":
        ans.append(x[i])
    else:
        yen = ((x[i])*(btc_1))
        ans.append(yen)

print(sum(ans))

Buggy submission (verdict: Runtime Error):
N = int(input())
x = [0] * N
u = [0] * N
for i in range(N):
    x[i],u[i] = map(int, input().split())


ans = []

btc_1 = 380000.0

for i  in range(N):
    if u[i] == "JPY":
        ans.append(x[i])
    else:
        yen = ((x[i])*(btc_1))
        ans.append(yen)

print(sum(ans))

Buggy submission (verdict: Runtime Error):
N = int(input())
x = [0] * N
u = [0] * N
for i in range(N):
    x[i],u[i] = map(str, input().split())


ans = []

btc_1 = 380000.0

for i  in range(N):
    if u[i] == "JPY":
        ans.append(x[i])
    else:
        yen = ((x[i])*(btc_1))
        ans.append(yen)

print(sum(ans))

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

x = [0] * N
u = [0] * N

for i in range(N):
    x[i], u[i]  = map(int, input().split())


ans = []

btc_1 = 380000.0

for i  in range(N):
    if u[i] == "JPY":
        ans.append(x[i])
    else:
        yen = ((x[i])*(btc_1))
        ans.append(yen)

print(sum(ans))

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

x = [0] * N
u = [0] * N

for i in range(N):
    x[i], u[i]  = map(int, input().split())


ans = []

btc_1 = 380000.0

for i  in range(N):
    if u[i] == "JPY":
        ans.append(x[i])
    else:
        yen = ((x[i])*(btc_1)
        ans.append(yen)

print(sum(ans))

Buggy submission (verdict: Runtime Error):
a
Problem p03125 (python)

Fixed submission:
a,b = map(int,input().split())
 
if b % a == 0:
    print(a+b)
else:
    print(b-a)

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

BDA = B/A

if isinstance(n, int) == True:
    print(A+B)
else:
    print(A-B)
Problem p03126 (python)

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

all_lis = []

for i in range(N):
    A = list(map(int, input().split()))
    A.pop(0)
    all_lis.extend(A)

ans = 0
ans_lis2 = []

for j in set(all_lis):
    ans = all_lis.count(j)
    ans_lis2.append(ans)

ans2 = 0 
for k in ans_lis2:
    if k == N:
        ans2 = ans2 + 1

print(ans2)

Buggy submission (verdict: Runtime Error):
a
Problem p03136 (python)

Fixed submission:
N = int(input())
L = sorted([int(_) for _ in input().split()])
if L[N - 1] < sum(L[:N - 1]):
    print('Yes')
else:
    print('No')

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


L_max = max(L)

L_Down = L.sort(reverse=True)

L_Down_Re = L.Down[1:len(L_Down)]

L_Down_Re_Sum =  sum(L_Down_Re)

if L_max <= L_Down_Re_Sum:
    print("No")
else:
    print("Yes")
Problem p03145 (python)

Fixed submission:
x,y,r = map(int,input().split())

AREA = x*y

AREA2 =(AREA//2) 


print(AREA2)

Buggy submission (verdict: Runtime Error):
x,y,r = map(int,input().split())

AREA = ((x*Y)/2)


print(AREA)
Problem p03147 (python)

Fixed submission:
N = int(input())
h = [int(x) for x in input().split()]
count = 0
con = 0
while True:
    for i in range(N):
        if h[i] > 0:
            h[i] -= 1
            con = 1
        elif h[i] <= 0:
            if con == 1:
                count += 1
            con = 0
    if con == 1:
        count += 1
    con = 0
    if not any(h):
        break

print(count)

Buggy submission (verdict: Runtime Error):
import sys 
N = int(input())
flowerlis = list(map(int, input().split())) 

minihigh = min(flowerlis)

count = 0

if minihigh == 0:
    pass
else:
    count = minihigh

    for i in range(len(flowerlis)):
        flowerlis[i] = flowerlis[i] - 1





while True:
    for i in range(len(flowerlis)):
        if flowerlis[i] != 0:
            start = i
            break

    for j in range(start, len(flowerlis)):
        if flowerlis[j] == 0:
            finish = j
            break

    count = count + 1
    for  k in range(start,finish):
        flowerlis[k] = flowerlis[k] - 1
        
    if flowerlis.count(0) == len(flowerlis):
        print(count)
        break

Buggy submission (verdict: Runtime Error):
難しい...
Problem p03156 (python)

Fixed submission:
N = int(input())
A, B = map(int, input().split())
P = list(map(int, input().split()))
ans1 = 0
ans2 = 0
ans3 = 0  
for i in P:
    if A>=i:
        ans1 = ans1 + 1
    if A+1 <= i <= B:
        ans2 = ans2 + 1
    if B+1 <= i:
        ans3 = ans3 + 1 


print(min(ans1,ans2,ans3))

Buggy submission (verdict: Runtime Error):
N = int(input())
A, B = map(int, input().split())
P = listans1 = 0
ans2 = 0
ans3 = 0  
for i in P:
    if A>=i:
        ans1 = ans1 + 1
    if A+1 <= i <= B+1:
        ans2 = ans2 + 1
    if B+1 <= i:
        ans3 = ans3 + 1 


print(min(ans1,ans2,ans3))
Problem p03206 (python)

Fixed submission:
D = int(input())

if D == 25:
    print("Christmas")
elif D == 24:
    print("Christmas Eve")
elif D == 23:
    print("Christmas Eve Eve")
elif D == 22:
    print("Christmas Eve Eve Eve")

Buggy submission (verdict: Runtime Error):
D = input()

if D == 25:
    print("Christmas")
elif D == 24:
    print("Christmas Eve")
elif: D == 23:
    print("Christmas Eve Eve")
elif: D == 22:
    print("Christmas Eve Eve Eve")

Buggy submission (verdict: Runtime Error):
D = input()

if D == 25:
    print("Christmas")
elif D==24:
    print("Christmas Eve")
elif: D==23:
    print("Christmas Eve Eve")
elif: D ==22:
    print("Christmas Eve Eve Eve")
Problem p03219 (python)

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

Re_Y = Y//2


print(X + Re_Y)

Buggy submission (verdict: Runtime Error):
N = int(input())
T = int(input())
A = int(input())
H = list(map(int, input().split()))

ans_l = []

for i in range(N):
    mater = H[i]
    Temp = (T - (mater*0.006))
    ans = abs(A - Temp)
    ans_l.append(ans)
 
ans_mini = min(ans_l)

ans_posi =[]

for h in range(N):
    if ans_l[h] == ans_mini:
        ans2 = h+1
        ans_posi.append(ans2)


for j in ans_posi:
    print(j,end="")
Problem p03220 (python)

Fixed submission:
N = int(input())
T,A = map(int, input().split())
H = list(map(int, input().split()))


ans_l = []

for i in range(N):
    mater = H[i]
    Temp = (T - (mater*0.006))
    ans = abs(A - Temp)
    ans_l.append(ans)


ans_mini = min(ans_l)

ans_posi =[]

for h in range(N):
    if ans_l[h] == ans_mini:
        ans2 = h+1
        ans_posi.append(ans2)


for j in ans_posi:
    print(j,end="")

Buggy submission (verdict: Runtime Error):
N = int(input())
T = int(input())
A = int(input())
H = list(map(int, input().split()))

ans_l = []

for i in range(N):
    mater = H[i]
    Temp = (T - (mater*0.006))
    ans = abs(A - Temp)
    ans_l.append(ans)


ans_mini = min(ans_l)

ans_posi =[]

for h in range(N):
    if ans_l[h] == ans_mini:
        ans2 = h+1
        ans_posi.append(ans2)


for j in ans_posi:
    print(j,end="")

Buggy submission (verdict: Runtime Error):
N = int(input())
T = int(input())
A = int(input())
H = list(map(int, input().split()))

ans_l = []

for i in range(N):
    mater = H[i]
    Temp = (T - (mater*0.006))
    ans = abs(A - Temp)
    ans_l.append(ans)
 
ans_mini = min(ans_l)

ans_posi =[]

for h in range(N):
    if ans_l[h] == ans_mini:
        ans2 = h+1
        ans_posi.append(ans2)


for j in ans_posi:
    print(j,end="")

Buggy submission (verdict: Runtime Error):
N = int(input())
T = int(input())
A = int(input())
H = list(map(int, input().split()))

ans_l = []

for i in range(N):
    mater = H[i]
    Temp = (T - (mater*0.006))
    ans = abs(A - Temp)
    ans_l.append(ans)
 
ans_min = min(ans_l)

ans_posi =[]

for h in range(N):
    if ans_l[h] == ans_min:
        ans2 = h+1
        ans_posi.append(ans2)


for j in ans_posi:
    print(j,end="")

Buggy submission (verdict: Runtime Error):
N = int(input())
T = int(input())
A = int(input())
H = list(map(int, input().split()))

ans_l = []

for i in range(N):
    mater = H[i]
    Temp = (T - (mater*0.006))
    ans = abs(A - Temp)
    ans_l.apped(ans)

ans_min = min(ans_l)

print(ans_l.count(ans_min))
Problem p03238 (python)

Fixed submission:
n = int(input())
 
if n==1:
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A+B)

Buggy submission (verdict: Runtime Error):
N,T = map(int, input().split())

ans = []

for i in range(N):
    c,t = map(int, input().split())
    if T > t[i]:
        number = c[i]
        ans.appned(number)
    

if len(ans) == 0:
    print("TLE")
else:
    print(min(ans))
Problem p03239 (python)

Fixed submission:
N, T = map(int,input().split())
c = []
t = []

for i in range(N):
  c1, t1 = map(int,input().split())
  c.append(c1)
  t.append(t1)
  
ans = []

for i in range(N):
  if t[i] <= T:
    ans.append(c[i])

if len(ans) == 0:
  print("TLE")
else:
  print(min(ans))

Buggy submission (verdict: Runtime Error):
N,T = map(int, input().split())

ans = []

for i in range(N):
    c,t = list(map(int, input().split()))
    if T > t[i]:
        number = c[i]
        ans.appned(number)
    

if len(ans) == 0:
    print("TLE")
else:
    print(min(ans))

Buggy submission (verdict: Runtime Error):
N,T = map(int, input().split())

ans = []

for i in range(N):
    c,t = map(int, input().split())
    if T > t[i]:
        ans.appned(c[i])
    

if len(ans) == 0:
    print("TLE")
else:
    print(min(ans))

Buggy submission (verdict: Runtime Error):
N,T = map(int, input().split())

ans = []

for i in range(N):
    c,t = map(int, input().split())
    if T > t:
        ans.appned(c)
    

if len(ans) == 0:
    print("TLE")
else:
    print(min(ans))
Problem p03251 (python)

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

x = list(map(int, input().split()))
y = list(map(int, input().split()))

max_x = (max(x) + 1) 

ok = 0
dame = 0

for i in y:
    if max_x <= i:
        ok = ok + 1
    else:
        dame = dame + 1

if dame != 0:
    print("War")
elif (X < max_x <= Y) and dame == 0:
    print("No War")
else:
    print("War")

Buggy submission (verdict: Runtime Error):
a
Problem p03260 (python)

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

A_B = (A*B) % 2

if A_B == 0:
    print("No")
else:
    print("Yes")

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

A_B = (A*B) % 2

if A_B == 0:
    print("No")
else:
    print("Yes")

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

A_B = A*B % 2

if A_B == 0:
    print("No")
else:
    print("Yes")
Problem p03261 (python)

Fixed submission:
N = int(input())
shiritori = list()

for a in range(N):
	shiritori.append(input())

ans = "Yes"

for i in shiritori:
    if shiritori.count(i) != 1:
        ans = "No"
        break
    
for k in range(N-1):
    first = shiritori[k]
    second = shiritori[k+1]
    if first[-1] != second[0]:
        ans = "No"
        break


    
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
shiritori = [input() for i in range(n)]


ans = "Yes"

for i in shiritori:
    if shiritori.count(i) != 1:
        ans = "No"
        break
    
for k in range(N-1):
    first = shiritori[k]
    second = shiritori[k+1]
    if first[-1] != second[0]:
        ans = "No"
        break


    
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
shiritori = [input() for i in range(n)]

shiritori.append(w)

ans = "Yes"

for i in shiritori:
    if shiritori.count(i) != 1:
        ans = "No"
        break
    
for k in range(N-1):
    first = shiritori[k]
    second = shiritori[k+1]
    if first[-1] != second[0]:
        ans = "No"
        break


    
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
shiritori = [str(input())]

shiritori.append(w)

ans = "Yes"

for i in shiritori:
    if shiritori.count(i) != 1:
        ans = "No"
        break
    
for k in range(N-1):
    first = shiritori[k]
    second = shiritori[k+1]
    if first[-1] != second[0]:
        ans = "No"
        break


    
print(ans)

Buggy submission (verdict: Runtime Error):
N = int(input())
w = input()
shiritori = []

shiritori.append(w)

ans = "Yes"

for i in shiritori:
    if shiritori.count(i) != 1:
        ans = "No"
        break
    
for k in range(N-1):
    first = shiritori[k]
    second = shiritori[k+1]
    if first[-1] != second[0]:
        ans = "No"
        break


    
print(ans)
Problem p03262 (python)

Fixed submission:
import sys
import math


N, X = map(int, input().split())
A = list(map(int, input().split()))

A.append(X)
A = sorted(A)

anslis = [0]*N
for i in range(N):
    anslis[i] = A[i+1] - A[i]

g = anslis.pop(0)
for c in anslis:
    g = math.gcd(g,c)

print(g)

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


N, X = map(int, input().split())
A = list(map(int, input().split()))

if N == 1:
    print(A[0]-X)
    sys.exit()

A.append(X)
A = sorted(A)

anslis = [0]*N

for i in range(N):
    anslis[i] = A[i+1] - A[i]

g = anslis.pop(0)
for c in cost_li:
    g = math.gcd(g,c)

print(g)

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


N, X = 3,3
A = [1,7,11]

if N == 1:
    print(A[0]-X)
    sys.exit()

A.append(X)
A = sorted(A)

anslis = [0]*N

for i in range(N):
    anslis[i] = A[i+1] - A[i]

g = anslis.pop(0)
for c in cost_li:
    g = math.gcd(g,c)

print(g)
Problem p03264 (python)

Fixed submission:
K = int(input())

even = (K//2)
odd = K-(even)

print(odd*even)

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

A.sort(reverse=True)

print(A[0]-A[2])

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

B = A.sort(reverse=True)

print(B[0] - B[2])
Problem p03285 (python)

Fixed submission:
n=int(input())
for i in range(100):
    for j in range(100):
        if 4*i+7*j==n:
            print("Yes")
            exit(0)
print("No")

Buggy submission (verdict: Runtime Error):
N = int(input())
 
ans = 0
 
for i in range(100):
    for j in range(100):
        if (i*4) + (y*7) == N:
            ans = ans+1
            

if ans == 0:
    print("No")
else:
    print("Yes")

Buggy submission (verdict: Runtime Error):
N = int(input())
 
ans = 0
 
for i in range(100):
    for j in range(100):
        if (i*4) + (y*7) == N:
            ans = ans+1
            

if ans == 0:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
N = int(input())
 
ans = 0
 
for i in range(100):
    for j in range(100):
        if (i*4) + (y*7) == N:
            ans = ans+1
            
 
if ans==0:
    print("Yes")
else:
    print("No")

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

ans = 0

for i in range(100):
    for j in range(100):
        if (i*4) + (y*7) == N:
            ans = ans+1
            

if ans==0:
    print("Yes")
else:
    print("No")

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

ans = 0

for i in range(100):
    for j in range(100):
        if (i*4) + (y*7) == N:
            ans = ans+1
            

if ans==0:
    print("Yes")
else:
    print("No")
Problem p03288 (python)

Fixed submission:
R = int(input())

if R < 1200:
    print("ABC")
elif  R < 2800:
    print("ARC")
else:
    print("AGC")

Buggy submission (verdict: Runtime Error):
if A[0] == "A" and  big == 2 and CNUM == 1 and A[-1] != "C":  
    print("AC")
else:
    print("WA")

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

if R < 1200:
    print("ABC")
elif 1200 < R < 2800:
    print("ARC")
elif 2800 < R
    print("AGC")

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

if R < 1200:
    print("ABC")
elif 1200 < R < 2800:
    print("ARC")
elif 2800 < R
    print("AGC")
Problem p03292 (python)

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

A.sort(reverse=True)

print(A[0]-A[2])

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

B = A.sort(reverse=True)

print(B[0] - B[2])
Problem p03323 (python)

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

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

Buggy submission (verdict: Runtime Error):
N = int(input())
*A, = map(int, input().split())
ans = 0
for a in A:
  while a % 2 == 0:
    a //= 2
    ans += 1
print(ans)
Problem p03351 (python)

Fixed submission:
a,b,c,d = map(int,input().split())
B_A = abs(b - a)
C_B = abs(c - b)
C_A = abs(c - a)
if B_A <= d and C_B <=d:
    print('Yes')
elif C_A <= d:
    print('Yes')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
a,b,c,d = map(int,input().split())
B-A = abs(b - a)
C-B = abs(c - b)
C-A = abs(c - a)
if B-A <= d and C-B <=d:
    print('Yes')
elif C-A <= d:
    print('Yes')
else:
    print('No')

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

B-A = abs(b-a)
C-B = abs(c-b)
C-A = abs(c-a)

if B-A <= d and C-B <= d:
    print("Yes")
elif c-a =< d:
    print("Yes") 
else:
    print("No")

Buggy submission (verdict: Runtime Error):
a, b, c, d = map(int, input().split())
 
B-A = abs(b - a)
B-C = abs(c - b)
C-A = abs(a - c)
 
if (B-A <= d and B-C <= d) or C-A <= d:
    print("Yes")
else:
    print("No")

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

B-A = abs(b-a)
C-B = abs(c-b)
C-A = abs(c-a)

if B-A <= d and C-B <= d:
    print("Yes")
elif c-a =< d:
    print("Yes") 
else:
    ("No")

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

B-A = (b-a)
C-B = (c-b)
C-A = (c-a)
if abs(B-A) <= d and abs(C-B) <= d:
    print("Yes")
elif abs(c-a) =< d:
    print("Yes") 
else:
    ("No")

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

B-A = (b-a)
C-B = (c-b)
C-A = (c-a)
if B-A <= d and C-B <= d:
    print("Yes")
elif c-a =< d:
    print("Yes") 
else:
    ("No")

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

B-A = (b-a)
C-B = (c-b)
C-A = (c-a)
if B-A <= d and C-B <= d:
    print("Yes")
elif c-a =< d:
    print("Yes") 
else:
    ("No")
Problem p03352 (python)

Fixed submission:
x = int(input())

m = 1

for i in range(1, 32):
    for j in range(2, 10):
        p = pow(i, j)
        if p > x:
            break
        if p > m:
            m = p

print(m)

Buggy submission (verdict: Runtime Error):
z
Problem p03359 (python)

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

if a > b:
    print(a-1)
else:
    print(a)

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

ABC_1 = sorted(ABC)
ABC_2 = ABC_1[:-1]

ABC_MAX = ((max(ABC))*2)**K

ABC_3 = sum(ABC_2)



print((ABC_MAX) + (ABC_3))
Problem p03360 (python)

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

ABC_1 = sorted(ABC)

ABC_1[-1] = ABC_1[-1]*2**K

print(sum(ABC_1))

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

ABC_1 = sorted(ABC)

ABC_1[-1] = ABC_1[-1]*2**K

print(sum(ABC_1))
Problem p03369 (python)

Fixed submission:
S = input()

S2 = S.count("o")

print(700 + (100*S2))

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

m = [input() for _ in range(N)]

ans1 = X

MING = min(m)

for i in range(N):
    ans1 = ans1 - (m[i])

REST = (ans1)//(MING)

print((REST) + (N))

#この時点でのans1は残りの材量gを示している。
#現時点でN個作成できている。
# m[0] の数をans//で答えて　N+これ
Problem p03370 (python)

Fixed submission:
N, X = map(int, input().split())
m = []
for _ in range(N):
    m.append(int(input()))

SUM = sum(m)
MIN = min(m)


if SUM < X:
    REST = X - (SUM)
    ans = REST//MIN
    print(ans + N)
    
else:
    print(N)

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

m = [input() for _ in range(N)]



MING = min(m)

for i in range(N):
    X = X - (m[i])

REST = (X)//(MING)

print((REST) + (N))

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

m = [input() for _ in range(N)]

ans1 = X

MING = min(m)

for i in range(N):
    ans1 = ans1 - (m[i])

REST = (ans1)//(MING)

print((REST) + (N))

#この時点でのans1は残りの材量gを示している。
#現時点でN個作成できている。
# m[0] の数をans//で答えて　N+これ

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

m = [input() for i in range(N)]

ans1 = X

MING = min(m)

for i in range(N):
    ans1 = ans1 - (m[i])

REST = (ans1)//(MING)

print((REST) + (N))
Problem p03371 (python)

Fixed submission:
A,B,C,X,Y = map(int, input().split())

ABpizza = C*2
cost = 0
if ABpizza <= A+B:
    tmp = min(X,Y)
    cost = cost + ABpizza * tmp
    X = X - tmp
    Y = Y - tmp

    if (cost + X*A + Y*B) >= (cost + (max(X,Y)*ABpizza)):
        cost = cost + ((max(X,Y)*ABpizza))
    else:
        cost = (cost + X*A + Y*B)
else:
    cost = (A*X) + (B*Y)

print(cost)

Buggy submission (verdict: Runtime Error):
ABpizza = C*2
cost = 0
if ABpizza <= A+B:
    tmp = min(X,Y)
    cost = cost + ABpizza * tmp
    X = X - tmp
    Y = Y - tmp

    if (cost + X*A + Y*B) >= (cost + (max(X,Y)*ABpizza)):
        cost = cost + ((max(X,Y)*ABpizza))
    else:
        cost = (cost + X*A + Y*B)
else:
    cost = (A*X) + (B*Y)

print(cost)
Problem p03379 (python)

Fixed submission:
n=int(input())
x=list(map(int,input().split()))
y=sorted(x)
k,l=y[n//2-1],y[n//2]
for i in range(n):
    if x[i]<=k:
        print(l)
    else:
        print(k)

Buggy submission (verdict: Runtime Error):
fuckoff
Problem p03400 (python)

Fixed submission:
n = int(input())
d,x = map(int,input().split())
a=[]
for i in range(n):
    a.append(int(input()))
s = 0
for i in range(n):
    day = 1
    while(day<=d):
        s += 1
        day += a[i]
print(s+x)

Buggy submission (verdict: Runtime Error):
a
Problem p03408 (python)

Fixed submission:
N = int(input())
s = []
for _ in range(N):
    s.append(input())

M = int(input())
t = []
for _ in range(M):
    t.append(input())


ans = []
for i in s:
    plus = s.count(i)
    minus = t.count(i)

    score = (plus - minus)
    ans.append(score)

if max(ans) < 0:
    print(0)
else:
    print(max(ans))

Buggy submission (verdict: Runtime Error):
a
Problem p03415 (python)

Fixed submission:
a = input()
b = input()
c = input()

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

Buggy submission (verdict: Runtime Error):
C11,C12,C13 = map(int, input().split())
C21,C22,C23 = map(int, input().split())
C31,C32,C33 = map(int, input().split())

print(C11+C22+C33)
Problem p03433 (python)

Fixed submission:
N = int(input())
A = int(input())

#枚数
number=(N//500)

#端数を弾く
Rest = (N-(number*500))

if Rest <= A:
    print("Yes")
else:
    print("No")

Buggy submission (verdict: Runtime Error):
import sys 
c11, c12, c13 = map(int, input().split())
c21, c22, c23 = map(int, input().split())
c31, c32, c33 = map(int, input().split())

N = 101

for i in range(N):
    a1 = i

    b1 = c11 - a1
    b2 = c12 - a1
    b3 = c13 - a1

    a2 = c21 - b1
    a3 = c31 - b1

    if c22 == a2+b2 and c23 == a2 + b3 and c33 == a3+b3:
        print("Yes")
        sys.exit()

print("No")