Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 16 18:32:20 2019

@author: Yamazaki Kenichi
"""

N,A,B,K = map(int,input().split())
mod = 998244353
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inv = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N+1):
    g1.append((g1[-1] * i) % mod)
    inv.append((-inv[mod % i] * (mod//i)) % mod)
    g2.append((g2[-1] * inv[-1]) % mod)
def a(r,g,b):
    return g1[N]*g2[r]*g2[g]*g2[b]*g2[N-r-g-b]%mod

ans = 0
R = K//A
for i in range(R+1):
    if i == 0:
        if K%B == 0 and K//B <= N:
            ans += a(0,0,K//B)
        continue
    if (K - (A*i)) % B == 0:
        r = i
        b = (K - (A*i)) // B
        g = min(r,b)
        r,b = r-g, b-g
        while r+g+b <=N and g>=0:
            ans += a(r,g,b)
            r,g,b = r+1,g-1,b+1
print(ans%mod)


Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 16 18:40:19 2019

@author: Yamazaki Kenichi
"""

N,A,B,K = map(int,input().split())
mod = 998244353
def cmb(n, r, mod):
    if (r < 0 or r > n):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inv = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N+1):
    g1.append((g1[-1] * i) % mod)
    inv.append((-inv[mod % i] * (mod//i)) % mod)
    g2.append((g2[-1] * inv[-1]) % mod)
def a(r,b):
    return cmb(N,r,mod)*cmb(N,b,mod)
ans = 0
R = K//A
for i in range(R+1):
    if (K-A*i)%B == 0:
        ans += a(i,(K-A*i)//B) % mod
print(ans%mod)

Buggy python submission (verdict: Time Limit Exceeded):
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 16 15:50:39 2019

@author: Yamazaki Kenichi
"""

N,A,B,K = map(int,input().split())
mod = 998244353

T = []
R = K//A
for i in range(R+1):
    if i == 0:
        if K%B == 0 and K//B <= N:
            T.append([0,0,K//B,N-K%B])
        continue
    if (K - (A*i)) % B == 0:
        r = i
        b = (K - (A*i)) // B
        g = min(r,b)
        r,b = r-g, b-g
        while r+g+b <=N and g>=0:
            T.append([r,g,b,N-(r+g+b)])
            r,g,b = r+1,g-1,b+1
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inv = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N+1):
    g1.append((g1[-1] * i) % mod)
    inv.append((-inv[mod % i] * (mod//i)) % mod)
    g2.append((g2[-1] * inv[-1]) % mod)

ans = 0
for c in T:
    ans += g1[N]*g2[c[0]]*g2[c[1]]*g2[c[2]]*g2[c[3]]%mod
print(ans%mod)


Fixed submission:
# -*- coding: utf-8 -*-
"""
Created on Sat Mar 16 18:40:19 2019

@author: Yamazaki Kenichi
"""

N,A,B,K = map(int,input().split())
mod = 998244353
def cmb(n, r, mod):
    if (r < 0 or r > n):
        return 0
    r = min(r, n-r)
    return g1[n] * g2[r] * g2[n-r] % mod
g1 = [1, 1] # 元テーブル
g2 = [1, 1] # 逆元テーブル
inv = [0, 1] # 逆元テーブル計算用テーブル
for i in range(2, N+1):
    g1.append((g1[-1] * i) % mod)
    inv.append((-inv[mod % i] * (mod//i)) % mod)
    g2.append((g2[-1] * inv[-1]) % mod)
def a(r,b):
    return cmb(N,r,mod)*cmb(N,b,mod)
ans = 0
R = K//A
for i in range(R+1):
    if (K-A*i)%B == 0:
        ans += a(i,(K-A*i)//B) % mod
print(ans%mod)
Buggy python submission (verdict: Time Limit Exceeded):
N, M = map(int, input().split())
heights = list(map(int,input().split()))
win = []

for i in range(1, N + 1):
  win.append(i)

for i in range(M):
  x, y = map(int, input().split())
  if heights[x - 1] > heights[y - 1]:
    if y in win:
      win.remove(y)
  elif heights[x - 1] < heights[y - 1]:
    if x in win:
      win.remove(x)
  elif heights[x - 1] == heights[y - 1]:
    if x in win:
      win.remove(x)
    if y in win:
      win.remove(y)

print(len(win))

Fixed submission:
N, M = map(int, input().split())
heights = list(map(int,input().split()))
lose = []

for i in range(M):
  x, y = map(int, input().split())
  if heights[x - 1] > heights[y - 1]:
    lose.append(y)
  elif heights[x - 1] < heights[y - 1]:
    lose.append(x)
  elif heights[x - 1] == heights[y - 1]:
    lose.append(y)
    lose.append(x)

print(N - len(list(set(lose))))

Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
heights = list(map(int,input().split()))
win = []

for i in range(1, N + 1):
  win.append(i)

for i in range(M):
  x, y = map(int, input().split())
  if heights[x - 1] > heights[y - 1]:
    del win[x - 1]
  elif heights[x - 1] < heights[y - 1]:
    del win[y - 1]

print(len(win))

Fixed submission:
N, M = map(int, input().split())
heights = list(map(int,input().split()))
lose = []

for i in range(M):
  x, y = map(int, input().split())
  if heights[x - 1] > heights[y - 1]:
    lose.append(y)
  elif heights[x - 1] < heights[y - 1]:
    lose.append(x)
  elif heights[x - 1] == heights[y - 1]:
    lose.append(y)
    lose.append(x)

print(N - len(list(set(lose))))
Buggy python submission (verdict: Runtime Error):
N = int(input())
works = sorted(list(map(int,input().split())))
 
for i in range(1,N + 1):
  print(works.count(i))
  works.remove(i)

Fixed submission:
N = int(input())
works = list(map(int, input().split()))
ans = [0] * (N + 1)
 
for i in range(0,N - 1):
  
  ans[works[i]] += 1

ans.pop(0)
for i in ans:
  print(i)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
works = list(map(int, input().split()))

for i in range(1,N + 1):
  print(works.count(i))

Fixed submission:
N = int(input())
works = list(map(int, input().split()))
ans = [0] * (N + 1)
 
for i in range(0,N - 1):
  
  ans[works[i]] += 1

ans.pop(0)
for i in ans:
  print(i)
Buggy python submission (verdict: Runtime Error):
import math

K = int(input())
ans = 0

for i in range(1,K+1):
  for j in range(1,K+1):
    ab = math.gcd(a, b)
    for k in range(1,K+1):
      ans += math.gcd(ab, c)

print(ans)

Fixed submission:
import math

K = int(input())
ans = 0

for i in range(1,K+1):
  for j in range(1,K+1):
    ij = math.gcd(i, j)
    for k in range(1,K+1):
      ans += math.gcd(ij, k)

print(ans)

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

def gcd(*numbers):
    return reduce(math.gcd, numbers)

K = int(input())
ans = 0

for i in range(1,K+1):
  for j  in range(1, K+1):
    for k  in range(1, K+1):
      ans += gcd(i, j, k)

print(ans)

Fixed submission:
import math

K = int(input())
ans = 0

for i in range(1,K+1):
  for j in range(1,K+1):
    ij = math.gcd(i, j)
    for k in range(1,K+1):
      ans += math.gcd(ij, k)

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

if N <= 999:
  print("ABC")
else:
  pritn("ABD")

Fixed submission:
N = int(input())

if N <= 999:
  print("ABC")
else:
  print("ABD")
Buggy python submission (verdict: Runtime Error):
N, A, B = map(int, input().split())

if N * A > B:
  print(B)
else
  print(N * A)

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

if N * A > B:
  print(B)
else:
  print(N * A)
Buggy python submission (verdict: Runtime Error):
bells = sorted(list(map(int,input().split())))
print(bells[0] + bell[1])

Fixed submission:
bells = sorted(list(map(int,input().split())))
print(bells[0] + bells[1])
Buggy python submission (verdict: Runtime Error):
for i in string:
    sum_of_win = 1
    if i == 'o':
        sum_of_win += 1
    if i == 'x':
        sum_of_win -= 1
if sum_of_win >= 0:
    print("YES")
else:
    print("NO")

Fixed submission:
string = input()
sum_of_o = 0
for i in string:
    if i == 'o':
        sum_of_o += 1
 
if 15-len(string) >= 8 - sum_of_o:
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Runtime Error):
N = int(input())
array = []
for i in range(N):
    array.append(list(map(str, input().split())))
array_new = sorted(array, key=lambda x: (x[0], -x[1]))
for i in range(N):
    print(int(array.index(array_new[i])+1))

Fixed submission:
N = int(input())
array = []
for i in range(N):
    array.append(list(map(str, input().split())))
array_new = sorted(array, key=lambda x: (x[0], -int(x[1])))
for i in range(N):
    print(int(array.index(array_new[i])+1))
Buggy python submission (verdict: Runtime Error):
N, M = map(int, input().split())
ID = []
for i in range(M):
    K = list(map(int, input().split())) 
    ID.append(list(range(K[0], K[1]+1)))
if len(ID) == 1:
    print(len(list(range(K[0], K[1]+1))))
else:
    match = set(ID[0]) & set(ID[1])
    for i in range(M):
        match = set(ID[i]) & match
    print(len(match))

Fixed submission:
A, B = map(int, input().split())
if A >= 13:
    print(B)
elif A <= 12 and A >= 6:
    print(int(B/2))
else:
    print(0)
Buggy python submission (verdict: Runtime Error):
import numpy as np
N, M = map(int, input().split())
a = np.zeros((N,M))
for i in range(N):
    K = list(map(int, input().split())) 
    for j in K[1:]:
        a[i][j-1] = 1
b = a.sum(axis=0)
print(len(np.where(b==N)[0]))

Fixed submission:
A, B = map(int, input().split())
if B % A ==0:
    print(A+B)
else:
    print(B-A)
Buggy python submission (verdict: Runtime Error):
N,W=[int(i) for i in input().split()]
w=[]
v=[]
for i in range(N):
    a,b=[int(i) for i in input().split()]
    w.append(a)
    v.append(b)
dic={}
for i in range(N):
    dic[v[i]]=w[i]
v.sort()
val=0
wei=0
i=N-1
while wei<W:
    if wei+dic[v[i]]<=W:
         wei+=dic[v[i]]
         val+=v[i]
    i-=1
print(val)
    
    
    
    
    
        
    


Fixed submission:
def read_int():
    return int(input().strip())
 
 
def read_ints():
    return list(map(int, input().strip().split(' ')))
 
 
def solve():
    """
    OPT[N][W] = maximum value obtained with first N items and weights up to W
    OPT[N][W] = max(OPT[N-1][W-w[N]]+v[N], OPT[N-1][W])
    OPT[0][0] = 0
    """
    N, W = read_ints()
    w, v = [], []
    for _ in range(N):
        w0, v0 = read_ints()
        w.append(w0)
        v.append(v0)
    OPT = [[0]*(W+1) for _ in range(N+1)]
    for i in range(1,N+1):
        for j in range(1,W+1):
            OPT[i][j]=OPT[i-1][j]
            if j-w[i-1]>=0:
                OPT[i][j]=max(OPT[i][j],OPT[i-1][j-w[i-1]]+v[i-1])
    return OPT[-1][-1]
if __name__ == '__main__':
    print(solve())
Buggy python submission (verdict: Runtime Error):
def read_int():
    return int(input().strip())
 
 
def read_ints():
    return list(map(int, input().strip().split(' ')))
 
 
def solve():
    """
    OPT[N][W] = maximum value obtained with first N items and weights up to W
    OPT[N][W] = max(OPT[N-1][W-w[N]]+v[N], OPT[N-1][W])
    OPT[0][0] = 0
    """
    N, W = read_ints()
    w, v = [], []
    for _ in range(N):
        w0, v0 = read_ints()
        w.append(w0)
        v.append(v0)
    OPT = [[0]*(W+1) for _ in range(N+1)]
    for i in range(1,N+1):
        for j in range(1,W+1):
            OPT[i][j]=OPT[i-1][j]
            if j-w[i-1]>=0:
                OPT[i][j]=max(OPT[i][j],OPT[i-1][j-w[i-1]]+v[i-1])
    return OPT[-1][-1]
if __name__ == '__main__':
    print(solve())

Fixed submission:
N, W = map(int, input().split())
w = [0]*N
v = [0]*N
for i in range(N):
    w[i], v[i] = map(int, input().split())

V = sum(v)
dp = [[10**100]* (V + 1) for _ in range(N+1)]

dp[0][0] = 0
for i in range(N):
    for j in range(V+1):
        dp[i+1][j] = dp[i][j]
        if j-v[i] >= 0:
            dp[i+1][j] = min(dp[i+1][j], dp[i][j-v[i]] + w[i])
        

ans = 0
for j in range(V + 1):
    if dp[N][j] <= W:
        ans = j

print(ans)
Buggy python submission (verdict: Runtime Error):
def addEdge(adj, u, v):
    adj[u].append(v)
def dfs(node,dp,vis,adj):
    vis[node] = True 
    for i in range(len(adj[node])):
        if not vis[adj[node][i]]: 
            dfs(adj[node][i], dp,vis,adj)
        dp[node] = max(dp[node], 1 + dp[adj[node][i]])
        
n, m = map(int, input().split())
adj = [[] for i in range(n + 1)] 
for i in range(m):
    u,v=map(int, input().split())
    addEdge(adj,u,v)
dp=[0]*(n+1)
vis=[False]*(n+1)
for i in range(1,n+1):
    if not vis[i]:
        dfs(i,dp,vis,adj)
ans=0
for i in range(1, n + 1):   
    ans = max(ans, dp[i])  
print(ans)


Fixed submission:
def addEdge(adj, u, v):
    adj[u].append(v)
def dfs(node,dp,vis,adj):
    vis[node] = True 
    for i in range(len(adj[node])):
        if not vis[adj[node][i]]: 
            dfs(adj[node][i], dp,vis,adj)
        dp[node] = max(dp[node], 1 + dp[adj[node][i]])
import sys
sys.setrecursionlimit(10**9)
n, m = map(int, input().split())
adj = [[] for i in range(n + 1)] 
for i in range(m):
    u,v=map(int, input().split())
    addEdge(adj,u,v)
dp=[0]*(n+1)
vis=[False]*(n+1)
for i in range(1,n+1):
    if not vis[i]:
        dfs(i,dp,vis,adj)
ans=0
for i in range(1, n + 1):   
    ans = max(ans, dp[i])  
print(ans)
Buggy python submission (verdict: Runtime Error):
a, b, c= map(int,input())
sum = a + b + c
if sum >= 22:
  preint("best")
else:
  print("win")

Fixed submission:
num = list(map(int,input().split()))
sum = 0
for i in num:
  sum += i
if sum >= 22:
  print("bust")
else:
  print("win")
Buggy python submission (verdict: Time Limit Exceeded):
k, n = map(int, input().split())
a = list(map(int, input().split()))

m  = k
for i in range(n):
    b = a[i::] + a[0:i]
    r = 0
    for j in range(n-1):
        #print(r, b[j+1], b[j])
        if b[j] > b[j+1]:
            r = r + b[j+1] + (k - b[j])
        else:
            r = r + b[j+1] - b[j]
    m = min(m, r)
    #print(m,"kkkkk")
    
d = a[::-1]
for i in range(n):
    b = d[i::] + d[0:i]
    r = 0
    for j in range(n-1):
        #print(r, b[j+1], b[j])
        if b[j] > b[j+1]:
            r = r + b[j+1] + (k - b[j])
        else:
            r = r + b[j+1] - b[j]
    m = min(m, r)
print(m)

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

maxdist = 0
for i in range(n-1):
    maxdist = max(maxdist, a[i+1] - a[i])
maxdist = max(maxdist, (k - a[-1]) + a[0])
    
print(k - maxdist)
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = list(map(int, input().split()))

res = "YES"
lt = []
for i in range(n):
    if a[i] in lt:
        res = "NO"
        break
    else:
        lt.append(a[i])
print(res)

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

b = set(a)

if len(b) == len(a):
    print("YES")
else:
    print("NO")
Buggy python submission (verdict: Time Limit Exceeded):

from operator import itemgetter

n,m=map(int,input().split())
s = [ list(map(int,input().split())) for _ in range(m)]
l = sorted(s,key=itemgetter(0,1))
j=1
for i in range(0,len(l)):
    if i !=0 and l[i][0] != l[i-1][0]:
        j = 1
    l[i].append(('%06d' % l[i][0]) + ('%06d' % j))
    j = j + 1
for i in range(0,len(s)):
    for j in range(0,len(l)):
        if s[i][0] == l[j][0] and s[i][1] == l[j][1]:
            print(l[j][2])
            break

Fixed submission:
from operator import itemgetter

n,m=map(int,input().split())
s = [ list(map(int,input().split())) for _ in range(m)]
l = sorted(s,key=itemgetter(0,1))
j=1
res = {}
for i in range(0,len(l)):
    if i !=0 and l[i][0] != l[i-1][0]:
        j = 1
    res[l[i][1]] = ('%06d' % l[i][0]) + ('%06d' % j)
    j = j + 1
for i in range(0,len(s)):
    print(res[s[i][1]])
Buggy python submission (verdict: Runtime Error):
n=int(input())
xyh = [list(map(int,input().split())) for i in range(n)]

for cx in range(101):
    for cy in range(101):
        for i,r in enumerate(xyh):
            if r[2] > 1:
                ch = r[2] + abs(r[0] - cx) + abs(r[1] - cy)
                break
        j = False
        for i,r in enumerate(xyh):
            if r[2] != max((ch - abs(r[0] - cx) - abs(r[1] - cy)),0):
                j = True
                break
        if not j:
            print(cx,cy,ch)



Fixed submission:
n=int(input())
xyh = [list(map(int,input().split())) for i in range(n)]

for cx in range(101):
    for cy in range(101):
        for r in xyh:
            if r[2] > 0:
                ch = r[2] + abs(r[0] - cx) + abs(r[1] - cy)
                break
        j = False
        for r in xyh:
            if r[2] != max((ch - abs(r[0] - cx) - abs(r[1] - cy)),0):
                j = True
                break
        if not j:
            print(cx,cy,ch)

Buggy python submission (verdict: Runtime Error):
n=int(input())
xyh = [list(map(int,input().split())) for i in range(n)]

for cx in range(101):
    for cy in range(101):
        for i,r in enumerate(xyh):
            if r[2] > 1:
                ch = r[2] + abs(r[0] - cx) + abs(r[1] - cy)
        j = False
        for i,r in enumerate(xyh):
            if r[2] != ch - abs(r[0] - cx) - abs(r[1] - cy):
                j = True
                break
        if not j:
            print(cx,cy,ch)


Fixed submission:
n=int(input())
xyh = [list(map(int,input().split())) for i in range(n)]

for cx in range(101):
    for cy in range(101):
        for r in xyh:
            if r[2] > 0:
                ch = r[2] + abs(r[0] - cx) + abs(r[1] - cy)
                break
        j = False
        for r in xyh:
            if r[2] != max((ch - abs(r[0] - cx) - abs(r[1] - cy)),0):
                j = True
                break
        if not j:
            print(cx,cy,ch)
Buggy python submission (verdict: Time Limit Exceeded):
k,s=map(int,input().split())
cnt=0
for i in range(0,k+1):
    for j in range(0,k+1):
        for k in range(0,k+1):
            if i+j+k==s:
                cnt+=1
print(cnt)

Fixed submission:
k,s=map(int,input().split())
cnt=0
for x in range(0,k+1):
    for y in range(0,k+1):
        z = s-x-y
        if z >= 0 and z <= k:
            cnt+=1
print(cnt)
Buggy python submission (verdict: Runtime Error):
N, R = map(int, input().split())
if N => 10:
  O = R
else:
  O = R + 100*(10-N)
print(O)

Fixed submission:
N, R = map(int, input().split())
if N >= 10:
  O = R
else:
  O = R + 100*(10-N)
print(O)
Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
num = 0
while q > 0:
  num = num + 1
  q = N // (K**num)
print(num)

Fixed submission:
N, K = map(int, input().split())
num = 0
q = N
while q > 0:
	num = num + 1
	q = N // (K**num)
print(num)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
num = 0
while q > 0:
  num = num + 1
  q = N // (K**num)
A = num + 1
print(A)

Fixed submission:
N, K = map(int, input().split())
num = 0
q = N
while q > 0:
	num = num + 1
	q = N // (K**num)
print(num)

Buggy python submission (verdict: Runtime Error):
N, K = map(int, input().split())
num = 0
while q > 0:
  num = num + 1
  q = N // (K**num)  
print(num+1)

Fixed submission:
N, K = map(int, input().split())
num = 0
q = N
while q > 0:
	num = num + 1
	q = N // (K**num)
print(num)

Buggy python submission (verdict: Runtime Error):
N, R = map(int, input().split())
q = N/K
num = 0
while q >0:
  q = q / (K**num)
  num = num + 1
print(num)

Fixed submission:
N, K = map(int, input().split())
num = 0
q = N
while q > 0:
	num = num + 1
	q = N // (K**num)
print(num)

Buggy python submission (verdict: Runtime Error):
N, R = map(int, input().split())
q = N/K
num = 0
while q >0:
  q = q / K**num
  num = num + 1
print(num)

Fixed submission:
N, K = map(int, input().split())
num = 0
q = N
while q > 0:
	num = num + 1
	q = N // (K**num)
print(num)
Buggy python submission (verdict: Runtime Error):
N = int(input())
X = list(map(int, input().split()))
sum = 0
for x in X:
  sum = sum +(x-P)**2
print(sum)

Fixed submission:
N = int(input())
X = list(map(int, input().split()))
sum = 0
min_sum = 100000000
P = 1
while P <= 100:
  for n in X:
    sum = sum +(n-P)**2
  if sum <= min_sum:
    min_sum = sum
  P = P + 1
  sum = 0
print(min_sum)
Buggy python submission (verdict: Runtime Error):
A,B,C = map(int,input().split())

if A = B and A != C:
    print("Yes")
elif A = C and A != B:
    print("Yes")
elif B = C and A != B:
    print("Yes")
else:
    print("No")

Fixed submission:
A,B,C = map(int, input().split())
if A==B==C:
  print('No')
elif A==B or B==C or C==A:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
A,B,C = map(int, input().split())
if A=B!=C:
  print('Yes')
else:
  print('No')

Fixed submission:
A,B,C = map(int, input().split())
if A==B==C:
  print('No')
elif A==B or B==C or C==A:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
A,B,C = map(int, input().split())
if A=B!=C or A!=B=C or B!=C=A:
  print('Yes')
else:
  print('No')

Fixed submission:
A,B,C = map(int, input().split())
if A==B==C:
  print('No')
elif A==B or B==C or C==A:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
A,B,C = map(int, input().split())
if (A=B or B=C or C=A)and not(A=B=C):
  print('Yes')
else:
  print('No')

Fixed submission:
A,B,C = map(int, input().split())
if A==B==C:
  print('No')
elif A==B or B==C or C==A:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
A,B,C = map(int, input().split())
if A=B or B=C or C=A:
  print('Yes')
else:
  print('No')

Fixed submission:
A,B,C = map(int, input().split())
if A==B==C:
  print('No')
elif A==B or B==C or C==A:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
A,B,C = map(int, input().split())
if A=B or B=C or C=A:
  print('Yes')
print('No')

Fixed submission:
A,B,C = map(int, input().split())
if A==B==C:
  print('No')
elif A==B or B==C or C==A:
  print('Yes')
else:
  print('No')

Buggy python submission (verdict: Runtime Error):
A,B,C = map(int, input().split())
if A=B OR B=C OR C=A:
  print('Yes')
print('No')

Fixed submission:
A,B,C = map(int, input().split())
if A==B==C:
  print('No')
elif A==B or B==C or C==A:
  print('Yes')
else:
  print('No')
Buggy python submission (verdict: Runtime Error):
A = list(map(int, input().split()))
N = int(input())
count = 0
for a in A:
 if (a % 2 == 0 and a % 3 != 0) and (a % 2 == 0 and a % 5 != 0):
   count = count + 1

if count >= 1 :
 print('DENIED')
else:
 print('APPROVED')

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

for i in A:
    i = int(i)
    if i % 2 == 0:
        if i % 3 !=0 and i % 5 !=0:
            print("DENIED")
            exit()
print("APPROVED")

Buggy python submission (verdict: Runtime Error):
A = list(map(int, input().split()))
N = int(input())
count = 0
for a in A:
  if (a % 2 == 0 and a % 3 != 0) and (a % 2 == 0 and a % 5 != 0):
    count = count + 1

if count >= 1 :
  print('DENIED')
else:
  print('APPROVED')

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

for i in A:
    i = int(i)
    if i % 2 == 0:
        if i % 3 !=0 and i % 5 !=0:
            print("DENIED")
            exit()
print("APPROVED")

Buggy python submission (verdict: Runtime Error):
A = list(map(int, input().split()))
count = 0
for a in A:
  if (a % 2 == 0 and a % 3 != 0) and (a % 2 == 0 and a % 5 != 0):
    count = count + 1

if count => 1 :
  print('DENIED')
else:
  print('APPROVED')

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

for i in A:
    i = int(i)
    if i % 2 == 0:
        if i % 3 !=0 and i % 5 !=0:
            print("DENIED")
            exit()
print("APPROVED")
Buggy python submission (verdict: Runtime Error):
H, N = input().split()
H = int(H)
#print(H)
#H, N = input().split()
lis = list(map(int,input().split()))
A =sum(lis)
if H > A:
    print("No")
else:
    print("Yes")

Fixed submission:
H,A = map(int, input().split())
num = 0
while H >0:
  num += 1
  H -= A
print(num)
Buggy python submission (verdict: Runtime Error):
H, N = input().split()
lis = list(map(int,input().split())
A =sum(lis)
if H > A:
    print("No")
else:
    print("Yes")

Fixed submission:
H, N = input().split()
H = int(H)
#print(H)
#H, N = input().split()
lis = list(map(int,input().split()))
A =sum(lis)
if H > A:
    print("No")
else:
    print("Yes")
Buggy python submission (verdict: Runtime Error):
N,M = map(int, input().split())
if N==M:
    print("Yes")
else:
    pritn("No")

Fixed submission:
N,M = map(int, input().split())
if N==M:
    print("Yes")
else:
    print("No")

Buggy python submission (verdict: Runtime Error):
N,M = map(int, input().split())
if N==M:
    print("Yes")
else:
    pritn("NO")

Fixed submission:
N,M = map(int, input().split())
if N==M:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Runtime Error):
s=input()
if(len(s)>6s=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")