qyliang/CodeNanoFix huggingface dataset:
Buggy code:
# -*- coding: utf-8 -*-
abc = list(map(int, input().split()))
print(abc)

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


Fixed code:
# -*- coding: utf-8 -*-
abc = list(map(int, input().split()))

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


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

Fixed code:
a,b,c=map(int,input().split())
print(["No","Yes"][a+b==c or a+c==b or b+c==a])
Buggy code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

a,b,c=MI()
if (a+b+c)%2==0:
    print("Yes")
else:
    print("No")

Fixed code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
inf = 10**17
mod = 10**9 + 7

a,b,c=MI()
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 (sum(a,b,c) == max(a,b,c) * 2) :
	print("Yes")
else :
	print("No")

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

if (sum([a,b,c]) == max(a,b,c) * 2) :
	print("Yes")
else :
	print("No")
Buggy code:
def read():
	return [int(i) for i in input().split(' ')]
L = read()
if(L[0] + L[1] == L[2] or L[0] + L[2] == L[1] or L[1] + L[2] == L[3]):
	print('Yes')
else:
	print('No')


Fixed code:
def read():
	return [int(i) for i in input().split(' ')]
L = read()
if(L[0] + L[1] == L[2] or L[0] + L[2] == L[1] or L[1] + L[2] == L[0]):
	print('Yes')
else:
	print('No')
