qyliang/CodeNanoFix huggingface dataset:
Buggy code:
h,n = map(int,input().split())
dg = 10**5

ba = []
for _ in [0]*n:
    a,b = map(int,input().split())
    if a >= h:
        a = h
    ba.append(b*dg + a)
ba.sort()

d = [10**9]*(h+1)
d[0] = 0

for i in range(1, h+1):
    for e in ba:
        a,b = e%dg, e//dg
        if i<=a:
            if d[i] > b:
                d[i] = b
        else:
            if d[i] > d[i-a]+b:
                d[i] = d[i-1]+b
print(d[-1])

Fixed code:
h,n = map(int,input().split())
dg = 10**5

ba = []
for _ in [0]*n:
    a,b = map(int,input().split())
    if a >= h:
        a = h
    ba.append(b*dg + a)
ba.sort()

d = [10**9]*(h+1)
d[0] = 0

for i in range(1, h+1):
    for e in ba:
        a,b = e%dg, e//dg
        if i<=a:
            if d[i] > b:
                d[i] = b
        else:
            if d[i] > d[i-a]+b:
                d[i] = d[i-a]+b
print(d[-1])
Buggy code:

     

import math



H,N = map(int,input().split())
Damage = []
Cost = []


DP = [0] + [pow(10,9)] * (H+1)



for i in range(N):
    a,b = map(int,input().split())
    Damage.append(a)
    Cost.append(b)
    
#print(DP)


# DP[i] = min magic points to do i damage

for i in range(1,len(DP)):
    for spell in range(N):
        DP[i] = min(DP[i],DP[max(0,i-Damage[spell])]+Cost[spell])




Fixed code:

     

import math



H,N = map(int,input().split())
Damage = []
Cost = []


DP = [0] + [pow(10,9)] * (H+1)



for i in range(N):
    a,b = map(int,input().split())
    Damage.append(a)
    Cost.append(b)
    
#print(DP)


# DP[i] = min magic points to do i damage

for i in range(1,len(DP)):
    for spell in range(N):
        DP[i] = min(DP[i],DP[max(0,i-Damage[spell])]+Cost[spell])




print (DP[H])
Buggy code:
h,n=map(int,input().split())
a,b=[],[]
for i in range(n):
  aa,bb=map(int,input().split())
  a.append(aa)
  b.append(bb)
inf=float("inf")
dp=[[inf]*(h+1) for i in range(n+1)]
dp[0][0]=0
for i in range(n):
  for j in range(h):
    dp[i+1][j]=min(dp[i+1][j],dp[i][j])
    dp[i+1][min(h,j+a[i])]=min(dp[i+1][j]+b[i],dp[i+1][min(h,j+a[i])])
    
print(dp[n][h])

Fixed code:
h,n=map(int,input().split())
a,b=[],[]
for i in range(n):
  aa,bb=map(int,input().split())
  a.append(aa)
  b.append(bb)
inf=float("inf")
dp=[[inf]*(h+1) for i in range(n+1)]
dp[0][0]=0
for i in range(n):
  for j in range(h+1):
    dp[i+1][j]=min(dp[i+1][j],dp[i][j])
    dp[i+1][min(h,j+a[i])]=min(dp[i+1][j]+b[i],dp[i+1][min(h,j+a[i])])
    
print(dp[n][h])
Buggy code:
import sys
input = sys.stdin.readline()
H,N = map(int,input().split())
spells = [list(map(int,input().split())) for i in range(N)]
INF = 10**10
dp = [INF]*(H+1)
dp[0] = 0
for use in spells:
    damage = use[0]
    mp = use[1]
    for i in range(1,H+1):
        dp[i] = min(dp[max(0,i-damage)] + mp, dp[i])
print(dp[-1])


