Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
x,y,r = map(int,input().split())

AREA = ((x*Y)/2)


print(AREA)

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

AREA = x*y

AREA2 =(AREA//2) 


print(AREA2)
Buggy python 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

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 python submission (verdict: Runtime Error):
難しい...

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 python 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))

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 python 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")

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 python 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")

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 python submission (verdict: Runtime Error):
import sys
input = sys.stdin.readline
import numpy as np


N = int(input())

p = []

for _ in raneg(N):
    p.append(int(input()))


new_p = sorted(p, reverse=True)

new_p[0] = new_p[0]//2

print(sum(new_p))

Fixed submission:
N = int(input())
p = []
for _ in range(N):
    p.append(int(input()))
p = sorted(p)
p[-1] = p[-1]//2
print(sum(p))

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

p = []

for _ in raneg(N):
    p.append(int(input()))


new_p = sorted(p, reverse=True)

new_p[0] = new_p[0]//2

print(sum(new_p))


Fixed submission:
N = int(input())
p = []
for _ in range(N):
    p.append(int(input()))
p = sorted(p)
p[-1] = p[-1]//2
print(sum(p))

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

p = []

for _ in raneg(N):
    p.append(int(input()))


new_p = sorted(p, reverse=True)

p_max = (new_p[0]/2)

NEW_p = (new_p[1:len(new_p)])

NEWP_SUM = sum(NEW_p)

print(int((p_max) + (NEWP_SUM)))

Fixed submission:
N = int(input())
p = []
for _ in range(N):
    p.append(int(input()))
p = sorted(p)
p[-1] = p[-1]//2
print(sum(p))

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

p = []

for i in raneg(N):
    p.append(int(input()))


new_p = sorted(p, reverse=True)

p_max = (new_p[0]/2)

NEW_p = (new_p[1:len(new_p)])

NEWP_SUM = sum(NEW_p)

print(int((p_max) + (NEWP_SUM)))

Fixed submission:
N = int(input())
p = []
for _ in range(N):
    p.append(int(input()))
p = sorted(p)
p[-1] = p[-1]//2
print(sum(p))

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

p = []

for i in raneg(N):
    P = int(input())
    p.append(P)


new_p = sorted(p, reverse=True)

p_max = (new_p[0]/2)

NEW_p = (new_p[1:len(new_p)])

NEWP_SUM = sum(NEW_p)

print(int((p_max) + (NEWP_SUM)))

Fixed submission:
N = int(input())
p = []
for _ in range(N):
    p.append(int(input()))
p = sorted(p)
p[-1] = p[-1]//2
print(sum(p))
Buggy python 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="")

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

Re_Y = Y//2


print(X + Re_Y)
Buggy python 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))        
    

Fixed submission:
n = int(input())
 
if n==1:
  print("Hello World")
else:
  A = int(input())
  B = int(input())
  print(A+B)
Buggy python 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))        

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 python 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))    

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 python 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))        
    


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 python submission (verdict: Runtime Error):
a

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 python 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")

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

A_B = (A*B) % 2

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

Buggy python 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")

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

A_B = (A*B) % 2

if A_B == 0:
    print("No")
else:
    print("Yes")
Buggy python 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)


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 python 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)

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 python 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)

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 python 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)

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 python 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)

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 python 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)

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 python submission (verdict: Runtime Error):
A = list(map(int, input().split()))

A.sort(reverse=True)

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

Fixed submission:
K = int(input())

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

print(odd*even)

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

B = A.sort(reverse=True)

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

Fixed submission:
K = int(input())

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

print(odd*even)
Buggy python submission (verdict: Runtime Error):
a

Fixed submission:
x1, y1, x2, y2 = map(int, input().split())

X = x2 - x1
Y = y2 - y1

print((x2-Y),(y2 + X),(x1-Y),(y1 + X))
Buggy python 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")

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 python 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")

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 python 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")

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 python 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")


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 python 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")

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 python submission (verdict: Runtime Error):
if A[0] == "A" and  big == 2 and CNUM == 1 and A[-1] != "C":  
    print("AC")
else:
    print("WA")

Fixed submission:
R = int(input())

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

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

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

Fixed submission:
R = int(input())

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

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

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

Fixed submission:
R = int(input())

if R < 1200:
    print("ABC")
elif  R < 2800:
    print("ARC")
else:
    print("AGC")
Buggy python submission (verdict: Runtime Error):
A = list(map(int, input().split()))

B = A.sort(reverse=True)

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

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

A.sort(reverse=True)

print(A[0]-A[2])
Buggy python submission (verdict: Runtime Error):
import math
n = int(input())
a = 2


def lcm(x, y):
    return (x * y) // math.gcd(x, y)

print(lcm(a, n))

Fixed submission:
n = int(input())
print(2*n if n%2 else n)
Buggy python 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)

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

if A <= 8 and B <= 8:
    print("Yay!")
else:
    print(":(")
Buggy python 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')

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 python 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")

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 python 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")


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 python 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")


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 python 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")


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 python 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")

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 python 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")

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 python submission (verdict: Runtime Error):
z

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 python 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))

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

if a > b:
    print(a-1)
else:
    print(a)
Buggy python 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))

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 python 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+これ

Fixed submission:
S = input()

S2 = S.count("o")

print(700 + (100*S2))
Buggy python 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))

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 python 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+これ

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 python 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))

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 python 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)

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 python submission (verdict: Runtime Error):
fuckoff


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 python submission (verdict: Runtime Error):
a

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 python submission (verdict: Runtime Error):
a

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))