Buggy code:
packs = list(map(int, input().split()).sort()
if packs[2] - packs[1] == packs[0]:
    print("Yes")
else:
    print("No")

Fixed code:
packs = sorted(list(map(int, input().split())))
if packs[2] - packs[1] == packs[0]:
    print("Yes")
else:
    print("No")
Buggy code:
l = list(map(int,input().split()))
if l % 2 == 1:
  print('No')
else:
  if l//2 in l:
    print('Yes')
  else:
    print('No')

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

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


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

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

Fixed code:
A=sorted(list(map(int,input().split())))
print("Yes" if sum(A[:2])==A[2] else "No")
Buggy code:
a = list(map(int,input().split()))
a.sort(reverse=True)
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=list(map(int,input())).sort()
print("Yes") if max(a[2]==a[1]+a[0]) else print("No")

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

if sum(total_list[:1]) == total_list[2]:
    print('Yes')
else:
    print('No')

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

if sum(total_list[:2]) == total_list[2]:
    print('Yes')
else:
    print('No')
Buggy code:
# python3 (3.4.3)
import sys
input = sys.stdin.readline

# main
ABC = list(map(int,input().split()))

ABC.sort()

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

Fixed code:
# python3 (3.4.3)
import sys
input = sys.stdin.readline

# main
ABC = list(map(int,input().split()))

ABC.sort()

print("Yes" if ABC[0]+ABC[1]==ABC[2] else "No")
Buggy code:
A=map(int,input().split())
print('Yes' if 2*max(A)==sum(A) else 'No')


Fixed code:
A=list(map(int,input().split()))
print('Yes' if 2*max(A)==sum(A) else 'No')
Buggy code:
a= sorted(list(map(int, input().split())))
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:
n = list(int(i) in input().split())
n.sort()
if n[0]+n[1]==n[2]:
    print("Yes")
else:
    print("No")

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

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

Fixed code:
a = sorted(list(map(int, input().split())))
if a[0] + a[1] == a[2]:
    print("Yes")
else:
    print("No")
Buggy code:
a,b,c=sorted(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 c+a == b:
	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 b+c==a:
    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 = sorted(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 c==a+b:
    print('Yes')
else:
    print('No')
Buggy code:
a, b, c = map(int, input().split())

if sum(a, b, c) == max(a, b, c) * 2:
    print('Yes')
else:
    print('No')


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

if a + b + c == max(a, b, c) * 2:
    print('Yes')
else:
    print('No')
Buggy code:
a, b, c = map(int, input().split())
 
if a == b + c:
  print("Yes")
elif b == a + c:
  print("Yes")
elif 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 a+c == b:
    print("Yes")
else:
    print("No")
Buggy code:
l = sorted(list(map, input().split()))
print("Yes" if l[0] + l[1] == l[2] else "No")

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

import numpy as np
maxi = np.argmax(L)
maxv = L.pop(maxi)

if maxv == sum(L):
    print('Yes')

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

import numpy as np
maxi = np.argmax(L)
maxv = L.pop(maxi)

if maxv == sum(L):
    print('Yes')
else:
    print('No')
Buggy code:
a,b,c = map(int, input().split())

A_B = (a+b)
A_C = (a+c)
B_C = (b+c)

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())

A_B = (a+b)
A_C = (a+c)
B_C = (b+c)

if (A_B == c):
    print("Yes")
elif (A_C == b):
    print("Yes")
elif (B_C == a ):
    print("Yes")
else:
    print("No")
Buggy code:
a, b, c = sorted(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 c + a == b:
    print('Yes')
else:
    print('No')
Buggy code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7

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

Fixed code:
import sys
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections
MOD = 10**9+7

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

Fixed code:
l= list(map(int, input().split()))
l.sort()
if l[2] == l[1] + l[0]:
    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 = list(map(int, input().split()))

if a + b == c or a == b + c or a + c == b:
    print('Yes')
else:
    print('No')
Buggy code:
a,b,c=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 a+c == b or b+c == a:
  print("Yes")
else:
  print("No")
Buggy code:
a,b,c = map(int, input().split())
if c < a:
    a, c = c, a
    if c < b:
        b, c = c, b
elif c > b:
    b, c = c, b
    
if a + b == c:
    print("Yes")
else:
    print("No")


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

if a == b+c:
    print('Yes')
elif b == a+c:
    print('Yes')
elif c == a+b:
    print('Yes')
else:
    print('No')
Buggy code:
a,b,c=map(int,input().split())
sum=a+b+c
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 a+c==b or b+c==a  :
    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])

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:
a,b,c=map(int,input().split())
x=sorted[a,b,c]
if x[0]+x[1]=x[2]:
    print("Yes")
else:
    print("No")


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

Fixed code:
*a,=map(int,input().split());print('YNeos'[sum(a)/2!=max(a)::2])
Buggy code:
a=map(int,input().split())
print('NYoe s'[sum(a)/2 in a::2])

Fixed code:
a=list(map(int,input().split()))
print('NYoe s'[sum(a)/2 in a::2])
Buggy code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

# a,b,c=map(int,input().split())
# for i in itertools.permutations([a,b,c],3):
#     if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
#         print("Yes")
#         exit()

# print("No")

Fixed code:
#!/usr/bin/env python3
import sys, math, itertools, heapq, collections, bisect, fractions
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
sys.setrecursionlimit(10**8)
inf = float('inf')
ans = count = 0

a,b,c=map(int,input().split())
for i in itertools.permutations([a,b,c],3):
    if i[0]==sum(i[1:]) or sum(i[:2])==i[2]:
        print("Yes")
        exit()

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


Fixed code:
a = list(map(int, input().split()))
b = max(a)
a.remove(b)
if sum(a) == b:
  print("Yes")
else:
  print("No")
Buggy code:
import sys

def solve():
    input = sys.stdin.readline
    C = [int(i) for i in input().spit()]
    C.sort()
    if C[0] + C[1] == C[2]: print("Yes")
    else: print("No")

    return 0

if __name__ == "__main__":
    solve()

Fixed code:
import sys

def solve():
    input = sys.stdin.readline
    C = [int(i) for i in input().split()]
    C.sort()
    if C[0] + C[1] == C[2]: print("Yes")
    else: print("No")

    return 0

if __name__ == "__main__":
    solve()
Buggy code:
List = list(map(int,input().split()))
List2 = sorted(List)
print('Yes' if List2[0] + List2[1] == List2[2] else 'No') ) 


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

