Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
import math
import heapq

N, M = list(map(int, input().split()))
A = list(map(lambda a: -int(a), input().split()))
A.sort()
heapq.heapify(A)

for i in range(M):
  a = heapq.heappop(A)
  a =/ 2.0
  heapq.heappush(A, a)

amount = 0
for a in A:
  amount += math.floor(-a)
print(amount)


Fixed submission:
import math
import heapq

N, M = list(map(int, input().split()))
A = list(map(lambda a: -int(a), input().split()))
A.sort()
heapq.heapify(A)

for i in range(M):
  a = heapq.heappop(A)
  a = -(-a / 2.0)
  heapq.heappush(A, a)

amount = 0
for a in A:
  amount += math.floor(-a)
print(amount)

Buggy python submission (verdict: Time Limit Exceeded):
import math
import bisect

N, M = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
if N > M:
  A_small = A[0:N - M]
  A = A[N - M:]
else:
  A_small = []

for i in range(M):
  if (len(A) > 1 and A[-1] < A[-2]):
    a = A.pop(-1)
    bisect.insort(A, a)
  A[-1] /= 2.0

A.extend(A_small)
amount = 0
for a in A:
  amount += math.floor(a)
print(amount)

Fixed submission:
import math
import heapq

N, M = list(map(int, input().split()))
A = list(map(lambda a: -int(a), input().split()))
A.sort()
heapq.heapify(A)

for i in range(M):
  a = heapq.heappop(A)
  a = -(-a / 2.0)
  heapq.heappush(A, a)

amount = 0
for a in A:
  amount += math.floor(-a)
print(amount)

Buggy python submission (verdict: Time Limit Exceeded):
import math
import bisect

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

for i in range(M):
  if (A[N - 1] < A[N - 2]):
    a = A.pop(-1)
    bisect.insort(A, a)
  A[N - 1] /= 2.0
amount = 0
for a in A:
  amount += math.floor(a)
print(amount)

Fixed submission:
import math
import heapq

N, M = list(map(int, input().split()))
A = list(map(lambda a: -int(a), input().split()))
A.sort()
heapq.heapify(A)

for i in range(M):
  a = heapq.heappop(A)
  a = -(-a / 2.0)
  heapq.heappush(A, a)

amount = 0
for a in A:
  amount += math.floor(-a)
print(amount)

Buggy python submission (verdict: Time Limit Exceeded):
import math

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

for i in range(M):
  if (A[N - 1] < A[N - 2]):
    A.sort()
  A[N - 1] /= 2.0
amount = 0
for a in A:
  amount += math.floor(a)
print(amount)

Fixed submission:
import math
import heapq

N, M = list(map(int, input().split()))
A = list(map(lambda a: -int(a), input().split()))
A.sort()
heapq.heapify(A)

for i in range(M):
  a = heapq.heappop(A)
  a = -(-a / 2.0)
  heapq.heappush(A, a)

amount = 0
for a in A:
  amount += math.floor(-a)
print(amount)
Buggy python submission (verdict: Runtime Error):
n,a,b=map(int,input().split())
l=[0]*n
for i in range(n):
  for j in range(i+1,n):
    temp=min(abs(j-i),abs(x-i)+1+abs(y-j),abs(y-i)+1+abs(j-x))
    l[temp]+=1
for i in range(1,n):
  print(l[i])



Fixed submission:
n,x,y=map(int,input().split())
l=[0]*n
for i in range(1,n+1):
  for j in range(i+1,n+1):
    temp=min(abs(j-i),abs(x-i)+1+abs(y-j),abs(y-i)+1+abs(j-x))
    l[temp]+=1
for i in range(1,n):
  print(l[i])
Buggy python submission (verdict: Runtime Error):
[a,b,c,d,e,f] = import()

if c = d and e = f:
    print("Yes")
else:
    print("No")

Fixed submission:
[a,b,c,d,e,f] = input()

if c == d and e == f:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
[a,b,c,d,e,f] = import()

if c = d and e = f:
    print("Yes")
else:
    print("No")

Fixed submission:
[a,b,c,d,e,f] = input()

if c == d and e == f:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
[a,b,c,d,e,f] = import()

if c = d and e = f:
    print("Yes")
else:
    print("No")

Fixed submission:
[a,b,c,d,e,f] = input()

if c == d and e == f:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
from sys import stdin

N, M = stdin.readline().rstrip().split()

#全ての組み合わせのうち、奇数になるもののみ除く（奇数 + 偶数）