Fixed code:
import sys
input = sys.stdin.readline
H,N = map(int,input().split())
spells = [list(map(int,input().split())) for i in range(N)]
INF = 10**10
dp = [INF]*(H+1)
dp[0] = 0
for use in spells:
    damage = use[0]
    mp = use[1]
    for i in range(1,H+1):
        dp[i] = min(dp[max(0,i-damage)] + mp, dp[i])
print(dp[-1])
Buggy code:
H,N = map(int,input().split())
A = []
B = []
for i in range(N):
    a,b = map(int,input().split())
    A.append(a)
    B.append(b)
h = 2*10**4
dp = [10**9 for i in range(x+1)]
dp[0] = 0
for i in range(N):
    a = A[i]
    b = B[i]
    for j in range(x+1):
        if j < a:
            continue
        dp[j] = min(dp[j-a]+b,dp[j])
ans = 10**9
for i in range(H,x+1):
    ans = min(ans,dp[i])
print(ans)

Fixed code:
H,N = map(int,input().split())
A = []
B = []
for i in range(N):
    a,b = map(int,input().split())
    A.append(a)
    B.append(b)
x = max(A)
dp = [10**9 for i in range(H+x+1)]
dp[0] = 0
for i in range(N):
    a = A[i]
    b = B[i]
    for j in range(H+x+1):
        if j < a:
            continue
        dp[j] = min(dp[j-a]+b,dp[j])
ans = 10**9
for i in range(H,H+x+1):
    ans = min(ans,dp[i])
print(ans)
Buggy code:
N, M = map(int, input().split())

if N == M:
    print('Yes')
else
    print('No')

Fixed code:
N,M  = list(map(int,input().split()))
if N == M:
	print("Yes")
else:
	print("No")
Buggy code:
a, b = map(int,input.split())
if a == b:
  print("Yes")
  else:
    print("No")

Fixed code:
a, b = list(map(int,input().split()))
if(a == b):
    print('Yes')
else:
    print('No')
Buggy code:
N,M=(int(x) for x in input().split())

if N===M:
    print('Yes')
else:
    print('No')

Fixed code:
N,M=(int(x) for x in input().split())

if N==M:
    print('Yes')
else:
    print('No')
Buggy code:
i = list(map(int, input().split()))

if i[0] = i[1]:
  print('Yes')
else:
  print('No')

Fixed code:
i = list(map(int, input().split()))

if i[0] == i[1]:
  print('Yes')
else:
  print('No')
Buggy code:
N, M = map(int, input().split())

if(N = M):
  print("Yes")
else:
  print("No")

Fixed code:
N, M = list(map(int, input().split()))

if N == M:
    print('Yes')
else:
    print('No')
Buggy code:
a,b = map(int,input().split())
print(a,b)
if a == b:
  print("Yes")
else:
  print("No")

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

if a == b:
  print("Yes")
else:
  print("No")
Buggy code:
N,M=map(int, input().split())

if X==M:
	print('Yes')
else:
	print('No')

Fixed code:
N, M = map(int, input().split())

if M == N:
    print("Yes")
else:
    print("No")
Buggy code:
a = input()

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

Fixed code:
N , M = map(int,input().split())
if N == M:
    print("Yes")
else:
    print("No")
Buggy code:
n,m = map(int,input().split())
if n == m:
  print(Yes)
else:
  print(No)

Fixed code:
n,m=map(int,input().split())
if n==m:
	print("Yes")
else:
	print("No")
Buggy code:
N, M = map(int, input().split())
if N >= M: print('Yes')
else: print('No')

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

Fixed code:
N , M = map(int, input().split())

if N == M:
    print('Yes')
else:
    print('No')
Buggy code:
n, l = map(int, input().split)
if n = l:
  print("Yes")
 else:
  print("No")

Fixed code:
n, l = map(int, input().split())
if n == l:
  print("Yes")
else:
  print("No")
Buggy code:
N,M = map(int,input().split())
if N == M:
  print("Yes")
  
 else:
  print("No")
  

Fixed code:
N, M = list(map(int, input().split()))