Fixed code:
A = list(map(int, input().split()))
a=A[0]
b=A[1]
c=A[2]
if (a==b+c)or(b==a+c)or(c==b+a):
  print('Yes')
else:
  print('No')
Buggy code:
a,b,c = (int(x) for x in input().split())
candy = [a, b, c]
#print(candy)
candy.sort()
print(candy)
max_candy = candy[2]
middle_candy = candy[1]
min_candy = candy[0]

if max_candy == middle_candy + min_candy:
    print('Yes')
else:
    print('No')

Fixed code:
a,b,c = (int(x) for x in input().split())
candy = [a, b, c]
#print(candy)
candy.sort()
#print(candy)
max_candy = candy[2]
middle_candy = candy[1]
min_candy = candy[0]

if max_candy == middle_candy + min_candy:
    print('Yes')
else:
    print('No')
Buggy code:
a,b,c = map(int, input().split())
if max(a,b,c)+2==a+b+c:
    print("Yes")
else:
    print("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 = 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:
a = list(map(int, input().split())).sorted()
print('Yes' if a[0] + a[1] == a[2] else 'No')

Fixed code:
x_sorted = sorted(list(map(int,input().split())))
print("Yes" if x_sorted[0]+x_sorted[1]==x_sorted[2] else "No")
Buggy code:
a = list(map(int, input().split()))
a.sorted()
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=[int(i) for i in input().split()]

a.sort()

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

Fixed code:
a = [int(x) for x in input().split()]
a.sort()
if a[0] + a[1] == a[2]:
  print("Yes")
else:
  print("No")
Buggy code:
a,b,c = 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 c+a == b:
    print("Yes")
else:
    print("No")
Buggy code:
a=map(int,input().split())
print("Yes") if sum(a)//2 in a else print("No")

Fixed code:
a=list(map(int,input().split()))
print("Yes") if sum(a)/2 in list(a) else print("No")
Buggy code:
A, B, C = map(int, input().split())

AB = A+B
BC = B+C
CA = C+A

if AB==BC or BC==CA or CA==AB:
    print("Yes")
else:
    print("No")

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

AB = A+B
BC = B+C
CA = C+A

if AB==C or BC==A or CA==B:
    print("Yes")
else:
    print("No")
Buggy code:
#n = int(input())
a = list(map(int,input().split()))

a.sort()

if a[0]+a[1]==a[2]:
    print("Yes")
elif:
    print("No")

Fixed code:
#n = int(input())
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 b+c==a or a+c==b:
  print('Yes')
else:
  print('No')
Buggy code:
x,y,z=map(int,input().split())
if x+y==z or y+z==z or y+z==x:
    print("Yes")
else:
    print("No")    


Fixed code:
x,y,z=map(int,input().split())
if x+y==z or y+z==x or z+x==y:
    print("Yes")
else:
    print("No")
Buggy code:
a,b,c = map(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 b == a+c or c == a+b :
  print("Yes")
else:
  print("No")
Buggy code:
a,b,c=map(int,input().split())
if max(a,b,c) == a+b+c-max(a,bc):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=map(int,input().split())
a.sort()
if a[0]+a[1]==a[2]:
  print("Yes")
else:
  print("No")

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

Fixed code:
a, b, c = [int(i) for i in input().split()]
if(max([a,b,c])*2 == sum([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]:
  print('No')
else:
  print('Yes')


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(' '))
print('YES' if a == b + c or b == c + a or c == b + a else 'No')

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

S = [int(i) for i in input().split()]
T = sum(T)/2

for i in range(3):
  if S[i] == T:
    print("Yes")
    sys.exit()
    
print("No")

Fixed code:
import sys

S = [int(i) for i in input().split()]
T = sum(S)/2

for i in range(3):
  if S[i] == T:
    print("Yes")
    sys.exit()
    
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 b==c+a or c==a+b:
  print('Yes')
else:
  print('No')
Buggy code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return list(map(int, input().split()))
def II(): return int(input())
def S(): return input()


def main():
    a = LI()
    if sum(a)  == max(a)*2:
        return 'YES'
    return 'NO'


print(main())


Fixed code:
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

def LI(): return list(map(int, input().split()))
def II(): return int(input())
def S(): return input()


def main():
    a = LI()
    if sum(a)  == max(a)*2:
        return 'Yes'
    return 'No'


print(main())
Buggy code:
a,b,c = map(int, raw_input().split())
if a>b:
	temp = a
	a = b
	b = temp

if b>c:
	temp = b
	b = c
	c = temp

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

Fixed code:
a,b,c = map(int,input().split())
 
if a>b:
    temp = a
    a = b
    b = temp
if b>c:
    temp = b
    b = c
    c = temp
if (a+b)==c:
    print("Yes")

else:
    print("No")
Buggy code:
# import time

# starttime=time.clock()

A,B,C =input().split()
a=int(A)
b=int(B)
c=int(C)
print(a+c)
 
if a>b:
    temp = a
    a = b
    b = temp
if b>c:
    temp = b
    b = c
    c = temp
if (a+b)==c:
    print("Yes")
#     endtime = time.clock()
#     print(endtime-starttime)
else:
    print("No")
#     endtime = time.clock()
#     print(endtime-starttime)
#      


Fixed code:
# import time

# starttime=time.clock()

A,B,C =input().split()
a=int(A)
b=int(B)
c=int(C)
# print(a+c)
 
if a>b:
    temp = a
    a = b
    b = temp
if b>c:
    temp = b
    b = c
    c = temp
if (a+b)==c:
    print("Yes")
#     endtime = time.clock()
#     print(endtime-starttime)
else:
    print("No")
#     endtime = time.clock()
#     print(endtime-starttime)
#
Buggy code:
a,b,c = (int(T) for T in input().split())
print(['No','Yes'][(a+ab)==c or (b+c)==a or (c+a)==b])

Fixed code:
a,b,c = (int(T) for T in input().split())
print(['No','Yes'][(a+b)==c or (b+c)==a or (c+a)==b])
Buggy code:
ary = list(map(lambda n: int(n), input().split(" ")))
ary.sort

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

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

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

Fixed code:
s = list(map(int,input().split()))
s.sort()
print("Yes" if s[0]+s[1]==s[2] else "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 a+c==b or b+c==a:
    print('Yes')
else:
    print('No')
Buggy code:
a, b, c = input().split()        
a, b, c = int(a), int(b), int(c) 
fl = False                       
ab = a+b                         
ac = a+c                         
bc = b+c                         
while(1):                        
    if ab == c:                  
        fl = True                
        break                    
    if bc == a:                  
        fl = True                
        break                    
    if ac == b:                  
        fl = True                
        break                    
if fl:                           
    print('Yes')                 
else:                            
    print('No')                  
                                 


Fixed code:
a, b, c = input().split()        
a, b, c = int(a), int(b), int(c) 
fl = False                       
ab = a+b                         
ac = a+c                         
bc = b+c                         
while(1):                        
    if ab == c:                  
        fl = True                
        break                    
    if bc == a:                  
        fl = True                
        break                    
    if ac == b:                  
        fl = True                
        break                    
    break                        
if fl:                           
    print('Yes')                 
else:                            
    print('No')
Buggy code:
# -*- coding:utf-8 -*-

def solve():
    a, b, c = list(map(int, input.split()))

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

if __name__ == "__main__":
    solve()


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

def solve():
    a, b, c = list(map(int, input().split()))

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

if __name__ == "__main__":
    solve()
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 = list(map(int, input().split()))
x = sorted(A)
if x[0] + x[1] == x[2]:
  print('Yes')
else:
  print('No'

Fixed code:
A = list(map(int, input().split()))
x = sorted(A)
if x[0] + x[1] == x[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:
    print
    ("No")

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