total = ((N+M)*(N+M-1))/2
odd = N*M

print(total - odd)




Fixed submission:
from sys import stdin
N, M = map(int, input().split()) 

print(
    (N*(N-1))//2 +
    (M*(M-1))//2
)

Buggy python submission (verdict: Runtime Error):
from sys import stdin

N, M = stdin.readline().rstrip().split()

#全ての組み合わせのうち、奇数になるもののみ除く（奇数 + 偶数）

NM = N*M
total = (NM*(NM-1))/2
odd = NM/2

print(total - odd)





Fixed submission:
from sys import stdin
N, M = map(int, input().split()) 

print(
    (N*(N-1))//2 +
    (M*(M-1))//2
)
Buggy python submission (verdict: Runtime Error):
from sys import stdin

def slove():
    S, T = stdin.readline().rstrip().split()
    A, B = [int(x) for x in stdin.readline().rstrip().split()]
    U = input()

    if S == U:
        print(A-1, B)
    else T == U:
        print(A, B-1)
    else:
        print(A, B)


slove()


Fixed submission:
from sys import stdin

def slove():
    S, T = stdin.readline().rstrip().split()
    A, B = [int(x) for x in stdin.readline().rstrip().split()]
    U = input()

    if S == U:
        print(A-1, B)
    elif T == U:
        print(A, B-1)
    else:
        print(A, B)


slove()
Buggy python submission (verdict: Runtime Error):
from sys import stdin

C = input()

print(chr(ord(C + 1)))

Fixed submission:
from sys import stdin

C = input()
c = ord(C)

print(chr(c + 1))
Buggy python submission (verdict: Runtime Error):
from sys import stdin
K, X = [int(x) for x in stdin.readline().rstrip().split()]

if X =< K*500:
    print("Yes")
else:
    print("No")

Fixed submission:
from sys import stdin
K, X = [int(x) for x in stdin.readline().rstrip().split()]

if X <= K*500:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
from sys import stdin

S = stdin.readline().rstrip()
days = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

for i in range(len(days)):
    if S == days[i]:
        t = i
        break
    else:
        i += 1

print(days[t + 1])

Fixed submission:
from sys import stdin

S = stdin.readline().rstrip()
days  = ["MON","TUE","WED","THU","FRI","SAT","SUN"]

if S == "SUN":
    print(7)
else:
    i = days.index(S)
    print(6 - i)

Buggy python submission (verdict: Runtime Error):
S = input()
days = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

for i in range(6):
    if S == days[i]:
        t = i
        break
    else:
        i =+ 1

print(days[t + 1])

Fixed submission:
from sys import stdin

S = stdin.readline().rstrip()
days  = ["MON","TUE","WED","THU","FRI","SAT","SUN"]

if S == "SUN":
    print(7)
else:
    i = days.index(S)
    print(6 - i)

Buggy python submission (verdict: Runtime Error):
S = input()
days = ["SUN","MON","TUE","WED","THU","FRI","SAT"]

for i in days:
    if S == days[i]:
        t = i
        break
    else:
        i =+ 1

print(days[t + 1])

Fixed submission:
from sys import stdin

S = stdin.readline().rstrip()
days  = ["MON","TUE","WED","THU","FRI","SAT","SUN"]

if S == "SUN":
    print(7)
else:
    i = days.index(S)
    print(6 - i)
Buggy python submission (verdict: Runtime Error):
from sys import stdin

A = int(stdin.readline().rstrip())

if A%2 == 0:
    print(A/(A/2))