if N == M:
    print("Yes")
else:
    print("No")
Buggy code:
a,b=input.split()

if(a=b):
  print("Yes")
  
if(a!=b):
  print("No")

Fixed code:
a,b=input().split()
if(a==b):
  print("Yes")
if(a!=b):
  print("No")
Buggy code:
a, b = map(int, input().split())
if a==b:
    pront("Yes")
else:
    print("No")

Fixed code:
a, b = map(int, input().split())
if a==b:
    print("Yes")
else:
    print("No")
Buggy code:
N, M = [int(i) for i in input().split()]

if (N == M):
    print(Yes)
else:
    print(No)

Fixed code:
N, M = [int(i) for i in input().split()]

if (N == M):
    print('Yes')
else:
    print('No')
Buggy code:
N, M =map(int, input().split())
if('Yes' if N==M else 'No')

Fixed code:
N,M=map(int,input().split())
print('Yes'if N==M else'No')
Buggy code:
N, M = map(int, input().split())

if N > M:
    print('Yes')
else:
    print('No')

Fixed code:

N, M = map(int, input().split())

if N == M:
    print('Yes')
else:
    print('No')
Buggy code:
n,m=map(int,input().split)
if n==m:
  print("Yes")
else:
  print("No")

Fixed code:
n,m = map(int, input().split(' '))
if n == m:
    print('Yes')
else:
    print('No')
Buggy code:
x=[int(x) for i in input().split()]
if x[0]==x[1]:
  print("Yes")
else:
  print("No")

Fixed code:
x=[int(k) for k in input().split()]
if x[0]==x[1]:
  print("Yes")
else:
  print("No")
Buggy code:
n, m = (int(x) for x in input().split())
if n == m:
    print('Yes')
else:
    print('no')

Fixed code:
n, m = (int(x) for x in input().split())
if n == m:
    print('Yes')
else:
    print('No')
Buggy code:
N, M = map(int, input().split())

if N == M:
    print('Yes')
else:
    printf('No')

Fixed code:
M, N = map(int, input().split())

if M == N:
    print("Yes")
else:
    print("No")
Buggy code:
num1, num2 = [int(i) for i in input().split()]
if num1 == num2
    print('Yes')
else
    print('No')

Fixed code:
num1, num2 = [int(i) for i in input().split()]
if num1 == num2:
    print('Yes')
else:
    print('No')
Buggy code:
n, m = map(input().split())
print('Yes' if n == m else 'No')

Fixed code:
n,m= map(int, input().split())
print('Yes' if n==m else 'No')
Buggy code:
A,B = map(int,input().split())
if A = B :
    print "Yes"
else :
    print "No"
  

Fixed code:
A,B = map(int,input().split())
if A == B :
    print ("Yes")
else :
    print ("No")
Buggy code:
N,M = map(int,input().split())
if N = M:
    print("Yes")
else:
    print("No")

Fixed code:
N,M = input().split()
N = int(N)
M = int(M)

if N==M:
    print('Yes')
else:
    print('No')
