Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a,b=int(input()).split()

result = a * b
print(result)

Fixed submission:
a,b=(int(x) for x in input().split())

result = a * b
print(result)

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

result = a * c
print(result)

Fixed submission:
a,b=(int(x) for x in input().split())

result = a * b
print(result)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
num = [int(x) for x in input().split()]
a = 1

for i in num:
  a *= i
  
if a > 10**18:
    a = -1

print(a)

Fixed submission:
n = int(input())
l = [int(x) for x in input().split()]

if 0 in l:
    r=0
else:
    r = 1
    for x in range(n):
        r = r * l[x]
        if r > 10**18:
            r=-1
            break
  
print(r)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
num = [int(x) for x in input().split()]
a = 1
max = 10**18

for i in num:
  a *= i
  
a = -1 if a > max else a
print(a)

Fixed submission:
n = int(input())
l = [int(x) for x in input().split()]

if 0 in l:
    r=0
else:
    r = 1
    for x in range(n):
        r = r * l[x]
        if r > 10**18:
            r=-1
            break
  
print(r)

Buggy python submission (verdict: Runtime Error):
n = int(input())
b = [int(x) for x in input().split()]
a = 1
max = 10**18

for i in b:
  a *= i
  
a = -1 if a > max else a
print(r)

Fixed submission:
n = int(input())
l = [int(x) for x in input().split()]

if 0 in l:
    r=0
else:
    r = 1
    for x in range(n):
        r = r * l[x]
        if r > 10**18:
            r=-1
            break
  
print(r)
Buggy python submission (verdict: Runtime Error):
l,r=map(int,input().split())
d=int(input())

l=l//d
r=r//d

print(r- l)


Fixed submission:
l,r,d = map(int,input().split())

