Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import sys
from collections import Counter
N = int(input())
C = Counter(list(map(int, input().split())))
if len(C) == 1 and C[0] == N:
    print('Yes')
elif len(C) == 2 and N % 3 == 0 and C[0] == N // 3 and N - [0] == 2 * N // 3:
    print('Yes')
elif len(C) == 3 and N % 3 == 0:
    b = 0
    for c in C.most_common():
        if c[1] != N // 3:
            print('No')
            sys.exit()
        b ^= c[0]
    if b == 0:
        print('Yes')
    else:
        print('No')
else:
    print('No')


Fixed submission:
import sys
from collections import Counter
N = int(input())
C = Counter(list(map(int, input().split())))
if len(C) == 1 and C[0] == N:
    print('Yes')
elif len(C) == 2 and N % 3 == 0 and C[0] == N // 3 and N - C[0] == 2 * N // 3:
    print('Yes')
elif len(C) == 3 and N % 3 == 0:
    b = 0
    for c in C.most_common():
        if c[1] != N // 3:
            print('No')
            sys.exit()
        b ^= c[0]
    if b == 0:
        print('Yes')
    else:
        print('No')
else:
    print('No')
Buggy python submission (verdict: Time Limit Exceeded):
INF = 1_000_000_007


def comb(n, k):
    k = min(n - k, k)
    if n == 0 or k == 0:
        return 1
    a = n
    for i in range(n - 1, n - k, -1):
        a *= i
    b = 1
    for i in range(2, k + 1):
        b *= i
    return a // b