Buggy code:
from sys import stdin
n,m = map(int,stdin.readline().split()
print("Yes" if n==m else "No")

Fixed code:
from sys import stdin
n,m = map(int,stdin.readline().split())
print("Yes" if n==m else "No")
Buggy code:
a, b = input().split
if a == b:
  print("Yes")
else:
  print("No")

Fixed code:
a,b = input().split()
a = int(a)
b = int(b)
if a==b:
    print("Yes")
else:
    print("No")
Buggy code:
n,m==map(int,input().split())
if n==m:
    print("Yes")
else:
    print("No")

Fixed code:
n, m = map(int, input().split())

if n==m:
  print("Yes")
else:
  print("No")
Buggy code:

n, m = int(input()).split()

if m == n:
    print('Yes')
else:
    print('No')

Fixed code:

n, m = input().split()
n = int(n)
m = int(m)

if m == n:
    print('Yes')
else:
    print('No')
Buggy code:
m,n = map(int,input().split())
if(m == n):
  print(Yes)
else:
  print(No)

Fixed code:


n,m=map(int,input().split())

if(n==m):
	print('Yes')
else:
	print('No')
Buggy code:
a =list(map(int,input().split(' ')))
[print('Yes') if a[0] == a[1] print('No')]

Fixed code:
a =list(map(int,input().split(' ')))
[print('Yes') if a[0] == a[1] else print('No')]
Buggy code:
    n, m = list(map(int, input().split()))
    if n==m:
        print("Yes")
    else:
        print("No")

Fixed code:
n, m = map(int, input().split())
if m == n:
	print("Yes")
else:
	print("No")
Buggy code:
N, M = map(int, input().split())

if N > M:
    print('Yes')
else:
    print('No')


Fixed code:
N, M = map(int,input().split())

if N == M:
    print('Yes')

else:
    print('No')
Buggy code:
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

if N == M:
    print('Yes')
else:
    print('No')

Fixed code:
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

N, M = rl()

if N == M:
    print('Yes')
else:
    print('No')
Buggy code:
n,m = map(int(input().split()))
if n == m:
  print'Yes'
else:
  print'No'

Fixed code:
n, m = map(int,input().split())
if n == m:
    print('Yes')
else:
    print('No')
Buggy code:
N,M = list(map(int,input().split()))
if N = M:
  print('Yes')
else:
  print('No')

Fixed code:
N, M = map(int, input().split())

if N == M:
    print('Yes')
else:
    print("No")
Buggy code:
a = [int(i) for i in input().split()]
if a[0] == a[1]:
  print('Yes')
else
  print('No')
  

Fixed code:
a = [int(i) for i in input().split()]
if a[0] == a[1]:
  print('Yes')
else:
  print('No')
Buggy code:
def acinput():
    return list(map(int, input().split(" ")))



import numpy as np
#from functools import reduce
import matha
import string
import itertools
import fractions
import heapq
import collections
import re
import array
import bisect
import sys
import random
import time
import copy
import functools

N,M=acinput()

if N==M:
    print("Yes")
else:
    print("No")


Fixed code:
def acinput():
    return list(map(int, input().split(" ")))



import numpy as np
#from functools import reduce
import math
import string
import itertools
import fractions
import heapq
import collections
import re
import array
import bisect
import sys
import random
import time
import copy
import functools

N,M=acinput()

if N==M:
    print("Yes")
else:
    print("No")
Buggy code:
a,b = (int(x) for x in input().split

if a == b:
       print ("Yes")
else:
       print ("No")

Fixed code:
a,b=(int(x) for x in input().split())
if a == b:
  print("Yes")
else:
  print("No")
Buggy code:
    a,b=map(int,input().split())
    if b<a:
      print("No")
    else:
      print("Yes")

Fixed code:

a, b = map(int, input().split())
if a == b: print("Yes")
else:print("No")
Buggy code:
n. k = map(int, input().split())
if(n == k):
  print('Yes')
else:
  print('No')


Fixed code:
n, k = map(int, input().split())
if(n == k):
  print('Yes')
else:
  print('No')
Buggy code:
a,b = map(int, input().split())

if a=b:
   print('Yes')
else:
  print('No')

Fixed code:
a,b = input().split()
a = int(a)
b = int(b)
if(a==b):
    print("Yes")
else:
	print("No")
Buggy code:
N,M = int(input()).split()

if N == M:
  print("Yes")
else:
  print("No")
    

Fixed code:

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

Fixed code:
N,M = map(int,input().split())
print("Yes" if N == M else "No")
Buggy code:
n, m = map(int(), input().split())
if n == m:
  print('Yes')
else:
  print('No')

Fixed code:
m,n=map(int,input().split()) 
if(m==n):
  print("Yes")
else:
  print("No")
Buggy code:
N,M=map(int, input().split())
if N==m:
  print('Yes')
else:
  print('No')

Fixed code:
N,M=map(int,input().split())
if M==N:
  print('Yes')
else:
  print('No')
Buggy code:
from sys import stdin
input = sys.stdin.buffer.readline
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

n, m = MAP()
print('Yes') if n == m else print('No')

Fixed code:
import sys
input = sys.stdin.buffer.readline
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))