else:
    print(A/(A//2))



Fixed submission:
from sys import stdin

A = int(stdin.readline().rstrip())

if A%2 == 0:
    print((A/2)/A)
else:
    print((A//2 + 1)/A)
Buggy python submission (verdict: Runtime Error):
from sys import stdin
A = stdin.readline().rstrip()

weather = ["Sunny", "Cloudy", "Rainy", "Sunny"]

for i in round(len(weather) - 1):
    if A == weather[i]:
        t = i
        break
    else:
        i += 1


print(weather[t+1])




Fixed submission:
from sys import stdin
A = stdin.readline().rstrip()

weather = ["Sunny", "Cloudy", "Rainy", "Sunny"]

for i in range(len(weather)):
    if A == weather[i]:
        t = i
        break
    else:
        i += 1


print(weather[t+1])
Buggy python submission (verdict: Time Limit Exceeded):
S=input()
N=int(len(S))
for _ in range(N):
    A=S
    S=S.replace("01","")
    S=S.replace("10","")
    S=S.replace("01","")
    if A==S:
        break
print(N-int(len(S)))

Fixed submission:
S=input()
print(min(S.count("0"),S.count("1"))*2)

Buggy python submission (verdict: Time Limit Exceeded):
S=input()
N=int(len(S))
for _ in range(N):
    A=S
    S=S.replace("10","")
    S=S.replace("01","")
    if A==S:
        break
print(N-int(len(S)))

Fixed submission:
S=input()
print(min(S.count("0"),S.count("1"))*2)

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
S=input()
N=int(len(S))
for _ in range(N):
    A=S
    S=S.replace("0110","")
    S=S.replace("0101","")
    S=S.replace("10","")
    S=S.replace("01","")
    if A==S:
        break
print(N-int(len(S)))

Fixed submission:
S=input()
print(min(S.count("0"),S.count("1"))*2)

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
S=input()
N=int(len(S))
for _ in list(S):
    A=S
    S=S.replace("0110","")
    S=S.replace("0101","")
    S=S.replace("10","")
    S=S.replace("01","")
    if A==S:
        break
print(N-int(len(S)))

Fixed submission:
S=input()
print(min(S.count("0"),S.count("1"))*2)

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
S=input()
N=int(len(S))
for _ in list(S):
    A=S
    S=S.replace("10","")
    S=S.replace("01","")
    if A==S:
        break
print(N-int(len(S)))

Fixed submission:
S=input()
print(min(S.count("0"),S.count("1"))*2)

Buggy python submission (verdict: Time Limit Exceeded):
import sys
input = sys.stdin.readline
S=input()
N=int(len(S))
for _ in list(S):
    S=S.replace("10","")
    S=S.replace("01","")
print(N-int(len(S)))

Fixed submission:
S=input()
print(min(S.count("0"),S.count("1"))*2)

Buggy python submission (verdict: Time Limit Exceeded):
S=input()
N=int(len(S))
for j in range(int(N/2)):
    S=S.replace("10","")
    S=S.replace("01","")
print(N-int(len(S)))

Fixed submission:
S=input()
print(min(S.count("0"),S.count("1"))*2)

Buggy python submission (verdict: Time Limit Exceeded):
S=str(input())
N=int(len(S))
for j in range(int(len(S)/2)):
    S=S.replace("10","",1)
    S=S.replace("01","",1)
print(N-int(len(S)))

Fixed submission:
S=input()
print(min(S.count("0"),S.count("1"))*2)
Buggy python submission (verdict: Runtime Error):
n = int(input())
m = int(input())
print((n-1)*(m-1))

Fixed submission:
a = list(map(int, input().split()))
print((a[0]-1)*(a[1]-1))
Buggy python submission (verdict: Runtime Error):
n, k = map(int , input().split())
e = []
cnt = 0
for i in range(n):
    a, b = map(int, input().split())
for j in range(b):
    e.append(a)
    e.sort()
print(e[k-1])

Fixed submission:
n, k = map(int , input().split())
a = []
b = []
cnt = 0
for i in range(n):
    atem, btem = map(int , input().split())
    a.append(atem)
    b.append(btem)
c = list(zip(a, b))
c.sort()
a, b = zip(*c)
for i in range(n):
    cnt += b[i]
    if cnt >= k:
        print(a[i])
        break

Buggy python submission (verdict: Runtime Error):
n, k = map(int , input().split())
e = []
cnt = 0
for i in range(n):
a, b = map(int, input().split())
for j in range(b):
e.append(a)
e.sort()
print(e[k-1])

Fixed submission:
n, k = map(int , input().split())
a = []
b = []
cnt = 0
for i in range(n):
    atem, btem = map(int , input().split())
    a.append(atem)
    b.append(btem)
c = list(zip(a, b))
c.sort()
a, b = zip(*c)
for i in range(n):
    cnt += b[i]
    if cnt >= k:
        print(a[i])
        break
Buggy python submission (verdict: Runtime Error):
x = int(input())
gold = x % 500
silver = (x - 500*g) % 5
fun = gold*1000 + silver*5
print(fun)

Fixed submission:
x = int(input())
gold = int(x/500)
silver = int((x - 500*gold)/5)
print(gold*1000 + silver*5)
Buggy python submission (verdict: Runtime Error):
s= input()
if (s[2] == s[3] and s[4] == s[5]):
    print("Yes")
else:
    print(No)

Fixed submission:
s= input()
if (s[2] == s[3] and s[4] == s[5]):
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
s = input()
q = int(input())
for operation in range(q):
    t = input().split()
    if int(t[0]) == 1:
        s = s[::-1]
    elif int(t[1]) == 1:
        s = t[2] + s
    else:
        s = s + t[2]
print(s)

Fixed submission:
s = input()
q = int(input())
l = ''
r = ''
countReverse = 0
for operation in range(q):
    t = input().split()
    if int(t[0]) == 1:
        countReverse += 1
    if int(t[0]) == 2:
        if int(t[1]) == 1:
            if countReverse % 2 == 0:
                l = t[2] + l
            else:
                r = r + t[2]
        else:
            if countReverse % 2 == 0:
                r = r + t[2]
            else:
                l = t[2] + l
if countReverse % 2 == 0:
    s = l + s + r
else:
    s = s[::-1]
    l = l[::-1]
    r = r[::-1]
    s = r + s + l
print(s)
Buggy python submission (verdict: Runtime Error):
K, N = map(int, input().split())
 
A_list = list(map(int, input().split()))

distance = []
diff = 0

for i in range(0, N):
    
    if i == N-1:
        diff = K + A_list[0] - A_list[i]
        distance.append(diff)
        
    else:
        diff = A_list[i+1] - A_list[i]
        distance.append(diff)
        

print(sum(distance) - max(distance))

Fixed submission:
S = input()

if (S[2] == S[3]) and (S[4] == S[5]):
    print("Yes")
    
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
input_line= input()

if (input_line[2] == input_line[3]) & (input_line[4] == input_line[5]):
  print("Yes")
else:
  pritn("No")

Fixed submission:
S = input()

if (S[2] == S[3]) and (S[4] == S[5]):
    print("Yes")
    
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
A, B = map(int, input().split())

for x in range(1251):
    
    if (int(x * 0.08) == A) and (int(x * 0.1) == B):
        print(i)
    else:
        print("-1")


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

for x in range(1251):
    
    if (int(x * 0.08) == A) and (int(x * 0.1) == B):
        print(x)
        exit()

print("-1")
Buggy python submission (verdict: Runtime Error):
num_origin = input()
gohyoku = int(num_origin/500)
num_zan = num_origin - gohyoku*500
go = int(go/5)

num = go*5 + gohyoku*1000

print(num)

Fixed submission:
num_origin = int(input())
gohyoku = int(num_origin/500)
num_zan = num_origin - gohyoku*500
go = int(num_zan/5)
 
num = go*5 + gohyoku*1000
 
print(num)
Buggy python submission (verdict: Time Limit Exceeded):
kazu, hissatu = map(int,input().split())
hairetu = list(map(int,input().split()))

toru = kazu-hissatu

if toru<=0:
  print(0)
else:
  for i in range(hissatu):
    hairetu.remove(max(hairetu))
  print(sum(hairetu))

Fixed submission:
kazu, hissatu = map(int,input().split())
hairetu = list(map(int,input().split()))

toru = kazu-hissatu

if toru<=0:
  print(0)
else:
  hairetu.sort()
  print(sum(hairetu[:(kazu)-hissatu]))
Buggy python submission (verdict: Runtime Error):
num = int(input())
bunsyo = input()
count = 0

for i in range(len(bunsyo)):
  if bunsyo[i] == 'A':
    if bunsyo[i+1] =='B':
      if bunsyo[i+2] == 'C':
        count = count + 1
print(count)

Fixed submission:
num = int(input())
bunsyo = input()
count = 0

for i in range(len(bunsyo)):
  if i+2 > num-1:
    continue
  if bunsyo[i] == 'A':
    if bunsyo[i+1] =='B':
      if bunsyo[i+2] == 'C':
        count = count + 1
print(count)
Buggy python submission (verdict: Runtime Error):
num = int(input())
 
s1,s2 = input().split()
 
ans = ''
 
for i in range(num):
	ans = ans + s1[i]
	ans = ans + s2[i]
    
print(ans)

Fixed submission:
number1 = int(input())
number2 = int(input())

n_list = [1,2,3]

n_list.remove(number1)
n_list.remove(number2)

print(n_list[0])
Buggy python submission (verdict: Runtime Error):
num = int(input())

s1,s2 = input().split()

ans = ''

for i in range(num):
	ans = ans + s1[i]
    ans = ans + s2[i]

print(ans)

Fixed submission:
num = int(input())
 
s1,s2 = input().split()
 
ans = ''
 
for i in range(num):
	ans = ans + s1[i]
	ans = ans + s2[i]
print(ans)
Buggy python submission (verdict: Runtime Error):
import fractions

a,b = map(int, input().split())

print((a*b)//fractions.gcd(a,b)

Fixed submission:
import fractions
 
a,b = map(int, input().split())
 
print((a*b)//fractions.gcd(a,b))
Buggy python submission (verdict: Runtime Error):
S = input()
if S[2]==S[3] and S[4]==S[5]:\
    print(Yes)
else:
    print(No)

Fixed submission:
if __name__=='__main__':
    S = input()
    if S[2]==S[3] and S[4]==S[5]:\
      print('Yes')
    else:
      print('No')

Buggy python submission (verdict: Runtime Error):
if __name__=='__main__':
    S = input()
    if S[2]==S[3] and S[4]==S[5]:\
      print(Yes)
    else:
      print(No)

Fixed submission:
if __name__=='__main__':
    S = input()
    if S[2]==S[3] and S[4]==S[5]:\
      print('Yes')
    else:
      print('No')
Buggy python submission (verdict: Runtime Error):
def lmc(a,b):
  i = 1
  while(1):
    c = a*i
	if c % b == 0:
      return c
	i += 1

print("a= ",end="")
a= int(input())
print("b= ",end="")
b= int(input())
print(lmc(a,b))

Fixed submission:
def LMC(a,b):
  i = 1
  while(1):
    c = a * i
    if c % b == 0:
      return c
    i += 1

num_line = [int(i) for i in input().split(" ")]
print(LMC(num_line[0],num_line[1]))

Buggy python submission (verdict: Runtime Error):
def lmc(a,b):
	i = 1
	while(1):
		c = a*i
		if c % b == 0:
			return c
		i += 1

print("a= ",end="")
a= int(input())
print("b= ",end="")
b= int(input())
print(lmc(a,b))

Fixed submission:
def LMC(a,b):
  i = 1
  while(1):
    c = a * i
    if c % b == 0:
      return c
    i += 1

num_line = [int(i) for i in input().split(" ")]
print(LMC(num_line[0],num_line[1]))

Buggy python submission (verdict: Time Limit Exceeded):
def LCM(a,b):
  i = 2
  num_line_1 = [a]
  num_line_2 = [b]
  while(1):  
    num_line_1.append(num_line_1[0] * i)
    num_line_2.append(num_line_2[0] * i)
    
    for j in range(i):
      if num_line_1[j] in num_line_2:
        return num_line_1[j]        
    i += 1

num_line = [int(i) for i in input().split(" ")]
print(LCM(num_line[0], num_line[1]))

Fixed submission:
def LMC(a,b):
  i = 1
  while(1):
    c = a * i
    if c % b == 0:
      return c
    i += 1

num_line = [int(i) for i in input().split(" ")]
print(LMC(num_line[0],num_line[1]))
Buggy python submission (verdict: Runtime Error):
def coffee(n, ar):
    status = []
    if ar[3] == ar[4] and ar[5] == ar[6]:
      return 'Yes'
    else:
      return 'No'

if __name__ == '__main__':

    n = int(input())

    ar = list(map(str, input().rstrip().split()))

    result = coffee(n, ar)
    print(result)

Fixed submission:
def coffee(word):
    ar = [char for char in word] 
    if (ar[2] == ar[3]) and (ar[4] == ar[5]):
      return 'Yes'
    else:
      return 'No'

if __name__ == '__main__':

    ar = str(input())

    result = coffee(ar)
    print(result)

Buggy python submission (verdict: Runtime Error):
n, x, y = map(int, input().split())
X = min(x,y)
Y = max(x,y)
x =X
y = Y
sum = x +y +1
dist = x+1
for i in range(2,dist):
	sum += dist//i
dist = n+1-y
for j in range(2,dist):
	sum += dist//j
dist = y+1-x
sum+= dist
for k in range(2,dist):
  sum += dist//k
sum+= y-n+2

Fixed submission:
txt = input()
if( txt[2] == txt[3] and txt[4] == txt[5]):
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
s = input().split()[1][0]
print('A{}C').format(s)

Fixed submission:
s = input().split()[1][0]
print('A{}C'.format(s))

Buggy python submission (verdict: Runtime Error):
s = input().split()[1][0]
print(f'A{s}C')

Fixed submission:
s = input().split()[1][0]
print('A{}C'.format(s))
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input.split())
print(len(set((a, b, c))))

Fixed submission:
a, b, c = map(int, input().split())
print(len(set((a, b, c))))
Buggy python submission (verdict: Runtime Error):
inport numpy as np
n, k, x, y = map(int, input().split('\n'))
basic = np.min(k * x, n * x)
plus = np.max((n - k) * y, 0)
print(basic + plus)

Fixed submission:
n, k, x, y = [int(input()) for i in range(4)]
basic = min(k * x, n * x)
plus = max((n - k) * y, 0)
print(basic + plus)

Buggy python submission (verdict: Runtime Error):
n, k, x, y = map(int, input().split('\n'))
basic = min(k * x, n * x)
plus = max((n - k) * y, 0)
print(basic + plus)

Fixed submission:
n, k, x, y = [int(input()) for i in range(4)]
basic = min(k * x, n * x)
plus = max((n - k) * y, 0)
print(basic + plus)

Buggy python submission (verdict: Runtime Error):
n, k, x, y = map(int, input().split())
basic = min(k * x, n * x)
plus = max((n - k) * y, 0)
print(basic + plus)

Fixed submission:
n, k, x, y = [int(input()) for i in range(4)]
basic = min(k * x, n * x)
plus = max((n - k) * y, 0)
print(basic + plus)
Buggy python submission (verdict: Runtime Error):
main():
  ans = func(input())
  print(ans)
  
  
def func(sentence):
  unique_list = set(sentence)
  for s in unique_list:
    if sentence.count(s) % 2 != 0:
      return('No')
      break
  return('Yes')

if __name__ == '__main__':
  main()

Fixed submission:
def main():
  ans = func(input())
  print(ans)
  
  
def func(sentence):
  unique_list = set(sentence)
  for s in unique_list:
    if sentence.count(s) % 2 != 0:
      return('No')
      break
  return('Yes')

if __name__ == '__main__':
  main()
Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().stlip())
if sorted((a, b, c)) == [5, 5, 7]:
  print('YES')
else:
  print('NO')

Fixed submission:
a, b, c = map(int, input().split())
if sorted((a, b, c)) == [5, 5, 7]:
  print('YES')
else:
  print('NO')

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
if sorted(a, b, c) == [5, 5, 7]:
  print('Yes')
else:
  print('NO')

Fixed submission:
a, b, c = map(int, input().split())
if sorted((a, b, c)) == [5, 5, 7]:
  print('YES')
else:
  print('NO')

Buggy python submission (verdict: Runtime Error):
a, b, c = map(int, input().split())
if set(a, b, c) == (5, 7) & a*b*c % 25 == 0:
  print(YES)
else:
  print(NO)

Fixed submission:
a, b, c = map(int, input().split())
if sorted((a, b, c)) == [5, 5, 7]:
  print('YES')
else:
  print('NO')
Buggy python submission (verdict: Runtime Error):
h, n = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a)
if h <= s:
	print('YES')
else:
	print('NO')

Fixed submission:
h, a = map(int, input().split())
if h % a == 0:
	print(h//a)
else:
	print(h//a + 1)
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())
if n = m:
  print('Yes')
else:
  print('No')

Fixed submission:
n, m = map(int, input().split())
if n == m:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Time Limit Exceeded):
import math

A, B = map(int, input().split())

def cf(x1,x2):
    cf=[]
    for i in range(2,min(x1,x2)+1):
        if x1 % i == 0 and x2 % i == 0:
            cf.append(i)
    return cf

AB_divs = cf(A, B)

def is_prime(n):
    if n == 1: return False
    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False
    return True

primes = []

for v in AB_divs:
    if is_prime(v):
        primes.append(v)

primes.insert(0, 1)
print(len(primes))


Fixed submission:
import math

A, B = map(int, input().split())

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)
    divisors.sort()
    return divisors

A_divs = make_divisors(A)
B_divs = make_divisors(B)

A_divs_len = len(B_divs)
B_divs_len = len(B_divs)
AB_divs = []

if A_divs_len >= B_divs_len:
    for v in B_divs:
        if v in A_divs:
            AB_divs.append(v)
        else:
            continue
else:
    for w in A_divs:
        if w in B_divs:
            AB_divs.append(w)

def is_prime(n):
    if n == 1: return False
    for k in range(2, int(math.sqrt(n)) + 1):
        if n % k == 0:
            return False
    return True

primes = []

for v in AB_divs:
    if is_prime(v):
        primes.append(v)

primes.insert(0, 1)
print(len(primes))