N, M = list(map(int, input().split()))
A = [-1] + [int(input()) for _ in range(M)] + [N + 1]
res = 1
for i in range(M + 1):
    t = A[i + 1] - A[i] - 2
    if t < 0:
        res = 0
    else:
        _t = 0
        for i in range(t // 2 + 1):
            _t += comb(t - i, i)
        res *= _t
print(res % INF)


Fixed submission:
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
B = [True] * (N + 1)
D = [1] + [0] * N
for _ in range(M):
    a = int(input())
    B[a] = False
for i in range(N):
    for j in range(i + 1, min(N, i + 2) + 1):
        if B[j]:
            D[j] = (D[j] + D[i]) % MOD
print(D[N])

Buggy python submission (verdict: Time Limit Exceeded):
import sys
INF = 1_000_000_007


def comb(n, k):
    if n == 0 or k == 0:
        return 1
    a = n
    for i in range(n - 1, n - k, -1):
        a *= i
    b = 1
    for i in range(2, k + 1):
        b *= i
    return a // b


N, M = list(map(int, input().split()))
A = [-1] + [int(input()) for _ in range(M)] + [N + 1]
res = 1
for i in range(M + 1):
    t = A[i + 1] - A[i] - 2
    if t < 0:
        print(0)
        sys.exit()
    else:
        _t = 0
        for i in range(t // 2 + 1):
            _t += comb(t - i, i)
        res *= _t
print(res % INF)


Fixed submission:
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
B = [True] * (N + 1)
D = [1] + [0] * N
for _ in range(M):
    a = int(input())
    B[a] = False
for i in range(N):
    for j in range(i + 1, min(N, i + 2) + 1):
        if B[j]:
            D[j] = (D[j] + D[i]) % MOD
print(D[N])

Buggy python submission (verdict: Time Limit Exceeded):
INF = 1_000_000_007


def comb(n, k):
    if n == 0 or k == 0:
        return 1
    a = n
    for i in range(n - 1, n - k, -1):
        a *= i
    b = 1
    for i in range(2, k + 1):
        b *= i
    return a // b


N, M = list(map(int, input().split()))
A = [-1] + [int(input()) for _ in range(M)] + [N + 1]
res = 1
for i in range(M + 1):
    t = A[i + 1] - A[i] - 2
    if t < 0:
        res = 0
    else:
        _t = 0
        for i in range(t // 2 + 1):
            _t += comb(t - i, i)
        res *= _t
print(res % INF)


Fixed submission:
MOD = 10 ** 9 + 7
N, M = list(map(int, input().split()))
B = [True] * (N + 1)
D = [1] + [0] * N
for _ in range(M):
    a = int(input())
    B[a] = False
for i in range(N):
    for j in range(i + 1, min(N, i + 2) + 1):
        if B[j]:
            D[j] = (D[j] + D[i]) % MOD
print(D[N])
Buggy python submission (verdict: Time Limit Exceeded):
import math
import sys
N, P = list(map(int, input().split()))
M = math.ceil(P ** (1 / N))
for i in range(M, 0, -1):
    if P % (i ** N) == 0:
        print(i)
        sys.exit()


Fixed submission:
import sys
N, P = list(map(int, input().split()))
M = int(P ** (1 / N) + 1.0E-7)
for i in range(M, 0, -1):
    if P % (i ** N) == 0:
        print(i)
        sys.exit()

Buggy python submission (verdict: Time Limit Exceeded):
import sys
N, P = list(map(int, input().split()))
M = int(P ** (1 / N)) + 1
for i in range(M, 0, -1):
    if P % (i ** N) == 0:
        print(i)
        sys.exit()


Fixed submission:
import sys
N, P = list(map(int, input().split()))
M = int(P ** (1 / N) + 1.0E-7)
for i in range(M, 0, -1):
    if P % (i ** N) == 0:
        print(i)
        sys.exit()
Buggy python submission (verdict: Runtime Error):
I = input().split()
A, B, C, D = [int(i) for i in I]

if int(A + B > C + D:
    print('Left')
elif A + B < C + D:
    print('Right')
else:
    print('Balanced')


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

if A + B > C + D:
    print('Left')
elif A + B < C + D:
    print('Right')
else:
    print('Balanced')
Buggy python submission (verdict: Time Limit Exceeded):
S = input()[:-2]
while len(S) >= 0:
    if S[:len(S) // 2] == S[len(S) // 2:]:
        print(len(S))
    S = S[:-2]


Fixed submission:
import sys
S = input()[:-2]
while len(S) > 0:
    if S[:len(S) // 2] == S[len(S) // 2:]:
        print(len(S))
        sys.exit()
    S = S[:-2]
Buggy python submission (verdict: Runtime Error):
import sys
N = int(input())
S = [int(input()) for _ in range(N)]
S.sort()
t = sum(S)
if t % 10 != 0:
    print(t)
    sys.exit()

for s in range(S):
    if (t - s) % 10 != 0:
        print(t - s)
        sys.exit()
print(0)


Fixed submission:
import sys
N = int(input())
S = [int(input()) for _ in range(N)]
S.sort()
t = sum(S)
if t % 10 != 0:
    print(t)
    sys.exit()

for s in S:
    if (t - s) % 10 != 0:
        print(t - s)
        sys.exit()
print(0)
Buggy python submission (verdict: Runtime Error):
a,b = (int,input(). split ())
print(a*b)

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

Buggy python submission (verdict: Runtime Error):
a=input()
b=input()

print(a*b)

Fixed submission:
a,b = map(int,input(). split ())
print(a*b)
Buggy python submission (verdict: Runtime Error):
a=int(input())
s=input()
if a>=3200:
  print(s)
else
 print('red')
  


Fixed submission:
a=int(input())
s=input()
if a>=3200:
  print(s)
else :
  print('red')

Buggy python submission (verdict: Runtime Error):
a=int(input())
s=input()
if a>=3200:
  print(s)
else
 print("red")
  


Fixed submission:
a=int(input())
s=input()
if a>=3200:
  print(s)
else :
  print('red')
Buggy python submission (verdict: Runtime Error):
a, b = map(int, input().split())
if a*b % 2 == 0:
  print("Even")
  
 else:
  print("Odd")

Fixed submission:
a, b = map(int, input().split())
print("Even" if a*b % 2 == 0 else "Odd")

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

if a*b%2==0:
  print("Even")
  
else:
  print("0dd")

Fixed submission:
a, b = map(int, input().split())
print("Even" if a*b % 2 == 0 else "Odd")

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

c=a*b

if c%2==0:
  print("Even")
  else:
    print("Odd")
    

Fixed submission:
a, b = map(int, input().split())
print("Even" if a*b % 2 == 0 else "Odd")

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

c=a*b

if c%2==0:
  print("Even")
 else:
  print("odd")


Fixed submission:
a, b = map(int, input().split())
print("Even" if a*b % 2 == 0 else "Odd")
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = []
for n in range(N):
    S.append(input())
dic = {}


for n in range(N):
    if S[n] not in dic:
        dic[S[n]] = 1
    else:
        dic[S[n]] += 1

max = max(dic.values())
out = []

for key,val in dic.items():
    if val == max:
        out.append(val)
out.sorted()
for val in range(len(out)):
    print(val)

Fixed submission:
N = int(input())
S = []
for n in range(N):
    S.append(input())
dic = {}


for n in range(N):
    if S[n] not in dic:
        dic[S[n]] = 1
    else:
        dic[S[n]] += 1

max = max(dic.values())
out = []

for key,val in dic.items():
    if val == max:
        out.append(key)

out.sort()
for key in out:
    print(key)
Buggy python submission (verdict: Runtime Error):
n = int(input())

print(int((n-1)*n/2))


Fixed submission:
S = input()
T = input()
count = 0

for n in range(3):
    if S[n] == T[n]:
        count += 1

print(count)

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

A,B = [int(x) for x in input().split()]
print(math.ceil(B/A))

Fixed submission:
S = input()
T = input()
count = 0

for n in range(3):
    if S[n] == T[n]:
        count += 1

print(count)
Buggy python submission (verdict: Runtime Error):
N = int(input())
H = [int(x) for x in input().split()]
L = []
count = 1

for n in range(len(H)-1):
    if H[n]-H[n+1]>=0:
        count += 1
        L.append(count)
    else:
        count = 1

print(max(L))


Fixed submission:
N = int(input())
H = [int(x) for x in input().split()]
L = []
count = 0
L.append(0)

for n in range(len(H)-1):
    if H[n]-H[n+1]>=0:
        count += 1
        L.append(count)
    else:
        count = 0

print(max(L))
Buggy python submission (verdict: Runtime Error):
'''
Created on 2020/02/24

@author: fanta
'''
N = int(input())
X = [int(x) for x in input().split()]
X.insert(0,0)
X.append(0)

for n in range(N+1):
    sum += abs(X[n] - X[n+1])


for n in range(N):
    l = abs(X[n] - X[n+1])
    r = abs(X[n+1] - X[n+2])

    if X[n] < X[n+1] and X[n+1] < X[n+2]:
        print(sum)
    elif X[n] > X[n+1] and X[n+1] > X[n+2]:
        print(sum)

    elif l < r:
        sep = 2*abs(X[n] - X[n+1])
        print(sum - sep)
    else:
        sep = 2*abs(X[n+2] - X[n+1])
        print(sum - sep)




Fixed submission:
N = int(input())
X = [int(x) for x in input().split()]
sum = 0
X.insert(0,0)
X.append(0)

for n in range(N+1):
    sum += abs(X[n] - X[n+1])


for n in range(N):
    l = abs(X[n] - X[n+1])
    r = abs(X[n+1] - X[n+2])

    if X[n] < X[n+1] and X[n+1] < X[n+2]:
        print(sum)
    elif X[n] > X[n+1] and X[n+1] > X[n+2]:
        print(sum)

    elif l < r:
        sep = 2*abs(X[n] - X[n+1])
        print(sum - sep)
    else:
        sep = 2*abs(X[n+2] - X[n+1])
        print(sum - sep)
Buggy python submission (verdict: Runtime Error):
S = input()
T = input()
count = 0
for i in range(len(S)):
  if S[i] != T[i]:
    count++
print(count)

Fixed submission:
S = input()
T = input()
count = 0
i = 0
for i in range(len(S)):
  if S[i]!= T[i]:
    count += 1
print(count)
Buggy python submission (verdict: Runtime Error):
gjgsidogse

Fixed submission:
S = input()
T = input()
print('Yes') if S + T[-1] == T else print('No')
Buggy python submission (verdict: Runtime Error):
target = int(input())
range_d = [int(i) for i in input().split()]
min_d = range_d[0]
max_d = range_d[1]

flag = False
if max_d < target:
  flag = 
else:
  for i in range(min_d,max_d+1):
    if i%target == 0:
      flag = True
      break
	print('OK') if flag else print('NG')

Fixed submission:
target = int(input())
range_d = [int(i) for i in input().split()]
min_d = range_d[0]
max_d = range_d[1]

flag = False
if max_d < target:
  print("NG")
else:
  for i in range(min_d,max_d+1):
    if i%target == 0:
      flag = True
      break
  print('OK') if flag else print('NG')
Buggy python submission (verdict: Time Limit Exceeded):
A,B,N = map(int, input().split())

if N < B:
  floor = int(A*N/B) - A*int(N/B)
elif N == B:
  floor = int(A*(N-1)/B) - A*int((N-1)/B)
else:
  floor = max([(int(A*(x-1)/B) - A*int((x-1)/B)) for x in range(B,N,B)])
print(floor)

Fixed submission:
A,B,N = map(int, input().split())
if B == 1 or A == 1:
  floor = 0
else:
  if N < B:
    floor = int(A*N/B) - A*int(N/B)
  elif N == B:
    floor = int(A*(N-1)/B) - A*int((N-1)/B)
  else:
    floor = max([(int(A*(x-1)/B) - A*int((x-1)/B)) for x in range(B,N,B)])
    
print(floor)

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

if N < B:
  floor = int(A*N/B) - A*int(N/B)
else:
  floor = max([(int(A*(x-1)/B) - A*int((x-1)/B)) for x in range(B,N,B)])
print(floor)

Fixed submission:
A,B,N = map(int, input().split())
if B == 1 or A == 1:
  floor = 0
else:
  if N < B:
    floor = int(A*N/B) - A*int(N/B)
  elif N == B:
    floor = int(A*(N-1)/B) - A*int((N-1)/B)
  else:
    floor = max([(int(A*(x-1)/B) - A*int((x-1)/B)) for x in range(B,N,B)])
    
print(floor)
Buggy python submission (verdict: Runtime Error):
str_list = input().split()
str_dic = {str_list[0]:int(input()),str_list[1]:int(input())}

Fixed submission:
str_list = input().split()
num_list =  [int(i) for i in input().split()]
del_boll = input()

boll_dic = {str_list[0]:num_list[0],str_list[1]:num_list[1]}
boll_dic[del_boll] -= 1

print(boll_dic[str_list[0]],boll_dic[str_list[1]])
Buggy python submission (verdict: Time Limit Exceeded):
N,M = map(int,input().split())
A = [int(a) for a in input().split()]
A.sort()
for _ in range(M):
  count = 1
  B,C = map(int,input().split())
  while min(A) < C and count <= B:
    A[0] = C
    A.sort()
    count += 1
print(sum(A))
    

    


Fixed submission:
n,m=map(int,input().split())
a=list(map(int,input().split()))
bc=[list(map(int,input().split())) for i in range(m)]
bc.sort(key=lambda x:x[1])
for b,c in bc[::-1]:
  a.extend([c]*b)
  if len(a) > 2*n:
    break
a.sort(reverse=True)
print(sum(a[:n]))

Buggy python submission (verdict: Runtime Error):
N,M = map(int,input().split())
A = [int(a) for a in input().split()]
A.sort()
for _ in range(M):
    count = 1
    B,C = map(int,input().split())
    while min(A) < C and count <= B:
        A[0] = C
        A.sort()
        count += 1
    print(A)
print(sum(A))
    

    


Fixed submission:
n,m=map(int,input().split())
a=list(map(int,input().split()))
bc=[list(map(int,input().split())) for i in range(m)]
bc.sort(key=lambda x:x[1])
for b,c in bc[::-1]:
  a.extend([c]*b)
  if len(a) > 2*n:
    break
a.sort(reverse=True)
print(sum(a[:n]))
Buggy python submission (verdict: Runtime Error):
N = int(input())
S = input()
counter = 0
for i in range(0,N):
    if(S[i] == "A"):
        if(S[i+1] == "B"):
            if(S[i+2] == "C"):
                counter += 1
                
print(counter)

Fixed submission:
N = int(input())
S = input()
counter = 0
for i in range(0,N-2):
    if(S[i] == "A"):
        if(S[i+1] == "B"):
            if(S[i+2] == "C"):
                counter += 1
                
print(counter)
Buggy python submission (verdict: Runtime Error):
    import sys
    N = int(input())
     
    for i in range(1,10):
        for j in range(1,10):
            if(N == i*j):
                print("Yes")
                sys.exit()
    print("No")

Fixed submission:
import sys
N = int(input())

for i in range(1,10):
    for j in range(1,10):
        if(N == i*j):
            print("Yes")
            sys.exit()
print("No")
Buggy python submission (verdict: Runtime Error):
A,B,C,X,Y = map(int,input().split())
min_ = min(X,Y)
max_ = max(X,Y)

res = A*X + B*Y

m = 2 * C * max(X, Y);

sum = C * 2* min_

if(C<=0.5 * A and C <= 0.5 * B):
    sum += 2*C*(max_-min_)

elif(max_==X):
    sum += (max_-min_)*A
else:
    sum += (max_-min_)*B
    
print(min(m,min(res,sum)))

Fixed submission:
S = input()
S_c = S.count("o")
if(S_c==3):
    print("1000")
elif(S_c==2):
    print("900")
elif(S_c ==1):
    print("800")
else:
    print("700")
Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().split())
a = list(map(int,input().split()))

if(len(set(a)) <= k):
    print(0)
else:
    dic_a = {x:0 for x in set(A)}
    for i in a:
        dic_a[i] += 1
    sum = 0
    a = sorted(dic_a.items(), key=lambda x: x[0])
    for i in range(k,len(a)):
        sum += a[i][1]
    print(sum)

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

Ad = {x:0 for x in set(A)}
if len(set(A)) <= K:
    print(0)
else:
    count = 0
    for a in A:
        Ad[a] += 1
    Ad = sorted(Ad.items(), key=lambda x:x[1])
    for i in range(len(set(A))-K):
        count += Ad[i][1]
    print(count)
Buggy python submission (verdict: Runtime Error):
n = int(input())
sum = 0
for i in str(n):
    sum += int(i)
if(N%sum==0):
    print("Yes")
else:
    print("No")

Fixed submission:
n = int(input())
sum = 0

for i in str(n):
    sum += int(i)
    
if(n%sum==0):
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
n = int(input())
sum = 0
for i in str(n):
    sum += int(i)
if(N%sum==0):
    print("Yes")
else:
    print("No")

Fixed submission:
n = int(input())
sum = 0

for i in str(n):
    sum += int(i)
    
if(n%sum==0):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
N, Y = map(int, input().split())

for i in range(N+1):
    for j in range(N-i+1):
        if i*10000 + j*5000 + (N-i-j)*1000 == Y:
            print(i, j, n-i-j)
            exit()
print("-1 -1 -1")

Fixed submission:
n, y = map(int, input().split())
for i in range(n + 1):
    for j in range(n - i + 1):
        if i * 10000 + j * 5000 + (n - i - j) * 1000 == y:
            print(i, j, n - i - j)
            exit()
print("-1 -1 -1")
Buggy python submission (verdict: Runtime Error):
N, M, K = map(int, input().split())
A = list(map(int, input().split()))
B = list(map(int, input().split()))

a, b = [0], [0]
for i in range(N):
a.append(a[i] + A[i])
for i in range(M):
b.append(b[i] + B[i])

ans, j = 0, M
for i in range(N + 1):
  if a[i] > K:
    break
  while b[j] > K - a[i]:
      j -= 1
ans = max(ans, i + j)
print(ans)

Fixed submission:
a = int(input())
print(a + a**2 + a**3)

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

x = list(filter(lambda i:s[i] != t[i], range(len(s)) ))

print(len(x))

Fixed submission:
a = int(input())
print(a + a**2 + a**3)
Buggy python submission (verdict: Runtime Error):
x = str(input())

if x.isupper() = True:
  print("A")
else:
  print("a")

Fixed submission:
x = input()

if str(x).isupper() == True:
  print("A")
else:
  print("a")

Buggy python submission (verdict: Runtime Error):
x = str(input())
if x.isupper() == Ture:
  print("A")
else:
  print("a")

Fixed submission:
x = input()

if str(x).isupper() == True:
  print("A")
else:
  print("a")

Buggy python submission (verdict: Runtime Error):
import sys
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
N = read().rstrip().decode()

if N isupper():
	print('A')
else:
	print('a')


Fixed submission:
S = input() # 標準入力がStringの場合
if S.isupper():
  print('A')
else:
  print('a')

Buggy python submission (verdict: Runtime Error):
import sys
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
N = read().rstrip().decode()

if N is.upper():
	print('A')
else:
	print('a')


Fixed submission:
S = input() # 標準入力がStringの場合
if S.isupper():
  print('A')
else:
  print('a')

Buggy python submission (verdict: Runtime Error):
import sys
 
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
 
N = read().rstrip().decode()

if N is.upper():
	print('A')
else:
	print('a')

Fixed submission:
S = input() # 標準入力がStringの場合
if S.isupper():
  print('A')
else:
  print('a')
Buggy python submission (verdict: Runtime Error):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def I():
    # 1 line 1 int
    return int(sys.stdin.readline().rstrip())
def LI():
    # 1 line n ints
    return list(map(int,sys.stdin.readline().rstrip().split()))
def S():
    # 1 line 1 string
    return sys.stdin.readline().rstrip()
def LS():
    # 1 line n strings
    return list(sys.stdin.readline().rstrip().split())

A = S()

if A[0] == A[1] == A[2] or A[1] == A[2] == A[3]:
   print("Yes")
else
   print("No")




Fixed submission:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def I():
    # 1 line 1 int
    return int(sys.stdin.readline().rstrip())
def LI():
    # 1 line n ints
    return list(map(int,sys.stdin.readline().rstrip().split()))
def S():
    # 1 line 1 string
    return sys.stdin.readline().rstrip()
def LS():
    # 1 line n strings
    return list(sys.stdin.readline().rstrip().split())

A = S()

if A[0] == A[1] == A[2] or A[1] == A[2] == A[3]:
   print("Yes")
else:
   print("No")

Buggy python submission (verdict: Runtime Error):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def I():
    # 1 line 1 int
    return int(sys.stdin.readline().rstrip())
def LI():
    # 1 line n ints
    return list(map(int,sys.stdin.readline().rstrip().split()))
def S():
    # 1 line 1 string
    return sys.stdin.readline().rstrip()
def LS():
    # 1 line n strings
    return list(sys.stdin.readline().rstrip().split())

A = S()

if A[0] == A[1] == A[2] or
   A[1] == A[2] == A[3]:
   print("Yes")
else
   print("No")




Fixed submission:
import bisect,collections,copy,heapq,itertools,math,string
import sys
def I():
    # 1 line 1 int
    return int(sys.stdin.readline().rstrip())
def LI():
    # 1 line n ints
    return list(map(int,sys.stdin.readline().rstrip().split()))
def S():
    # 1 line 1 string
    return sys.stdin.readline().rstrip()
def LS():
    # 1 line n strings
    return list(sys.stdin.readline().rstrip().split())

A = S()

if A[0] == A[1] == A[2] or A[1] == A[2] == A[3]:
   print("Yes")
else:
   print("No")
Buggy python submission (verdict: Runtime Error):
a = str(input())
b = str(input())
c = 0
for i in range(len(a)):
  if a[i] == b[i]:
    c += 0
  else:
    b[i] = a[i]
    c += 1
print(c)

Fixed submission:
a = str(input())
b = str(input())
c = 0
for i in range(len(a)):
  if a[i] == b[i]:
    c += 0
  else:
    c += 1
print(c)
Buggy python submission (verdict: Runtime Error):
a,b,c,d = map(int,input().split())
while True:
	c -= b
    if c <= 0:
     	print("Yes")
    else:
      	a -= d
    	if a <= 0:
          print("No")

Fixed submission:
a,b,c,d = map(int,input().split())
while True:
  c -= b
  if c <= 0:
    print("Yes")
    break
  elif c > 0:
    a -= d
    if a <= 0:
      print("No")
      break
Buggy python submission (verdict: Runtime Error):
n=int(input())

if n%2==0 print(1/2) else print((n+1)/2/n)

Fixed submission:
n=int(input())

if n%2==0:
  print(1/2)
else:
  print((n+1)/2/n)
Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
ans=0
hlist=[int(input()) for i in range(n)]
for height in hlist:
  if height>=k:
    ans+=1
print(ans)

Fixed submission:
n,k=map(int,input().split())
ans=0
hlist=list(map(int,input().split()))
for height in hlist:
  if height>=k:
    ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
ans=0
hlist=[int(input()) for i in range(n)]
for height in hlist:
  if height>=k:
    ans+1
print(ans)

Fixed submission:
n,k=map(int,input().split())
ans=0
hlist=list(map(int,input().split()))
for height in hlist:
  if height>=k:
    ans+=1
print(ans)

Buggy python submission (verdict: Runtime Error):
n,k=map(int,input().split())
ans=0
for i in range(n):
  h=int(input())
  if h>=k:
    ans+1
print(ans)

Fixed submission:
n,k=map(int,input().split())
ans=0
hlist=list(map(int,input().split()))
for height in hlist:
  if height>=k:
    ans+=1
print(ans)