n, m = MAP()
print('Yes') if n == m else print('No')
Buggy code:
m,n = [int(x) for x in input().split()]
if m==n:
	print("Yes")
else
	print("No")

Fixed code:
n,m = [int(x) for x in input().split()]
if n==m:
	print("Yes")
else:
	print("No")
Buggy code:
n, m = input().split()

if n = m:
  print('Yes')
else:
  print('No')

Fixed code:
n, m = input().split()

if n == m:
  print('Yes')
else:
  print('No')
Buggy code:
if len(set(input().split()))1:
    print("Yes")
else:
    print("No")

Fixed code:
if len(set(input().split()))==1:
    print("Yes")
else:
    print("No")
Buggy code:
a,b=map(input().split())
if a==b:
    print("Yes")
else:
    print("No")    
    

Fixed code:
a,b=map(int,input().split())
if a==b:
    print("Yes")
else:
    print("No")
Buggy code:
n, m = map(int, input().split())

if n == m:
  print('Yes'):
else:
  print('No')

Fixed code:
n, m = map(int, input().split())

if n != m:
    print("No")
else:
    print("Yes")
Buggy code:
a = list(map(int,input().split()))
if a[0] == a[1]:
    print('Yes')
elif:
    print('No')

Fixed code:
a = list(map(int,input().split()))
if a[0] == a[1]:
    print('Yes')
else:
    print('No')
Buggy code:
n,m = int(input().split())
if m==n:
  print("Yes")
else:
  print("No")

Fixed code:
n ,m = map(int, input().split())
if n == m:
    print('Yes')
else:
    print('No')
Buggy code:
N, M = map(int, input().split())

if N == M: print 'Yes'
else: print 'No'

Fixed code:
N, M = map(int, input().split())

if N == M: 
    print ('Yes')
else: 
    print ('No')
Buggy code:
n,m=map(int,input().split())
if(n==m)
	print('Yes')
else:
  print('No')


Fixed code:
n,m=map(int, input().split())
if n==m:
    print("Yes")
else:
    print("No")