if l%d ==0:
  print(r//d - l//d +1)
else:
  print(r//d-l//d)

Buggy python submission (verdict: Runtime Error):
l,r=map(int,input().split())
d=int(input())

print(r//d - l//d)

Fixed submission:
l,r,d = map(int,input().split())

if l%d ==0:
  print(r//d - l//d +1)
else:
  print(r//d-l//d)

Buggy python submission (verdict: Runtime Error):
l,r=map(int,input().split())
d=int(input())

print(r//d-l//d)

Fixed submission:
l,r,d = map(int,input().split())

if l%d ==0:
  print(r//d - l//d +1)
else:
  print(r//d-l//d)

Buggy python submission (verdict: Runtime Error):
l,r=map(int(input().split()))
d=int(input())

print(r//d-l//d)

Fixed submission:
l,r,d = map(int,input().split())

if l%d ==0:
  print(r//d - l//d +1)
else:
  print(r//d-l//d)
Buggy python submission (verdict: Runtime Error):
n = int(input())
for i in range(n):
  S[i]=input()

ac =0
wa =0
tle =0
re =0


for i in range(n):
  if S[i]=='AC':
    ac +=1
  elif S[i]=='WA':
    wa +=1
  elif S[i]=='TLE':
    tle +=1
  elif S[i]=='RE':
    re +=1

print('AC x ',ac)
print('WA x ',wa)
print('TLE x ',tle)
print('RE x ',re)

Fixed submission:
n = int(input())
S=[0]*n
for i in range(n):
  S[i]=input()

ac =0
wa =0
tle =0
re =0


for i in range(n):
  if S[i]=='AC':
    ac +=1
  elif S[i]=='WA':
    wa +=1
  elif S[i]=='TLE':
    tle +=1
  elif S[i]=='RE':
    re +=1

print('AC x ',ac)
print('WA x ',wa)
print('TLE x ',tle)
print('RE x ',re)
Buggy python submission (verdict: Runtime Error):
s,t = map(input().split())
c=0

for i in range(len(s)):
  if s[i]!=t[i]:
    c +=1

print(c)

Fixed submission:
s = input()
t =input()
c=0

for i in range(len(s)):
  if s[i]!=t[i]:
    c +=1

print(c)

Buggy python submission (verdict: Runtime Error):
s,t = map(input())
c=0

for i in range(len(s)):
  if s[i]!=t[i]:
    c +=1

print(c)

Fixed submission:
s = input()
t =input()
c=0

for i in range(len(s)):
  if s[i]!=t[i]:
    c +=1

print(c)

Buggy python submission (verdict: Runtime Error):
s,t = map(inut())
c=0

for i in range(len(s)):
  if s[i]!=t[i]:
    c +=1

print(c)

Fixed submission:
s = input()
t =input()
c=0

for i in range(len(s)):
  if s[i]!=t[i]:
    c +=1

print(c)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = map(int,input().split())
b =1

for i in range(n):
  b *= a[i]

if b >= 10**18:
  print(-1)
else:
  print(b)

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

if 0 in a:
  b=0
for i in range(n):
  b *= a[i]
  if b>10**18:
    b=-1
    break
  else:
    continue
print(b)
Buggy python submission (verdict: Time Limit Exceeded):
a,b,x =map(int,input().split())
c=0

for i in range(a,b+1):
  if i % x ==0:
    c+=1

print(c)

Fixed submission:
a,b,x = map(int, input().split())
 
print(b//x-(a-1)//x)

Buggy python submission (verdict: Time Limit Exceeded):
a,b,x =map(int,input().split())
c=0

for i in range(a,b+1):
  if i % x ==0:
    c+=1

print(c)

  



Fixed submission:
a,b,x = map(int, input().split())
 
print(b//x-(a-1)//x)
Buggy python submission (verdict: Runtime Error):
K = input()
A = input()
B = input()

list=[]
up = int(A)

for i  in  range(int(B)-int(A)):
	list = list + [up]
	up += 1
list = list + [up]

count = 0

for t in list:
	if int(t) % int(K) ==0:
  		count+=1

if count == 0:
  print('NG')
else:
  print('OK')
  		


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

list=[]
up = int(A)

for i  in  range(int(B)-int(A)):
	list = list + [up]
	up += 1
list = list + [up]

count = 0

for t in list:
	if int(t) % int(K) ==0:
  		count+=1

if count == 0:
  print('NG')
else:
  print('OK')
Buggy python submission (verdict: Runtime Error):
from math import floor,ceil
X = int(input())
cash = 100
count = 0
while cash < X:
    cash=floor(p*1.01)
    count += 1
print(count)

Fixed submission:
from math import floor,ceil
X = int(input())
 
p = 100
c = 0
while p < X:
    p=floor(p*1.01)
    c += 1
print(c)

Buggy python submission (verdict: Runtime Error):
from math import floor,ceil
X = int(input())

p = 100
c = 0
while cash < X:
    p=floor(p*1.01)
    c += 1
print(c)


Fixed submission:
from math import floor,ceil
X = int(input())
 
p = 100
c = 0
while p < X:
    p=floor(p*1.01)
    c += 1
print(c)

Buggy python submission (verdict: Runtime Error):
from math import floor,ceil
X = input()
X = int(X)
cash = 100
count = 0
while cash < X:
    cash=floor(p*1.01)
    count += 1
print(count)


Fixed submission:
from math import floor,ceil
X = int(input())
 
p = 100
c = 0
while p < X:
    p=floor(p*1.01)
    c += 1
print(c)
Buggy python submission (verdict: Runtime Error):
N = int(input())
str_list = [str(input()) for _ in range(N)]
count_ac = 0
count_wa = 0
count_tle = 0
count_re = 0

for s in str_list:
    if s == 'AC':
        count_ac = count_ac + 1
    elif s == 'WA':
        count_wa = count_wa + 1
    elif s == 'TLE':
        count_tle = count_tle + 1
    elif s == 'RE':
        coun_re == count_re + 1

print('AC x ' + str(count_ac))
print('WA x ' + str(count_wa))
print('TLE x ' + str(count_tle))
print('RE x ' + str(count_re))


Fixed submission:
N = int(input())
num = -(-N // 1000)
print(num * 1000 - N)
Buggy python submission (verdict: Runtime Error):
N = int(input())
str_list = [str(input()) for _ in range(N)]
count_ac = 0
count_wa = 0
count_tle = 0
count_re = 0

for s in str_list:
    if s == 'AC':
        count_ac = count_ac + 1
    elif s == 'WA':
        count_wa = count_wa + 1
    elif s == 'TLE':
        count_tle = count_tle + 1
    elif s == 'RE':
        coun_re == count_re + 1

print('AC x ' + str(count_ac))
print('WA x ' + str(count_wa))
print('TLE x ' + str(count_tle))
print('RE x ' + str(count_re))


Fixed submission:
N = int(input())
str_list = []
str_list = [str(input()) for i in range(N)]

print('AC x ' + str(str_list.count(('AC'))))
print('WA x ' + str(str_list.count(('WA'))))
print('TLE x ' + str(str_list.count(('TLE'))))
print('RE x ' + str(str_list.count(('RE'))))

Buggy python submission (verdict: Runtime Error):
N = int(input())
str_list = [input() for _ in range(N)]
count_ac = 0
count_wa = 0
count_tle = 0
count_re = 0

for s in str_list:
    if s == 'AC':
        count_ac = count_ac + 1
    elif s == 'WA':
        count_wa = count_wa + 1
    elif s == 'TLE':
        count_tle = count_tle + 1
    elif s == 'RE':
        coun_re == count_re + 1

print('AC x ' + str(count_ac))
print('WA x ' + str(count_wa))
print('TLE x ' + str(count_tle))
print('RE x ' + str(count_re))


Fixed submission:
N = int(input())
str_list = []
str_list = [str(input()) for i in range(N)]

print('AC x ' + str(str_list.count(('AC'))))
print('WA x ' + str(str_list.count(('WA'))))
print('TLE x ' + str(str_list.count(('TLE'))))
print('RE x ' + str(str_list.count(('RE'))))

Buggy python submission (verdict: Runtime Error):
N = int(input())
str_list = [input() for _ in range(N)]
count_ac = 0
count_wa = 0
count_tle = 0
count_re = 0

for s in str_list:
    if s == 'AC':
        count_ac = count_ac + 1
    elif s == 'WA':
        count_wa = count_wa + 1
    elif s == 'TLE':
        count_tle = count_tle + 1
    elif s == 'RE':
        coun_re == count_re + 1

print('AC x ' + str(count_ac))
print('WA x ' + str(count_wa))
print('TLE x ' + str(count_tle))
print('RE x ' + str(count_re))


Fixed submission:
N = int(input())
str_list = []
str_list = [str(input()) for i in range(N)]

print('AC x ' + str(str_list.count(('AC'))))
print('WA x ' + str(str_list.count(('WA'))))
print('TLE x ' + str(str_list.count(('TLE'))))
print('RE x ' + str(str_list.count(('RE'))))
Buggy python submission (verdict: Runtime Error):
H, W, K = map(int, input().split())
C = [ input() for i in range(H)]
ans = 0
for i in range(1 << H):
    for j in range(1 << W):
        cnt = 0
        for m in range(H):
            for n in range(W):
                if ((i >> m) & 1): 
                    continue
                if ((j >> n) & 1): 
                    continue
                if C[m][n] == '#':
                    cnt += 1
        if cnt == K: 
            ans += 1
        elif cnt != K:
print(ans)


Fixed submission:
H, W, K = map(int, input().split())
C = [ input() for i in range(H)]
ans = 0
for i in range(1 << H):
    for j in range(1 << W):
        cnt = 0
        for m in range(H):
            for n in range(W):
                if ((i >> m) & 1): 
                    continue
                if ((j >> n) & 1): 
                    continue
                if C[m][n] == '#':
                    cnt += 1
        if cnt == K: 
            ans += 1
        
print(ans)
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
sum = 0
for i in range(len(S)):
  if S[i-1] <> T[i-1]:
    sum = sum + 1
print(sum)  

Fixed submission:
S = input()
T = input()
sum = 0
for i in range(len(S)):
  if S[i-1] != T[i-1]:
    sum = sum + 1
print(sum)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

output = 1
for i in a:
    output *= i
    
if output > 10**18:
    output = -1
    
print(output)

Fixed submission:

n = int(input())
a = list(map(int, input().split()))
if 0 in a:
    output = 0
    
else:

    output = 1

    for i in a:
        output *= i
        if output > 10**18:
            output = -1
            break
        
    
print(output)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
ans = 1
 
for i in range(N):
  	ans *= A[i]
		if ans > 10**18:
    		print("-1")
        	break
print(ans)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
if 0 in A:
    print(0)
    exit()
ans=1
for i in A:
    ans*=i
    if ans>10**18:
        print(-1)
        exit()
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int, input().split()))
ans = 1
 
for i in range(N):
  	ans *= A[i]
	if ans > 10**18:
    	print("-1")
        break
print(ans)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
if 0 in A:
    print(0)
    exit()
ans=1
for i in A:
    ans*=i
    if ans>10**18:
        print(-1)
        exit()
print(ans)

Buggy python submission (verdict: Runtime Error):

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

for i in range(N):
  	ans *= A[i]
	if np.prod(A) > 10**18:
    	print("-1")
        break
print(ans)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
if 0 in A:
    print(0)
    exit()
ans=1
for i in A:
    ans*=i
    if ans>10**18:
        print(-1)
        exit()
print(ans)

Buggy python submission (verdict: Runtime Error):
import math
A, B = input().split()

print(math.floor(int(A)*float(B)))

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
if 0 in A:
    print(0)
    exit()
ans=1
for i in A:
    ans*=i
    if ans>10**18:
        print(-1)
        exit()
print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = list(map(int,input().split()))
ans = 1
for i in N:
    ans = A[i]*ans
    if ans > 10**18:
        print("-1")
        break
    print(ans)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
if 0 in A:
    print(0)
    exit()
ans=1
for i in A:
    ans*=i
    if ans>10**18:
        print(-1)
        exit()
print(ans)

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

for i in range(N):
    ans = ans*A[i]

if ans >= 10**18:
    print("-1")
else:
    print(ans)

Fixed submission:
N=int(input())
A=list(map(int,input().split()))
if 0 in A:
    print(0)
    exit()
ans=1
for i in A:
    ans*=i
    if ans>10**18:
        print(-1)
        exit()
print(ans)
Buggy python submission (verdict: Runtime Error):
S = input()
K = int(input())

if len(S) <= K:
  print(S)
else:
  print(S[0:K],"...")

Fixed submission:
K = int(input())
S = input()

if len(S) <= K:
  print(S)
else:
  print(S[0:K]+"...")

Buggy python submission (verdict: Runtime Error):
S = str(input())
K = int(input())

if len(S) <= K:
  print(S)
else:
  print(S[0:K],"...")

Fixed submission:
K = int(input())
S = input()

if len(S) <= K:
  print(S)
else:
  print(S[0:K]+"...")

Buggy python submission (verdict: Runtime Error):
S = map(str, input())
K = input()

if len(S) <= K:
  print(S)
else:
  print(S[0:K],"...")

Fixed submission:
K = int(input())
S = input()

if len(S) <= K:
  print(S)
else:
  print(S[0:K]+"...")
Buggy python submission (verdict: Runtime Error):
N = int(input())

if N%2 <> 0:
  print(int(N/2+1))
else:
  print(int(N/2))

Fixed submission:
N = int(input())

if not N%2 == 0:
  print(int(N/2+1))
else:
  print(int(N/2))
Buggy python submission (verdict: Runtime Error):
a = [list(map(int, input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _ in range(n)]
 
for num in b:
  for x in range(3):
    for y in range(3):
      if a[x][y] == num:
        a[x][y] = 0
 
if sum(a[0]) == 0 or sum(a[1]) == 0 or sum(a[2]) == 0:
  print("Yes")
elif sum([a[0][0],a[1][1],a[2][2]]) == 0 or sum([a[2][0],a[1][1],a[0][2]]) == 0:
  print("Yes")
elif sum([a[0][0],a[1][0],a[2][0]]) == 0 or sum([a[0][1],a[1][1],a[2][1]]) == 0 or sum([a[0][2],a[1][2],a[2][2]]) == 0:
  print("Yes")                                                 
else:
  print("No")
a = [list(map(int, input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _ in range(n)]

for num in b:
  for x in range(3):
    for y in range(3):
      if a[x][y] == num:
        a[x][y] = 0

if sum(a[0]) == 0 or sum(a[1]) == 0 or sum(a[2]) == 0:
  print("Yes")
elif sum([a[0][0],a[1][1],a[2][2]]) == 0 or sum([a[2][0],a[1][1],a[0][2]]) == 0:
  print("Yes")
elif sum([a[0][0],a[1][0],a[2][0]]) == 0 or sum([a[0][1],a[1][1],a[2][1]]) == 0 or sum([a[0][2],a[1][2],a[2][2]]) == 0:
  print("Yes")                                                 
else:
  print("No")

Fixed submission:
a = [list(map(int, input().split())) for _ in range(3)]
n = int(input())
b = [int(input()) for _ in range(n)]
 
for num in b:
  for x in range(3):
    for y in range(3):
      if a[x][y] == num:
        a[x][y] = 0
 
if sum(a[0]) == 0 or sum(a[1]) == 0 or sum(a[2]) == 0:
  print("Yes")
elif sum([a[0][0],a[1][1],a[2][2]]) == 0 or sum([a[2][0],a[1][1],a[0][2]]) == 0:
  print("Yes")
elif sum([a[0][0],a[1][0],a[2][0]]) == 0 or sum([a[0][1],a[1][1],a[2][1]]) == 0 or sum([a[0][2],a[1][2],a[2][2]]) == 0:
  print("Yes")                                                 
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
s = input()
if s.isupps = input()
if s.isupper():
    print('A')
else:
    print('a')

Fixed submission:
a = input()
print('a' if a.islower() else 'A')
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
A = list(map(int, input().split()))
ans = 1
for i in range(N):
  ans = ans*A[i]
if ans > 10**18:
  print('-1')
  exit()
print(ans)

Fixed submission:
N = int(input())
A = list(map(int, input().split()))
for i in range(N):
  if A[i]==0:
    print('0')
    exit()
ans = 1
for i in range(N):
  ans = ans*A[i]
  if ans > 10**18:
    print('-1')
    exit()
print(ans)
Buggy python submission (verdict: Runtime Error):
from math import floor
from decimal import Decimal
a,b = map(Dicimal, input().split())
c = a*b
print(floor(c))

Fixed submission:
from math import floor
from decimal import Decimal
a,b = map(Decimal, input().split())
c = a*b
print(floor(c))

Buggy python submission (verdict: Runtime Error):
from math import floor
from decimal import Decimal
a,b = map(Dicimal, input().split())
c = a*b
print(c)

Fixed submission:
from math import floor
from decimal import Decimal
a,b = map(Decimal, input().split())
c = a*b
print(floor(c))

Buggy python submission (verdict: Runtime Error):
a,b = map(float, input().split())
bb = b*100
c = a*bb/100
print(floor(c))

Fixed submission:
from math import floor
from decimal import Decimal
a,b = map(Decimal, input().split())
c = a*b
print(floor(c))
Buggy python submission (verdict: Runtime Error):
N,K = map(int, input().split())
L = []
for i in range(N):
  d = int(input())
  if d == 1:
    A = list(int(input()))
  else:
    A = list(map(int, input().split()))
  for j in range(d):
    L.append(A[j])
print(N-len(set(L)))


Fixed submission:
N,K = map(int, input().split())
L = []
for i in range(K):
  d = int(input())
  A = list(map(int, input().split()))
  for j in range(d):
    L.append(A[j])
print(N-len(set(L)))

Buggy python submission (verdict: Runtime Error):
N,K = map(int, input().split())
L = []
for i in range(N):
  d = int(input())
  if d == 1:
    A = int(input())
  else:
    A = list(map(int, input().split()))
  for j in range(d):
    L.append(A[j])
print(N-len(set(L)))


Fixed submission:
N,K = map(int, input().split())
L = []
for i in range(K):
  d = int(input())
  A = list(map(int, input().split()))
  for j in range(d):
    L.append(A[j])
print(N-len(set(L)))

Buggy python submission (verdict: Runtime Error):
N,K = map(int, input().split())
L = []
for i in range(N):
  d = int(input())
  A = list(map(int, input().split()))
  for j in range(d):
    L.append(A[j])
print(N-len(set(L)))

Fixed submission:
N,K = map(int, input().split())
L = []
for i in range(K):
  d = int(input())
  A = list(map(int, input().split()))
  for j in range(d):
    L.append(A[j])
print(N-len(set(L)))

Buggy python submission (verdict: Runtime Error):
N,K = map(int, input().split())
L = []
for i in range(N):
  d = int(input)
  A = list(map(int, input().split()))
  for j in range(d):
    L.append(A[j])
print(N-len(set(L)))

Fixed submission:
N,K = map(int, input().split())
L = []
for i in range(K):
  d = int(input())
  A = list(map(int, input().split()))
  for j in range(d):
    L.append(A[j])
print(N-len(set(L)))
Buggy python submission (verdict: Runtime Error):
import itertools
N,M,Q = map(int, input().split())
cand = list(itertools.combinations_with_replacement(N+M-1,N))
fs = [list(map(int, input().split())) for i in range(Q)]

def calc(fs,As):
  count = 0
  for a,b,c,d in fs:
    if As[b-1] - As[a-1] == a:
      count += d
	return count
ans = 0
for As in cand:
  ans = max(ans,calc(fs,As))

print(ans)

Fixed submission:
from itertools import combinations_with_replacement as cw
N,M,Q = map(int, input().split())
cand = cw([i+1 for i in range(M)],N)
fs = [list(map(int, input().split())) for i in range(Q)]

def calc(fs,As):
  count = 0
  for a,b,c,d in fs:
    if As[b-1] - As[a-1] == c:
      count += d
  return count
ans = 0
for As in cand:
  ans = max(ans,calc(fs,As))

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
import math
A,B,N = map(int, input().split())
judge = 0
for i in range(N+1):
  if judge < math.floor(A*i/B) - A*math.floor(i/B):
    judge = math.floor(A*i/B) - A*math.floor(i/B)
print(judge)

Fixed submission:
import math
A,B,N = map(int, input().split())
if B > N:
  a = N
else:
  a = B-1
judge = math.floor(A*a/B) - A*math.floor(a/B)
print(judge)
Buggy python submission (verdict: Runtime Error):
N = int(input())
T,A = map(int, input().split())
H = list[input()]
judge = abs(A - (T - 0.006*H[0]))
k = 0

for i in range(N):
  a = abs(A - (T - 0.006*H[i]))
  if judge > a:
    judge = a
    k = i
    
print(k)

Fixed submission:
N = int(input())
T,A = map(int, input().split())
H = list(map(int, input().split()))
judge = abs(A - (T - 0.006*H[0]))
k = 0

for i in range(N):
  a = abs(A - (T - 0.006*H[i]))
  if judge > a:
    judge = a
    k = i
    
print(k+1)
Buggy python submission (verdict: Runtime Error):
N = int(input())
A = [int(i) for i in input().split()]
sort.A
dif = A[N-1]-A[0]
print(dif)

Fixed submission:
N = int(input())
A = [int(i) for i in input().split()]
A.sort()
dif = A[N-1]-A[0]
print(dif)
Buggy python submission (verdict: Runtime Error):
S = list(map(str, input()))
count = 0
for i in range(3):
  if S[i] =  "o":
    count += 1

print(700+count*100)

Fixed submission:
S = list(map(str, input()))
count = 0
for i in range(3):
  if S[i] ==  "o":
    count += 1

print(700+count*100)
Buggy python submission (verdict: Runtime Error):
A = []
A = list(map(int, input().split()))
s,m,l = A.sort()
count = 0
difs = l-s
difm = l-m
count += difs//2 + difm//2
if difs%2 == 0 and difm%2 == 0:
  print(count)
elif difs%2 == 0 and difm%2 == 1:
  count += 2
  print(count)
else:
  count += 1
  print(count)
  


Fixed submission:
A = [int(i) for i in input().split()]
A.sort()
s,m,l = A
count = 0
ls = l-s
lm = l-m
count += ls//2
count += lm//2
if ls%2 == 0 and lm%2 == 0:
  print(count)
  exit()
elif ls%2 == 1 and lm%2 == 1:
  count += 1
  print(count)
else:
  count += 2
  print(count)

Buggy python submission (verdict: Runtime Error):
A = []
A = list(map(int, input().split()))
s = A.sort()[0]
m = A.sort()[1]
l = A.sort()[2]
count = 0
difs = l-s
difm = l-m
count += difs//2 + difm//2
if difs%2 == 0 and difm%2 == 0:
  print(count)
elif difs%2 == 0 and difm%2 == 1:
  count += 2
  print(count)
else:
  count += 1
  print(count)
  


Fixed submission:
A = [int(i) for i in input().split()]
A.sort()
s,m,l = A
count = 0
ls = l-s
lm = l-m
count += ls//2
count += lm//2
if ls%2 == 0 and lm%2 == 0:
  print(count)
  exit()
elif ls%2 == 1 and lm%2 == 1:
  count += 1
  print(count)
else:
  count += 2
  print(count)

Buggy python submission (verdict: Runtime Error):
A = []
A = list(map(int, input().split()))
s = A.sort()[0]
m = A.sort()[1]
l = A.sort()[2]
count = 0
difs = l-s
difm = l-m
count += difs//2 + difm//2
if difs%2 == 0 and difm%2 == 0:
  print(count)
elif difs%2 == 0 and difm%2 = 1:
  count += 2
  print(count)
else:
  count += 1
  print(count)
  


Fixed submission:
A = [int(i) for i in input().split()]
A.sort()
s,m,l = A
count = 0
ls = l-s
lm = l-m
count += ls//2
count += lm//2
if ls%2 == 0 and lm%2 == 0:
  print(count)
  exit()
elif ls%2 == 1 and lm%2 == 1:
  count += 1
  print(count)
else:
  count += 2
  print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
s = [input() for i in range(N)]
M = int(input())
t = [input() for i in range(M)]

judge = 0
for i in range(N):
  count = 0
  for j in range(i+1,N+1):
    for k in range(M):
      if s[i] == s[j]:
        count += 1
      if s[i] == t[k]:
        count -= 1
      if count > judge:
        judge = count
print(judge)
    

Fixed submission:
N = int(input())
s = [input() for i in range(N)]
M = int(input())
t = [input() for i in range(M)]

judge = 0
for i in range(N-1):
  count = 1
  for j in range(i+1,N):
    if s[i] == s[j]:
      count += 1
  for k in range(M):
    if s[i] == t[k]:
      count -= 1
  if count > judge:
    judge = count
print(judge)