qyliang/CodeNanoFix huggingface dataset:
Buggy code:
a,b,c = map(input().split())
out = a[0] + b[0] + c[0]
print(out)

Fixed code:
a,b,c = map(str, input().split())
out = a[0] + b[0] + c[0]
print(out)
Buggy code:
s=list(map(str,input().split()))

print(''.join([s[0][0],s[1][0],s[2][0]]))s=list(map(int,input().split()))



Fixed code:
s=list(map(str,input().split()))

print(''.join([s[0][0],s[1][0],s[2][0]]))
Buggy code:
a,b,c = input().split()
print("A" + B[0] +"C")

Fixed code:
a,b,c = input().split()
print("A" + b[0] +"C")
Buggy code:
a,b,c = input().split()
print(a[0]+b[0]+c[0]

Fixed code:
a, b, c = input().split()
print(a[0]+b[0]+c[0])
Buggy code:
_,s_=input().split()
print('A'+s[0]+'C')

Fixed code:
_,s,_=input().split()
print('A'+s[0]+'C')
Buggy code:
str_line = input().split(" ")
num_line = [int(n) for n in str_line]
num_line.sort()

if (num_line[0] == num_line[1] + num_line[2]):
    print("Yes")
else:
    print("No")

Fixed code:
str_line = input().split(" ")
num_line = [int(n) for n in str_line]
num_line.sort()
#print(num_line)

if (num_line[2] == num_line[1] + num_line[0]):
    print("Yes")
else:
    print("No")
Buggy code:
a, b, c= map(int, input().split())

Inp = [a,b,c]
Sum = 0

print(Inp)
max_num = max(Inp)
Inp.remove(max_num)
for i in Inp: Sum += i
if max_num == Sum: print('Yes') 
else: print('No')

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

Inp = [a,b,c]
Sum = 0
max_num = max(Inp)
Inp.remove(max_num)
for i in Inp: Sum += i
if max_num == Sum: print('Yes') 
else: print('No')
Buggy code:
a = list(map(int,input().split()))
a.sort()
if a[0] + a[1] == a[2]:
  print("Yes")
else:
  print("NO")


Fixed code:
a = list(map(int,input().split()))
a.sort()
if (a[0] + a[1]) == a[2]:
  print("Yes")
else:
  print("No")
Buggy code:
ys = list(map(int,input().split()))
ys.sort()
print('Yes' if ys[0]+ys[1]==y[2] else 'No')

Fixed code:
ys = list(map(int,input().split()))
ys.sort()
print('Yes' if ys[0]+ys[1]==ys[2] else 'No')
Buggy code:
a, b, c = map(int,input().split())
if a + b = c or b + c = a or a + c = b:
  print("Yes")
else:
  print("No")

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

print("Yes" if a==b+c or b==a+c or c== a+b else "No")
Buggy code:
a,b,c = map(int,input().split())
l = [a,b,c]
l.sort()
if l[0] + 1[1] == 1[2]:
  print("Yes")
else:
  print("No")

Fixed code:
a,b,c = map(int,input().split())
l = [a,b,c]
l.sort()
if l[0] + l[1] == l[2]:
  print("Yes")
else:
  print("No")
Buggy code:
a,b,c=map(int,input().split())
sm=a+b+c
half=sm//2
if sm%2==0:
    print("No")
else:
    if a==half or b==half or c==half or a+b==half or b+c==half or c+a==half:
        print("Yes")
    else:
        print("No")

Fixed code:
a,b,c=map(int,input().split())
sm=a+b+c
half=sm//2
if sm%2==1:
    print("No")
else:
    if a==half or b==half or c==half or (a+b)==half or (b+c)==half or (c+a)==half:
        print("Yes")
    else:
        print("No")
Buggy code:
a,b,c=map(int,input.split())
print('Yes')if sum(a,b,c) == max(a,b,c)*2 else print('No')

Fixed code:
a,b,c=map(int,input().split())
print('Yes')if a+b+c == max(a,b,c)*2 else print('No')
Buggy code:
p = list(map(int, input().split())).sort()
print('Yes' if p[0]+p[1]==p[2] else 'No')

Fixed code:
n=list(map(int,input().split()))
n.sort()
print("Yes" if n[2]==n[0]+n[1] else "No")
Buggy code:
a=[int(i) for i in input().split()]
if a[0]==sum(a[1:]) or sum(a[:2])==a[2]:
  print("Yes")
else:
  print("No")

Fixed code:
a=[int(i) for i in input().split()]
if a[0]==sum(a[1:]) or sum(a[:2])==a[2] or a[0]+a[2]==a[1]:
  print("Yes")
else:
  print("No")
Buggy code:
a,b,c=map(int,input().split())
if a+b==c:
    print("Yes")
if a+c==b:
    print("Yes")
if c+b==a:
    print("Yes")
else:
    print("No")

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

if a+b == c or b+c == a or c+a == b:
  print('Yes')
else:
  print('No')
Buggy code:
x,y,z = map(int, input().split())
a = [x,y,z]
a.sort(reverse=True)

if a[0] == a[1] + a[2]:
    print ("Yes")
else:
    print ("NO")

Fixed code:
x,y,z = map(int, input().split())
a = [x,y,z]
a.sort(reverse=True)

if a[0] == (a[1] + a[2]) :
    print ("Yes")
else:
    print ("No")
Buggy code:
l=list(map(int,input().split()))
l=sorted(l)
if s[0]+l[1]==s[2]:
  print('Yes')
else:
  print('No')

Fixed code:
l=list(map(int,input().split()))
l=sorted(l)
if (l[0]+l[1])==l[2]:
  print('Yes')
else:
  print('No')
Buggy code:
A = map(int,input().split())
A.sort()
if A[0]+A[1] == A[2]:
  print("Yes")
else:
  print("No")

Fixed code:
A = list(map(int,input().split()))
A.sort()
if A[0]+A[1] == A[2]:
  print("Yes")
else:
  print("No")
Buggy code:
a,b,c = map(int,input().split())
d = a/3 + b/3 + c/3
if d == a or d == b or d == c:
  print("Yes")
else:
  print("No")


Fixed code:
a,b,c = map(int,input().split())
d = a/2 + b/2 + c/2
if d == a or d == b or d == c:
  print("Yes")
else:
  print("No")
Buggy code:
a, b, c = map(int, input().split())

if a+b-c==0 or b+c-a==0 or c+a-c==0:
  print('Yes')
else:
  print('No')

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

if a+b-c==0 or b+c-a==0 or c+a-b==0:
  print('Yes')
else:
  print('No')
Buggy code:

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

P = [a,b,c]

P.reverse()
if P[0] == P[1] +P[2]:
    print('Yes')
else:
    print('No')

Fixed code:

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

P = [a,b,c]

P.sort(reverse=True)
if P[0] == P[1] +P[2]:
    print('Yes')
else:
    print('No')
Buggy code:
a, b, c = map(int, input().split())
input = [a, b, c]
saidai = max(input)
nokori = input.remove(saidai)

if saidai == sum(nokori):
    print('Yes')
else:
    print('No')

Fixed code:
a, b, c = map(int, input().split())
nyuryoku = [a, b, c]
saidai = max(nyuryoku)
nyuryoku.remove(saidai)

if saidai == sum(nyuryoku):
    print('Yes')
else:
    print('No')
Buggy code:
a = list(map(int, input().split()))
sum = a[0] + a[1] + a[2]
if sum - a[0] == sum / 2 or sum - a[0] == sum / 2 or sum - a[2] == sum / 2:
    print("Yes")
else:
    print("No")


Fixed code:
a = list(map(int, input().split()))
sum = a[0] + a[1] + a[2]
if sum - a[0] == sum / 2 or sum - a[1] == sum / 2 or sum - a[2] == sum / 2:
    print("Yes")
else:
    print("No")
Buggy code:
a, b, c = map(int, input().split())
if a + b = c or b + c = a or c + a = b:
    print('Yes')
else:
    prtnt('No')


Fixed code:
a, b, c = map(int, input().split())
if a+b == c or a+c == b or b+c == a:
  print('Yes')
else:
  print('No')
Buggy code:
print("Yes" if (lambda x: x[0] == sum(x[1:]) or sum(x[0:2]) == x[2])([int(i) for i in input().split()]) else "No")

Fixed code:
print("Yes" if (lambda x: x[0] == sum(x[1:]) or sum(x[0:2]) == x[2])(sorted([int(i) for i in input().split()])) else "No")
Buggy code:
def main():
    t = list(map(int, input().split()))
    if sum(t[0:2]) == t[2] or sum(t[1:2]) == t[0] or sum(t[::2]) == t[1]:
        print('Yes')
    else:
        print('NO')

if __name__ == '__main__':
    main()


Fixed code:
def main():
    t = list(map(int, input().split()))
    if sum(t[0:2]) == t[2] or sum(t[1:]) == t[0] or sum(t[::2]) == t[1]:
        print('Yes')
    else:
        print('No')

if __name__ == '__main__':
    main()
Buggy code:
a, b, c = sorted(map(int.input().split()))

print("YES" if a+b == c else "No")

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

print("Yes" if a+b==c else "No")
Buggy code:
# -*- coding: utf-8 -*-
# problem A

l = list(map(int, input().split()))
l.sort
if (l[0] + l[1]) == l[2]:
    print("Yes")
else:
    print("No")

Fixed code:
# -*- coding: utf-8 -*-
# problem A

l = list(map(int, input().split()))
l = sorted(l)

if l[0] + l[1] == l[2]:
    print("Yes")
else:
    print("No")
Buggy code:
a,b,c = map(int,input().split())

if max(a,b,c) == sum(a,b,c) - max(a,b,c):
  print("Yes")
else:
  print("No")

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

if max(a,b,c) == a+b+c - max(a,b,c):
  print("Yes")
else:
  print("No")
Buggy code:
a,b,c = map(int,input().split())
if(a+b==c or a+c==b):
  print("Yes")
else:
  print("No")

Fixed code:
a,b,c = map(int,input().split())
if a + b == c or b + c == a or c + a == b:
    print("Yes")
else:
    print("No")
Buggy code:
a=map(int,input().split())
a.sort()
print("Yes" if a[0]+a[1]==a[2] else "No")

Fixed code:
a=list(map(int,input().split()))
a.sort()
print("Yes" if a[0]+a[1]==a[2] else "No")
Buggy code:
lst = [map(int, input().split())]
lst = lst.sorted()
print('Yes' if lst[0] + lst[1] == lst[2] else 'No')

Fixed code:
lst = list(map(int, input().split()))
lst = sorted(lst)
print('Yes' if lst[0] + lst[1] == lst[2] else 'No')
Buggy code:
a, b, c = map(int, input().split())
list = [a, b, c]
list.sort()
if list[0] + list[1]:
    print("Yes")
else:
    print("No")


Fixed code:
a, b, c = map(int, input().split())
list = [a, b, c]
list.sort()
if list[0] + list[1] == list[2]:
    print("Yes")
else:
    print("No")
Buggy code:
lst = [int(i) for i in input().split()]

m = max(lst)
if sum(lst) = 2*m:
  print('Yes')
else:
  print('No')

Fixed code:
lst = [int(i) for i in input().split()]

m = max(lst)
if sum(lst) == 2*m:
  print('Yes')
else:
  print('No')
Buggy code:
c_list = list(map(int, input().split()))
c_list.sort()
if sort[0] + sort[1] == sort[2]:
  print('Yes')
else:
  print('No')

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

if c_list[0] + c_list[1] == c_list[2]:
  print('Yes')
else:
  print('No')
Buggy code:
a,b,c = map(int,input().split(' '))
if a + b == c or a + c == b or b + c == a:
  print('Yes')
else:
  print('NO')

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

if a+b==c or b+c==a or a+c==b:
    print('Yes')
else:
    print('No')
Buggy code:
a,b,c = map(int, input().split())
tmp = a + b + c

if (tmp - a == tmp/2 or tmp - b == tmp/2 or tmp - c == tmp/2):
    print('Yes')
else:
    print('NO')

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

if (tmp - a == tmp/2 or tmp - b == tmp/2 or tmp - c == tmp/2):
    print('Yes')
else:
    print('No')
Buggy code:
a,b,c=map(int,input().split())
print("Yes" if a+b+c=2*max(a,b,c) else "No")

Fixed code:
a,b,c=map(int,input().split())
print("Yes" if a+b+c==2*max(a,b,c) else "No")
Buggy code:
a, b, c = map(int, input().split(" "))

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

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

if a+b == c or b+c == a or c+a == b:
    print("Yes")
else:
    print("No")
Buggy code:
x = [int(i) for i input().split()]
x.sort()
print("Yes" if x[0]+x[1]==x[2] else "No")

Fixed code:
x = [int(i) for i in input().split()]
x.sort()
print("Yes" if x[0]+x[1]==x[2] else "No")
Buggy code:
na = lambda: list(map(int, input().split()))
a, b, c = na()
if a + b == c or b + c == a:
    print("Yes")
else:
    print("No")

Fixed code:
na = lambda: list(map(int, input().split()))
a, b, c = na()
if a + b == c or b + c == a or c + a == b:
    print("Yes")
else:
    print("No")
Buggy code:
a,b,c = [int(i) for i in input().split()]
if a == b or b == c or a == c:
    print("Yes")
elif a == b+c or b == a+c or c == a+b:
    print("Yes")
else:
    print("No")

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

Fixed code:
a,b,c = map(int, input().split())
if a+b == c or b+c == a or c+a == b:
    print('Yes')
else:
    print('No')
Buggy code:
# -*- coding: utf-8 -*-

abc = [int(s) for s in input().split()]

abc.sort()

if abc[0]+abc[1] == abc[2]:
    print('yYs')
else:
    print('No')


Fixed code:
# -*- coding: utf-8 -*-

abc = [int(s) for s in input().split()]

abc.sort()

if abc[0]+abc[1] == abc[2]:
    print('Yes')
else:
    print('No')
Buggy code:
l = list(map(int, input().split()))

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

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

if l[0] == l[1] + l[2] or l[1] == l[0] + l[2] or l[2] == l[0] + l[1]:
    print("Yes")
else:
    print("No")
Buggy code:
import math

a,b,c=map(int,input().split())
l=[a,b,c]
sorted(l)


print("Yes" if l[0]+l[1]==l[2] else "No")


Fixed code:
import math

a,b,c=map(int,input().split())
l=[a,b,c]
l.sort()


print("Yes" if l[0]+l[1]==l[2] else "No")
Buggy code:
a, b, c = map(int,input().split())
ans = False
if a == b + c or b = a + c or c = a + b:
    ans = True
if ans:
    print("Yes")
else:
    print("No")

Fixed code:
a, b, c = map(int,input().split())
ans = False
if a == b + c or b == a + c or c == a + b:
    ans = True
if ans:
    print("Yes")
else:
    print("No")
Buggy code:
abc = sorted(map(int, input().split()))
print(`Yes` if abc[0]+abc[1] == abc[2] else `No`)


Fixed code:
abc = sorted(map(int, input().split()))
print ('Yes' if abc[0]+abc[1] == abc[2] else 'No')
Buggy code:
c = map(int, input().split())
print('Yes' if max(c)*2 == sum(c) else 'No')

Fixed code:
c = list(map(int, input().split()))
print('Yes' if max(c)*2 == sum(c) else 'No')
Buggy code:
a, b, c = map( int, input().split())

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

Fixed code:
a,b,c = map(int,input().split())
if a+b == c:
  print('Yes')
elif b+c == a:
  print('Yes')
elif a+c == b:
  print('Yes')
else:
  print('No')
Buggy code:
a, b, c = map(int, input().split())
print("Yes" if ((a+b+c)%3==0 and (a+b+c)//3 in [a,b,c]) else "No")

Fixed code:
a, b, c = map(int, input().split())
print("Yes" if ((a+b+c)%2==0 and (a+b+c)//2 in [a,b,c]) else "No")
Buggy code:
a, b, c = map( int, input().split())

if a == b+c or a + b == c or a + c == b:
  print('Yes')

Fixed code:
a, b, c = map(int, input() .split())
if a + b == c or a + c ==b or c +b ==a:
    print("Yes")
else:
    print("No")
Buggy code:
A=list(map(int,input().split()))
if( sum(A) == 2*max(A) ) print("Yes")
else print( "No" )

Fixed code:
A=list(map(int,input().split()))
if( sum(A) == 2*max(A) ):
  print("Yes")
else:
  print( "No" )
Buggy code:
a,b,c=[int(x) for x in input().split()]

if(a+b==c or a+c==c or b+c==a):
  print("yes")
else:
  print("No")

Fixed code:
a,b,c=[int(x) for x in input().split()]

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

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

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


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

if a == (b+c) or (a+b) == c or (a+c) == b:
    print('Yes')
else:
    print('No')
Buggy code:
A=list(map(int,input().split()))
A.sort()
print(["Yes","No"][A[0]+A[1]==A[2]])

Fixed code:
A=list(map(int,input().split()))
A.sort()
print(["Yes","No"][A[0]+A[1]!=A[2]])
Buggy code:
a=input().split(" ")
sum1=a[0]+a[1]
sum2=a[0]+a[2]
sum3=a[1]+a[2]

if sum1+sum2==sum3 or sum1+sum3==sum2 or sum2+sum3==sum1
	print("Yes")
else:
	print("No")


Fixed code:
a=input().split(" ")
sum1=int(a[0])+int(a[1])
sum2=int(a[0])+int(a[2])
sum3=int(a[1])+int(a[2])

if sum1==int(a[2]) or sum2==int(a[1]) or sum3==int(a[0]):
	print("Yes")
else:
	print("No")
Buggy code:
a,b,c=map(int,input().split())
d=max(a,max(b,c))
if 2*d=(a+b+c):
  print("Yes")
else:
  print("No")

Fixed code:
a,b,c=map(int, input().split())
if max(a,b,c)*2==a+b+c:
    print("Yes")
else:
    print("No")
Buggy code:

a, b, c = sorted(map(int, input().split()))
list = sorted(abc)

print("Yes" if a+b==c else "No")


Fixed code:

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

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

if a=b+c or b=c+a or c= a+b:
  print('Yes')
else:
  prine('No')

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

if a==b+c or b==c+a or c==a+b:
  print('Yes')
else:
  print('No')
Buggy code:
x = list(map(int,input().split()))
y = sorted(x)
if y[0]+y[1]=y[2]:
  print("Yes")
else:
  print("No")

Fixed code:
x = list(map(int,input().split()))
y = sorted(x)
if y[0]+y[1]==y[2]:
  print("Yes")
else:
  print("No")
Buggy code:
candy = sorted(list(map(int,input().split(' '))))
if candy[2]==(candy[0]+candy[1]):
    print('Yes')
else:
    print(No'')

Fixed code:
candy = sorted(list(map(int,input().split(' '))))
if candy[2]==(candy[0]+candy[1]):
    print('Yes')
else:
    print('No')
Buggy code:
A = list(map(int, input().split()))
A.sort()
if A[2] = A[1] + A[0]:
  print('Yes')
else:
  print('No')


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

a.sort()

if a[0] + a[1] == a[2]:
    print('Yes')
else:
    print('No')
Buggy code:
a,b,c = map(int, input().split())
if a=b+c or b=a+c or c=a+b:
    print("Yes")
else:
    print("No")


Fixed code:
a,b,c=map(int, input().split())
if a+b==c or a+c==b or b+c==a:
 print('Yes')
else:
 print('No')
Buggy code:
a,b,c=map(int,input().split())
s=a+b+c
if s%2==1:
  print("No")
  exit()
n=s%2
if s in [a,b,c]:
  print("Yes")
else:
  print("No")

Fixed code:
a,b,c=map(int,input().split())
s=a+b+c
if s%2==1:
  print("No")
  exit()
n=s//2
if n in [a,b,c]:
  print("Yes")
else:
  print("No")
Buggy code:
a,b,c=map(int, input().split())
d=[a,b,c]
if sum(d)//2 in d: print('Yes')
else: 'No'

Fixed code:
a,b,c=map(int, input().split())
d=[a,b,c]
if sum(d)/2 in d: print('Yes')
else: print('No')
Buggy code:
a,b,c=map(int,input().split())
s=a+b+c
if s%2==0:
    print("Yes")
else:
    print("No")

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

if s%2==0:
    if a+b==c:
        print("Yes")
    elif a+c==b:
        print("Yes")
    elif c+b==a:
        print("Yes")
    else:
        print("No")
else:
    print("No")
Buggy code:
a, b, c = input().split()

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

Fixed code:
a,b,c = input().split()
a = int(a)
b = int(b)
c = int(c)
if a+b==c or a+c==b or c+b==a:
    print('Yes')
else:
    print('No')
Buggy code:
a = list(map(int,input().split()))
b = sorted(a)

if b[1]+b[2]==b[0]:
  print("Yes")
else:
  print("No")

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

if b[0]+b[1]==b[2]:
  print("Yes")
else:
  print("No")
Buggy code:
a, b, c = map(int, input().split())

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

Fixed code:
a, b, c = map(int, input().split())
if a + b == c or b + c == a or a + c == b:
    print('Yes')
else:
    print('No')
Buggy code:
li = [int(x) for x in input().split()]
li.sort()
li.reversed()
if(li[0]==li[1]+li[2]):
  print('Yes')
else:
  print('No')

Fixed code:
li = [int(x) for x in input().split()]
li.sort()
li.reverse()
if(li[0]==li[1]+li[2]):
  print('Yes')
else:
  print('No')
Buggy code:
a,b,c=sorted(map(int,input().split()));print("YNEOS"[a+b!=c::2])

Fixed code:
a,b,c=sorted(map(int,input().split()));print("YNeos"[a+b!=c::2])
Buggy code:
L = sorted(list(map(int, input().split())))
print('Yes' if sum(L[:2] == L[2]) else 'No')

Fixed code:
L = sorted(list(map(int, input().split())))
print('Yes' if sum(L[:2]) == L[2] else 'No')
Buggy code:
if __name__ == '__main__':
    K = list(map(int, input().split(' ')))
    if K[0] + K[1] == K[2]:
        print('No')
    else:
        print('Yes')

Fixed code:
if __name__ == '__main__':
    K = list(map(int, input().split(' ')))
    K.sort()
    if K[0] + K[1] == K[2]:
        print('Yes')
    else:
        print('No')
Buggy code:
a, b, c = map(int, input().split())

if (a + b == c) or (a + c == b) or (b + c ==a):
  print(Yes)
else:
  print(No)

Fixed code:
a, b, c = map(int, input().split())
if c == a + b or b == c + a or a == b + c:
    print("Yes")
else:
    print("No")
Buggy code:
abc=map(int,input().split())
abc.sort()
if abc[0]+abc[1]==abc[2]:
    print("Yes")
    exit()
print("No")

Fixed code:
abc=list(map(int,input().split()))
abc.sort()
if abc[0]+abc[1]==abc[2]:
    print("Yes")
    exit()
print("No")
Buggy code:
a,b,c = map(int,input().split())

big = max(a,b,c)
total = a + b + c
if total = big*2:
    print("Yes")
else:
    print("No")


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

big = max(a,b,c)
total = a + b + c
if total == big*2:
    print("Yes")
else:
    print("No")
Buggy code:
ist=list(map(int, input().split()))
list.sort()
if list[0]+list[1] == list[2]:
    print("Yes")
else:
    print("No")

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

if listC[0]+ listC[1] == listC[2]:
    print("Yes")
else:
    print("No")
Buggy code:
a,b,c=map(int,input().split());print("YNeos"[a+b-c and a+c-b and b+c-a::2])

Fixed code:
a,b,c=map(int,input().split());print("YNeos"[a+b!=c and a+c!=b and b+c!=a::2])
Buggy code:
i = sorted(list(map(lambda x:int(x),list(input().split(' ')))))
if i[0] is i[1]+i[2]:
  print('Yes')
else:
  print('No')

Fixed code:
i = sorted(list(map(lambda x:int(x),list(input().split(' ')))))
if i[2] == i[1]+i[0]:
  print('Yes')
else:
  print('No')
Buggy code:
pack = list(map(int,input().split())).sort()
if pack[0] + pack[1] == pack[2]:
    print('Yes')
else:
    print('No')

Fixed code:
pack = sorted(list(map(int,input().split())))
if pack[0] + pack[1] == pack[2]:
    print('Yes')
else:
    print('No')
Buggy code:
line=input()
line.split(" ")

a=line[0]
b=line[1]
c=line[2]

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

Fixed code:
line=input()
line=line.split(" ")
 
a=int(line[0])
b=int(line[1])
c=int(line[2])
 
if a+b==c:
 print("Yes")
elif b+c==a:
 print("Yes")
elif c+a==b:
 print("Yes")
else:
 print("No")
Buggy code:
a=list(map(int,input().split()))
b=(a[0]+a[1]+a[2])%3
if b==0:
  print("Yes")
else:
  print("No")

Fixed code:
a=list(map(int,input().split()))
b=(a[0]+a[1]+a[2])%3
if a[0]+a[1]==a[2]:
  print("Yes")
elif a[1]+a[2]==a[0]:
  print("Yes")
elif a[0]+a[2]==a[1]:
  print("Yes")
else:
  print("No")
Buggy code:
l = list(map(int, input().split()))

print(l)
if l[0] == l[1] + l[2] or l[1] == l[0] + l[2] or l[2] == l[0] + l[1]:
    print('Yes')
else:
    print('No') 

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

if l[0] == l[1] + l[2] or l[1] == l[0] + l[2] or l[2] == l[0] + l[1]:
    print('Yes')
else:
    print('No')
Buggy code:
nums = map( int, input().split() )
nums.sort()

if num[0]+num[1]==num[2]:
  print("Yes")
else :
  print("No")
  

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

if nums[0]+nums[1]==nums[2]:
  print("Yes")
else :
  print("No")
Buggy code:
data = list(map(lambda x:int(x),input().split()))
data.sort()
data.reverse()

print(data)
if data[0] == data[1] + data[2]:
        print('Yes')
else :
        print('No')

Fixed code:
data = list(map(lambda x:int(x),input().split()))
data.sort()
data.reverse()

if data[0] == data[1] + data[2]:
        print('Yes')
else :
        print('No')
Buggy code:
# coding: UTF8

#input = "10 49 30"
l = map(int, input().split())
# l = map(int, input.split())
l.sort()
a = l[0]
b = l[1]
c = l[2]

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

Fixed code:
# coding: UTF8

#input = "10 40 30"
#l = map(int, input.split())
l = list(map(int, input().split()))
l.sort()
a = l[0]
b = l[1]
c = l[2]

if a + b == c:
	print("Yes")
else:
	print("No")
Buggy code:
a = list(map(int, input().split()))
a.sort()

if a[0]+a[1] == a[2] or a[0]==a[1] or a[1]==a[2]:
    print('Yes')
else:
    print('No')


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

if a[0]+a[1] == a[2]:
    print('Yes')
else:
    print('No')
Buggy code:
a,b,c = int(input.split())
if a + b == c:
  print("Yes")
elif a + c == b:
  print("Yes")
elif b + c ==a:
  print("Yes")
else:
  print("No")
  

Fixed code:
a,b,c = list(map(int,input().split()))
if a + b == c:
  print("Yes")
elif a + c == b:
  print("Yes")
elif b + c ==a:
  print("Yes")
else:
  print("No")
Buggy code:
A=[int(i) for i in input().split]
sort_list=sorted(A)
if sort_list[0]+sort_list[1]==sort_list[2]:
    print("Yes")
else:
    print("No")

Fixed code:
A=[int(i) for i in input().split()]
sort_list=sorted(A)
if sort_list[0]+sort_list[1]==sort_list[2]:
    print("Yes")
else:
    print("No")
Buggy code:
li = map(int, input().split())
li.sort()
if li[0] + li[1] == li[2]:
	print('Yes')
else:
	print('No')

Fixed code:
li = list(map(int, input().split()))
li.sort()
if li[0] + li[1] == li[2]:
	print('Yes')
else:
	print('No')
Buggy code:
andy = list(map(int, input().split()))

S = sorted(candy, reverse = True)
if S[0] == S[1] + S[2]:
    print("Yes")
else:
    print("No")

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

S = sorted(candy, reverse = True)
if S[0] == S[1] + S[2]:
    print("Yes")
else:
    print("No")