Buggy code:
def main():
    N, M = list(map(int,input().split())
    if N == M:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()


Fixed code:
def main():
    N, M = list(map(int,input().split()))
    if N == M:
        print('Yes')
    else:
        print('No')

if __name__ == "__main__":
    main()
Buggy code:
n,m=map(int,input().split())
print('Yes' if n=m else 'No')

Fixed code:
n,m=map(int,input().split())
if n==m:
  	print("Yes")
else:
  print("No")
Buggy code:
a,b = map(int, input().split())
if a == b:
  print('Yes')
else:
  print('No)

Fixed code:
a,b = map(int, input().split())
if a == b:
  print('Yes')
else:
  print('No')
Buggy code:
n,m = map(int,input().split())

if n = m:
  print("Yes")
else:
  print("No")

Fixed code:
n, m = map(int, input().split())

if n == m:
    ans = 'Yes'
else:
    ans = 'No'

print(ans)
Buggy code:
n,m=map(int,input().split())
if n==m:
  print("Yes")
else:
  print("No
        ")

Fixed code:
n,m = map(int, input().split())
print('Yes' if n==m else 'No')
Buggy code:
a=list(map(a,input().split())
if(a[0]==a[1]):
       print("Yes")
else:
       print("No")

Fixed code:
a=list(map(lambda x:x,input().split()))
if(a[0]==a[1]):
       print("Yes")
else:
       print("No")
Buggy code:
N, M map(int, input().split())
print("Yes" if N==M else "No")

Fixed code:
N, M = map(int, input().split())

if M==N:
    print("Yes")
else:
    print("No")
Buggy code:

a, b = map(int, input(), split())
if a == b:
    print("Yes")
else:
    print("No")


Fixed code:
a, b = map(int, input().split())
if a == b:
    print("Yes")
else:
    print("No")
Buggy code:
n, m = input().split(' ')
if n == m :
    print('Yes')

print('No')

Fixed code:
n, m = input().split(' ')
if n == m :
    print('Yes')
else:
    print('No')
Buggy code:
n,m=map(int,input().split())
if(n<m):
    print("No")
else:
    print("Yes")

Fixed code:
n,m=map(int,input().split())

if n==m :
  print("Yes")
else:
  print("No")
Buggy code:
I,U = input().split()
print("Yes" if I==U else No)

Fixed code:
I,U = input().split()
print("Yes" if I==U else "No")
Buggy code:
N,M=map(int,input().split())
if N=M :
  print("Yes") 
else:
  print("No") 


Fixed code:
N,M = list(map(int, input().split()))

if(N == M):
    print('Yes')
else:
    print('No')
Buggy code:
N,M=map(int,input().split())
print("Yes" if N=M else "No") 

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

Fixed code:
M,N = map(int, input().split())
if M == N:
    print("Yes")
else:
    print("No")
Buggy code:
# coding: utf-8
# Your code here!

n,m = map(int, input.split())

if n == m:
    print('Yes')
else:
    print('No')

Fixed code:
# coding: utf-8
# Your code here!

n,m = map(int, input().split())

if n == m:
    print('Yes')
else:
    print('No')
Buggy code:
N, M = map(int, input.split())
print('Yes') if N == M else print('No')

Fixed code:
N, M = map(int, input().split())

if N == M :
  print('Yes')
else :
  print('No')
Buggy code:
N, M = input().split(" ")
N = int(N)
M = int(N)

if N == M:
  print("Yes")
else:
  print("No")

Fixed code:
N, M = input().split(" ")
N = int(N)
M = int(M)

if N == M:
  print("Yes")
else:
  print("No")
Buggy code:
def get(text,n):
    ans = [""]*n
    i = 0
    for x in text:
        if x==" ":
            i = i + 1
        ans[i] = ans[i]+x
    return ans

text = input()

if get(text,2)[0] == get(text,2)[1]:
    print("Yes")
else:
    print("No")

Fixed code:
def get(text,n):
    ans = [""]*n
    i = 0
    for x in text:
        if x==" ":
            i = i + 1
        ans[i] = ans[i]+x
    return ans

text = input()

if int(get(text,2)[0]) == int(get(text,2)[1]):
    print("Yes")
else:
    print("No")
Buggy code:
N M =map(int,input().split())
if N==M:
  print("Yes")
else:
  print("No")

Fixed code:
N,M = input().split()
N = int(N)
M = int(M)

if N == M:
  print('Yes')
else:
  print('No')
Buggy code:
a = input().split()
N = int(a[0])
M = int(a[0])
if N == M :
  print("Yes")
else:
  print("No")


Fixed code:
a = input().split()
N = int(a[0])
M = int(a[1])
if N == M :
  print("Yes")
else:
  print("No")
Buggy code:
n,m=map(int,input().split())
if n==M:
    print("Yes")
else:
    print("No")

Fixed code:
m,n=map(int,input().split())
if m==n:
  print("Yes")
else:
  print("No")
Buggy code:
# !/usr/nbin/python3

"""
https://atcoder.jp/contests/abc152/tasks/abc152_a
AC or WA.
"""

def solve(n, m):
    if n == m: print("YES")
    else: print("NO")

if __name__ == "__main__":
    n, m = list(map(int, input().split()))

    solve(n, m)


Fixed code:
# !/usr/nbin/python3

"""
https://atcoder.jp/contests/abc152/tasks/abc152_a
AC or WA.
"""

def solve(n, m):
    if n == m: print("Yes")
    else: print("No")

if __name__ == "__main__":
    n, m = list(map(int, input().split()))

    solve(n, m)
Buggy code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


def main():
    H, N = map(int, input().split())
    print('Yes' if H == N else 'NO')


if __name__ == "__main__":
    main()


Fixed code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-


def main():
    H, N = map(int, input().split())
    print('Yes' if H == N else 'No')


if __name__ == "__main__":
    main()
Buggy code:
N,M = map(input().split())
if N == M:
  print("Yes")
else:
  print("No")

Fixed code:
M, N = map(int, input().split())

if M == N:
  print('Yes')
else:
  print('No')
Buggy code:
N,M = map(int,input().split())
if M >= N:
  print("Yes")
else
  print("No")

Fixed code:
N,M=map(int,input().split())
if(N==M):
  print('Yes')
else:
  print('No')
Buggy code:
n,m = map(input().split())

if n == m:
    print('Yes')
else:
    print('No')

Fixed code:
n, m=map(int,input().split())
if n==m:
    print('Yes')
else:
    print('No')
Buggy code:
n, m = map(int, input().split())
print("Yes") if n == M else print("No")

Fixed code:
n,m=map(int,input().split())
print("Yes" if n == m else "No")
Buggy code:
[N,M] = [int(s) for s in input().rstrip().split(" ")
if N - M == 0:
	print("Yes")
else:
    print("No")

Fixed code:
[N,M] = [int(s) for s in input().rstrip().split(" ")]
if N == M:
  print("Yes")
else:
  print("No")
Buggy code:
N,M = map(int,input().split())

if M == N:
  print(Yes)
else:
  print(No)

Fixed code:
N,M = map(int,input().split())

if M == N:
  print("Yes")
else:
  print("No")
Buggy code:
n, m = map(int, input().split())
if n == m:
  print('Yes')
else:
  print(('No")
  

Fixed code:
n,m=list(map(int,input().split()))
if n==m:
    print("Yes")
else:
    print("No")
Buggy code:
,b = input().split()
if a == b:
  print('Yes')
else:
  print('No')

Fixed code:
a,b = input().split()
if a == b:
  print('Yes')
else:
  print('No')
Buggy code:
n, m = list(map(int, input().split()))
print('Yes') if n == M else print('No')


Fixed code:
n, m = list(map(int, input().split()))
print('Yes') if n == m else print('No')
Buggy code:
S = "N M"
S = S.split(" ")
N = S[0]
M = S[1]

if N == M :
    print ("Yes")
else :
    print ("No")
    

Fixed code:
S = input()
S = S.split(" ")
N = S[0]
M = S[1]

if N == M :
    print ("Yes")
else :
    print ("No")
Buggy code:
a = input().rstrip().split()
if a[0] = a[1]:
  print('Yes')
else:
  print('No')

Fixed code:
a = input().rstrip().split()
if a[0] == a[1]:
  print('Yes')
else:
  print('No')
Buggy code:
n,m=map(int,input().split())
if n=m:
  print("Yes")
else:
  print("No")

Fixed code:
n,m=map(int,input().split())
if n==m:
  print("Yes")
else:
  print('No')
Buggy code:
N,M=map(int,input().split())

if(N==M):
    print("Yes")
else:
    ("No")

Fixed code:
N, M = list(map(int, input().split()))

if N == M:
  print("Yes")

else:
  print("No")
Buggy code:
n, m = int(input()).split()
print('Yes') if n==m else print('No')

Fixed code:
n, m = input().split()
print('Yes') if n==m else print('No')
Buggy code:
n, m = [int for x in input().split()]

if n==m :
    print('Yes')
else:
    print('No')

Fixed code:
n, m = [int(x) for x in input().split()]

if n==m :
    print('Yes')
else:
    print('No')