Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p03952 (python)

Fixed submission:
N,x=map(int,input().split())
if N==2:
    if x==2:
        print('Yes')
        for i in range(1,4):
            print(i)
    else:
        print('No')
else:
    if x==1 or x==2*N-1:
        print('No')
    elif x==2:
        print('Yes')
        S=[]
        T=[2*N-1,1,2,3,2*N-2]
        U=[]
        count=0
        for i in range(1,2*N):
            if (not i in T) and N-3>count:
                S.append(i)
                count+=1
                continue
            if (not i in T) and count>=N-3:
                U.append(i)
                continue
        ans=S+T+U
        for i in range(0,2*N-1):
            print(ans[i])
    elif x==2*N-2:
        print('Yes')
        S=[]
        T=[3,1,2*N-2,2*N-1,2]
        U=[]
        count=0
        for i in range(1,2*N):
            if (not i in T) and N-3>count:
                S.append(i)
                count+=1
                continue
            if (not i in T) and count>=N-3:
                U.append(i)
                continue
        ans=S+T+U
        for i in range(0,2*N-1):
            print(ans[i])
    else:
        print('Yes')
        S=[]
        T=[2*N-1,2,x,2*N-2,1]
        U=[]
        count=0
        for i in range(1,2*N):
            if (not i in T) and N-3>count:
                S.append(i)
                count+=1
                continue
            if (not i in T) and count>=N-3:
                U.append(i)
                continue
        ans=S+T+U
        for i in range(0,2*N-1):
            print(ans[i])

Buggy submission (verdict: Runtime Error):
N=int(input())
a=list(map(int,input().split()))
def cond(n):
    L=(0,-1)
    for i in range(1,N):
        if a[i]>=n and a[i-1]>=n:
            L=(i,1)
        elif a[i]<n and a[i-1]<n:
            L=(i,0)

    R=(2*N-1,-1)
    for i in range(2*N-3,N-2,-1):
        if a[i]>=n and a[i+1]>=n:
            R=(i,1)
        elif a[i]<n and a[i+1]<n:
            R=(i,0)

    if L[1]==-1 and R[1]==-1:
        return a[0]>=n
    elif L[1]==-1:
        return R[1]==1
    elif R[1]==-1:
        return L[1]==1
    elif L[1]==R[1]:
        return R[1]==1
    else:
        if L[1]==0:
            return N-1-L[0]>R[0]-(N-1)
        else:
            return N-1-L[0]<R[0]-(N-1)


start=1
end=2*N-1
while end-start>1:
    test=(end+start)//2
    if cond(test):
        start=test
    else:
        end=test
if cond(end):
    print(end)
else:
    print(start)
Problem p02640 (python)

Fixed submission:
X, Y = map(int, input().split())

if Y%2 == 1:
    print('No')
    exit()
else:
    if 2*X <= Y <= 4*X:
        print('Yes')
    else:
        print('No')

Buggy submission (verdict: Runtime Error):
X, Y = map(int, input().split())

if Y%2 == 1:
    print('No')
    exit()
else:
    if 2X <= Y <= 4*X:
        print('Yes')
    else:
        print('No')
Problem p02641 (python)

Fixed submission:
X, N = map(int,input().split(' '))
if N == 0:
    print(X)
    exit()

p = input().split(' ')
p =[int(i) for i in p]
if X not in p:
    print(X)
    exit()

num_list = [int(i) for i in range(102)]
[num_list.remove(p[i]) for i in range(N)]
tmp = [0] * int(len(num_list))


for i in range(len(num_list)):
    tmp[i] = abs(num_list[i] - X)

ans = tmp.index(min(tmp))

print(num_list[ans])

Buggy submission (verdict: Runtime Error):
X, N = map(int,input().split(' '))
if N == 0:
    print(X)
    exit()

p = input().split(' ')
p =[int(i) for i in p]
if X not in p:
    print(X)
    exit()

num_list = [int(i) for i in range(102)]
[num_list.remove(p[i]) for i in range(N)]
tmp = [0] * int(len(num_list))


for i in range(len(num_list)):
    tmp[i] = abs(num_list[i] - X)

ans = tmp.index(min[tmp])

print(num_list[ans])

Buggy submission (verdict: Runtime Error):
X, N = map(int,input().split(' '))
if N == 0:
    print(X)
    exit()

p = input().split(' ')
p =[int(i) for i in p]
if X not in p:
    print(X)
    exit()

num_list = [int(i-99) for i in range(200)]
[num_list.remove(p[i]) for i in range(N)]
tmp = [0] * int(len(num_list))


for i in range(len(num_list)):
    tmp[i] = max(num_list[i], X) - min(num_list[i], X)

ans = [i for i,x in enumerate(tmp) if x == min(tmp)]
# print(num_list)
# print(tmp)
# print(ans)
if len(ans) == 2:
    print(min(num_list[ans[0]],num_list[ans[1]]))
else:
    print(num_list[ans])

Buggy submission (verdict: Runtime Error):
X, N = map(int,input().split(' '))
if N == 0:
    print(X)
    exit()

p = input().split(' ')
p =[int(i) for i in p]
num_list = [int(i+1) for i in range(100)]
[num_list.remove(p[i]) for i in range(N)]
tmp = [0] * int(len(num_list))


for i in range(len(num_list)):
    tmp[i] = abs(num_list[i] - X)

ans = tmp.index(min(tmp))
# print(num_list)
# print(ans)
print(num_list[ans])

Buggy submission (verdict: Runtime Error):
X, N = map(int,input().split(' '))
if N == 0:
    print(X)
    exit()

p = input().split(' ')
p =[int(i) for i in p]
num_list = [int(i+1) for i in range(100)]
[num_list.remove(p[i]) for i in range(N)]
tmp = [0] * int(len(num_list))


for i in range(len(num_list)):
    tmp[i] = abs(num_list[i] - X)

print(num_list[tmp.index(min(tmp))])
Problem p02657 (python)

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

Buggy submission (verdict: Runtime Error):
import math,sys
N = int(input())
A = list(map(int, input().split()))
ans = 1

if 0 in A:
    print(0)
    sys.exit()

for i in range(N):
    ans = ans*A[i]
    # if ans > pow(10,18):#pythonはオーバーフローしないからこれでも行ける
    if A[i] > 10**18/ans:#普通だったらオーバーフローしないようにやる
        # ans *= A[i]#こう書け
        print(-1)
        sys.exit()

print(ans)
Problem p02696 (python)

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

num = math.floor(A*min(B-1,N)/B) - A*math.floor(min(B-1,N)/B)

print(num)

Buggy submission (verdict: Runtime Error):
import math
A, B, N = map(int, input().split())

for i in range(N+1):
    num = math.floor(A*i/B) - A*math.floor(i/B)
    if num > maxnum:
        maxnum = num
    print(str(i) + ':' + str(num) + ' max is ' + str(maxnum))
print(maxnum)
Problem p03160 (python)

Fixed submission:
n = int(input())
arr = list(map(int, input().split()))
  
cost = [0]*n
cost[0] = 0
for i in range(1, n):
  if i > 1:
    cost[i] = min(abs(arr[i]-arr[i-2])+cost[i-2], abs(arr[i]-arr[i-1])+cost[i-1])
  elif i == 1:
    cost[i] = abs(arr[i]-arr[i-1])

print(cost[-1])

Buggy submission (verdict: Runtime Error):
n = int(input())
arr = list(map(int, input().split()))
  
cost = [0]*n
cost[0] = 0
for i in range(1, n):
  if i > 1:
    cost[i] = min(abs(arr[i]-arr[i-2])+cost[i-2], abs(arr[i]-arr[i-1])+cost[i-1])
  elif i == 1:
    cost[i] = minabs(arr[i]-arr[i-1])

print(cost[-1])
Problem p03633 (python)

Fixed submission:

n = int(input())
t = [ int(input()) for i in range(n)]
def gcd(a,b):
    if a<b:a,b = b,a 
    if b==0:return a
    else : return gcd(b,a%b)    

def lc(a,b):
    return a //gcd(a,b) * b

def lcm(b):
    ans = b[0]
    for i in b:
        ans = lc(ans,i)
    return ans
print(lcm(t))

Buggy submission (verdict: Runtime Error):
import math 

n = int(input())
t = [ int(input()) for i in range(n)]
def lc(a,b):
    return a // math.gcd(a,b) * b

def lcm(b):
    ans = b[0]
    for i in b:
        ans = lc(ans,i)
    return ans
print(lcm(t))
Problem p02802 (python)

Fixed submission:
N, M = [int(i) for i in input().split()]
pS = {}

for _ in range(M):
    a, s = [i for i in input().split()]
    if a not in pS:
        pS[a] = {}
        if s == 'AC':
            pS[a]['AC'] = True
        else:
            pS[a]['count'] = 1
    else:
        if s == 'AC':
            pS[a]['AC'] = True
        elif 'AC' not in pS[a]:
            pS[a]['count'] += 1

s = 0
a = 0
for v in pS.values():
    if 'AC' in v and 'count' in v:
        s += v['count']
    if 'AC' in v:
        a += 1
    
print(a, s)

Buggy submission (verdict: Runtime Error):
N, M = [int(i) for i in input().split()]
pS = {}

for _ in range(M):
    a, s = [i for i in input().split()]
    if a not in pS:
        pS[a] = {}
        if s == 'AC':
            pS[a]['AC'] = True
        else:
            pS[a]['count'] = 1
    else:
        if s == 'AC':
            pS[a]['AC'] = True
        elif 'AC' not in pS[a]:
            pS[a]['count'] += 1

s = 0
a = 0
for v in pS.values():
    s += v['count']
    if 'AC' in v:
        a += 1
    
print(a, s)
Problem p02922 (python)

Fixed submission:
A, B = [int(i) for i in input().split()]

i = 1

while True:
    if i == 1:
        s = A*i
    else:
        s = A*i - (i - 1)
    
    if s >= B:
        break
    i += 1

if B == 1:
    print(0)
else:
    print(i)

Buggy submission (verdict: Runtime Error):
A, B = [int(i) for i in input().split()]

i = 1

while True:
    if i == 1:
        s = A*i
    else:
        s = A*i - (i - 1)
    
    if s >= B:
        break
    i += 1

if B == 1:
    print(0)
else
    print(i)
Problem p02947 (python)

Fixed submission:
import itertools
from math import factorial
from scipy.misc import comb

N = int(input())
s = {}
for _ in range(N):
    b = list(input())
    b.sort()
    c = ''.join(b)
    if not c in s:
        s[c] = 1
    else:
        s[c] += 1

a = [comb(v, 2, exact=True) for v in s.values()]
print(sum(a))

Buggy submission (verdict: Runtime Error):
from scipy.misc import comb
 
N = int(input())
s = {}
for _ in range(N):
    b = list(input())
    b.sort()
    c = ''.join(b)
    if not b in s:
        s[b] = 1
    else:
        s[b] += 1
 
a = [comb(v, 2, exact=True) for v in s.values()]
print(sum(a))

Buggy submission (verdict: Runtime Error):
from scipy.misc import comb
 
N = int(input())
s = {}
for _ in range(N):
    b = sorted(input())
    #b.sort()
    #c = ''.join(b)
    if not b in s:
        s[b] = 1
    else:
        s[b] += 1
 
a = [comb(v, 2, exact=True) for v in s.values()]
print(sum(a))

Buggy submission (verdict: Runtime Error):
import itertools
from math import factorial
from scipy.special import comb

N = int(input())
s = {}
for _ in range(N):
    b = list(input())
    b.sort()
    c = ''.join(b)
    if not c in s:
        s[c] = 1
    else:
        s[c] += 1

a = [comb(v, 2, exact=True) for v in s.values()]
print(sum(a))

Buggy submission (verdict: Runtime Error):
import itertools
from math import factorial

N = int(input())
s = {}
for _ in range(N):
    b = list(input())
    b.sort()
    c = ''.join(b)
    if not c in s:
        s[c] = 1
    else:
        s[c] += 1

a = [factorial(v) / factorial(2) / factorial(v - 2) for v in s.values()]
print(sum(a))

Buggy submission (verdict: Runtime Error):
import itertools
from math import factorial

N = int(input())
s = {}
for _ in range(N):
    b = list(input())
    b.sort()
    c = ''.join(b)
    if not c in s:
        s[c] = 1
    else:
        s[c] += 1

a = [int(factorial(v) / factorial(2) / factorial(v - 2)) for v in s.values()]
print(sum(a))

Buggy submission (verdict: Runtime Error):
import itertools
from math import factorial

N = int(input())
s = {}
for _ in range(N):
    b = list(input())
    b.sort()
    c = ''.join(b)
    if not c in s:
        s[c] = 1
    else:
        s[c] += 1

a = [int(factorial(v) / factorial(2) / factorial(v - 2)) for v in s.values()]
sum(a)
Problem p03338 (python)

Fixed submission:
import collections

N = int(input())
S = input()

m = 0
index = 0
for i in range(N):
    a = set(S[:i])
    b = set(S[i:])
    d = 0
    for c in a:
        if c in b:
            d += 1
    if d > m:
        m = d
        index = i
print(m)

Buggy submission (verdict: Runtime Error):
import collections

N = int(input())
S = input()

m = 0
for i in range(N):
    m = max(set(S[:i]) & set(S[i:]), m)

print(m)
Problem p03633 (python)

Fixed submission:
import fractions

def a(A, B):
    C = fractions.gcd(A, B)
    return (A * B)//C

N = int(input())

T = []

for _ in range(N):
    T.append(int(input()))

T = sorted(T)
C = T[0]

if N > 1:
    for i in range(1, N):
        C = a(C, T[i])
print(C)

Buggy submission (verdict: Runtime Error):
import fractions

def a(A, B):
    C = fractions.gcd(A, B)
    return int((A * B)/C)

N = int(input())

T = []

for _ in range(N):
    T.append(int(input()))

T = sorted(T)
C = T[0]

if N > 1:
    for i in range(1, N):
        C = a(C, T[i])
print(C)

Buggy submission (verdict: Runtime Error):
import fractions

def a(A, B):
    C = fractions.gcd(A, B)
    return int((A * B)/C)

N = int(input())

T = []

for _ in range(N):
    T.append(int(input()))

T = sorted(T)
C = T[0]

for i in range(1, N):
    C = a(C, T[i])
print(C)
Problem p03659 (python)

Fixed submission:
N = int(input())
a = [int(i) for i in input().split()]


s = sum(a)
m = pow(10, 20)
b = 0
for i in range(N-1):
    b += a[i]
    c = s - b
    #print(b)
    #print(c)
    if m > (abs(b-c)):
        m = abs(b-c)
    #print(a[i])
print(m)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = [int(i) for i in input().split()]


s = sum(a)
m = s - a[:1]
#print(m)
for i in range(2, N):
    b = sum(a[:i])
    c = s - b
    #print(b)
    #print(c)
    if m > (abs(b-c)):
        m = abs(b-c)
    else:
        break
print(m)

Buggy submission (verdict: Runtime Error):
N = int(input())
a = [int(i) for i in input().split()]


s = sum(a)
m = s - a[:1]
print(m)
for i in range(2, N):
    b = sum(a[:i])
    c = s - b
    #print(b)
    #print(c)
    if m > (abs(b-c)):
        m = abs(b-c)
    else:
        break
print(m)
Problem p03699 (python)

Fixed submission:
def b(N, s):
    v = sum(s)
    for i in range(N, 0, -1):
        if v % 10 == 0:
            if s[i-1] % 10:
                v -= s[i-1]
            continue
        else:
            return v
    return 0
    
N = int(input())
s = []

for _ in range(N):
    s.append(int(input()))
    
s.sort(key=lambda x:-x)

print(b(N, s))

Buggy submission (verdict: Runtime Error):
def b(N, s):
    v = sum(s)
    for i in range(N, 0, -1):
        if v % 10 == 0:
            if s[i-1] % 10:
                v -= s[i-1]
            continue
        else:
            return a
    return 0
    
N = int(input())
s = []

for _ in range(N):
    s.append(int(input()))
    
s.sort(key=lambda x:-x)

print(b(N, s))

Buggy submission (verdict: Runtime Error):
def b(N, s):
    v = sum(s)
    for i in range(N, 0, -1):
        if v % 10 == 0:
            if s[i] % 10:
                v -= s[i]
            continue
        else:
            return a
    return 0
    
N = int(input())
s = []

for _ in range(N):
    s.append(int(input()))
    
s.sort(key=lambda x:-x)

print(b(N, s))
Problem p04031 (python)

Fixed submission:
import math

N = int(input())
a = [int(i) for i in input().split()]
b = round(sum(a)/N)

c = sum([(i - b)**2 for i in a])
print(c)

Buggy submission (verdict: Runtime Error):
import math

N = int(input())
a = [int(i) for i in input().split()]
b = math.round(sum(a)/N)

c = sum([(i - b)**2 for i in a])
print(c)
Problem p02657 (python)

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

Buggy submission (verdict: Runtime Error):
A = int(input())
B = int(input())
print(A*B)
Problem p02675 (python)

Fixed submission:
int = input()
if int[-1] == "3":
  	print("bon")
elif int[-1] == "0" or int[-1] == "1" or int[-1] == "6" or int[-1] == "8":
    print("pon")
else:
	print("hon")

Buggy submission (verdict: Runtime Error):
N = 0
for (N<1000 N++)
    if N == [2,4,5,7,9]
        print("h")
    elif N == [0,1,6,8]
        print("p")
    else N == [3]
        print("b")
print ("on")
Problem p02554 (python)

Fixed submission:
import sys
sys.setrecursionlimit(250000)

from scipy.special import comb
# a = comb(n, r)

def main():
    # a,b,c,d = map(int, input().split())
    n = int(input())

    sum = 10**n - 9**n*2 + 8**n
    # temp = (10 ** 9 + 7)
    # sum = 0
    # if n >= 2:
    #     for i in range(2, n+1):
    #         a = int(comb(i, 2)) * 2
    #         a = (a * 8**(i-2)) % temp
    #         sum = sum + a
    # else:
    #     print(0)

    print(sum % (10 ** 9 + 7))

main()

Buggy submission (verdict: Runtime Error):
import sys
sys.setrecursionlimit(250000)

from scipy.special import comb
# a = comb(n, r)

def main():
    # a,b,c,d = map(int, input().split())
    n = int(input())

    # temp = (10 ** 9 + 7)
    # sum = 0
    # if n >= 2:
    #     for i in range(2, n+1):
    #         a = int(comb(i, 2)) * 2
    #         a = (a * 8**(i-2)) % temp
    #         sum = sum + a
    # else:
    #     print(0)

    print(10**n - 9**n*2 + 8**n % (10 ** 9 + 7))

main()

Buggy submission (verdict: Runtime Error):
import sys
sys.setrecursionlimit(250000)

from scipy.special import comb
# a = comb(n, r)

def main():
    # a,b,c,d = map(int, input().split())
    n = int(input())

    sum = 10**n - 9**n*2 + 8**n
    # temp = (10 ** 9 + 7)
    # sum = 0
    # if n >= 2:
    #     for i in range(2, n+1):
    #         a = int(comb(i, 2)) * 2
    #         a = (a * 8**(i-2)) % temp
    #         sum = sum + a
    # else:
    #     print(0)

    print(sum % (10 ** 9 + 7))

main()

Buggy submission (verdict: Runtime Error):
import sys
sys.setrecursionlimit(250000)

from scipy.special import comb
# a = comb(n, r)

def main():
    # a,b,c,d = map(int, input().split())
    n = int(input())

    sum = 10**n - 9**n*2 + 8**n
    # temp = (10 ** 9 + 7)
    # sum = 0
    # if n >= 2:
    #     for i in range(2, n+1):
    #         a = int(comb(i, 2)) * 2
    #         a = (a * 8**(i-2)) % temp
    #         sum = sum + a
    # else:
    #     print(0)

    print(sum % (10 ** 9 + 7))

    # if a < 0  and b < 0 and c < 0 and d < 0 :
    #     print(a*c)
    # elif a < 0  from scipy.special import comb
    # # a = comb(n, r)
    # a = comb(n, r, exact=True)and b < 0 and c < 0 and d >= 0 :
    #     print(a * c)
    # elif a < 0  and b < 0 and c >= 0 and d > 0 :
    #     print(b*c)
    # elif a < 0  and b > 0 and c < 0 and d < 0 :
    #     print(a*c)
    # elif a < 0  and b >= 0 and c < 0 and d >= 0 :
    #     print(max(a*c, b*d))
    # elif a < 0 and b > 0 and c > 0 and d > 0:
    #     print(b*d)
    # elif a > 0  and b > 0 and c < 0 and d < 0 :
    #     print(a*d)
    # elif a > 0  and b > 0 and c < 0 and d > 0 :
    #     print(b*d)
    # elif  a > 0  and b >0 and c > 0 and d > 0 :
    #     print(b*d)

    #
    # pairs=[]
    # for i in range(n):
    #     pairs.append(list(map(int, input().split())))
    #
    # dp =  [[0] * 10001 for i in range(101)]
    # for j in range(0, 10001):
    #     for i in range(0,n):
    #         if j >= pairs[i][1]:
    #             dp[i+1][j] = max(dp[i][j-pairs[i][1]] + pairs[i][0], dp[i][j])
    #         else:
    #             dp[i+1][j] = dp[i][j]
    #
    # print(dp[n][w])
main()
Problem p02584 (python)

Fixed submission:
X, K, D = map(int, input().split())
current_position = X

times = abs(X) // D

if times < K:
    if times > 0 :
        if current_position >= 0:
            current_position = current_position - D*times
        elif current_position < 0:
            current_position = current_position + D*times
    K = K - times
    if K % 2 == 1:
        if current_position >= 0:
            current_position = current_position - D
        elif current_position < 0:
            current_position = current_position + D
else:
    if current_position >= 0:
        current_position = current_position - D * K
    elif current_position < 0:
        current_position = current_position + D * K
print(abs(current_position))

Buggy submission (verdict: Runtime Error):
X, K, D = map(int, input().split())
current_position = X

times = abs(X) // D

if times < K:
    if times > 0 :
        if current_position >= 0:
            current_position = current_position - D*times
        elif current_position < 0:
            current_position = current_position + D*times
    K = K - times
    if abs(current_position) <= D:
    if K % 2 == 1:
        if current_position >= 0:
            current_position = current_position - D
        elif current_position < 0:
            current_position = current_position + D
else:
    if times > 0 :
        if current_position >= 0:
            current_position = current_position - D*times
        elif current_position < 0:
            current_position = current_position + D*times
print(current_position)
Problem p03943 (python)

Fixed submission:
import sys
sys.setrecursionlimit(250000)

def main():
    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")
main()



#
# while True:
#     pair_str = input().split()
#     pair_int = [int(s) for s in pair_str]
#     if pair_int[0] == 0 and pair_int[1] == 0 :
#         break
#     else:
#         input_list.append(pair_int)


# if b > c * 2 :
    #     b_price = c
    #
    # input_array_list = []
    #
    # while True:
    #     input_array = input().split()
    #     if input_array[0] == "0" and input_array[1] == "0":
    #         break
    #     else:
    #         input_array_list.append(input_array)
    #
    # for item in input_array_list:
    #     n = int(item[0])
    #     k_sum = int(item[1])
    #
    #     count = 0
    #     for i in range(1,n + 1- 2):
    #         for j in range(i+1, n + 1 - 1):
    #             for k in range (j+1, n+ 1):
    #                 if i + j + k == k_sum :
    #                     count = count + 1
    #     print(count)

    #
    # for item in input_array_list:
    #     if item[1] == "+":
    #         print(str(int(item[0])+int(item[2])))
    #     elif item[1] =="-":
    #         print(str(int(item[0])-int(item[2])))
    #     elif item[1] == "/":
    #         print(str(int(item[0])//int(item[2])))
    #     elif item[1] == "*":
    #         print(str(int(item[0])*int(item[2])))
    #

# import sympy as sp

# input_list = []
# a,b,c = map(int, input().split())
# divisors = sp.divisors(c)
#
# count = 0
#
# for divisor in divisors:
#     if a <= divisor and divisor <= b:
#         count = count + 1
# print(count)
#
# while True:
#     pair_str = input().split()
#     pair_int = [int(s) for s in pair_str]
#     if pair_int[0] == 0 and pair_int[1] == 0 :
#         break
#     else:
#         input_list.append(pair_int)
#
# for pair_int in input_list:
#     if pair_int[0] <= pair_int[1]:
#         print("{} {}".format(pair_int[0], pair_int[1]))
#     else:
#         print("{} {}".format(pair_int[1], pair_int[0]))

#for i in range(10000):
#    print("Hello World")
#a = input().split()
#a_int = [int(s) for s in a]
#a_sorted = sorted(a_int)
#print(' '.join(map(str, a_sorted)))

Buggy submission (verdict: Runtime Error):
import sys
sys.setrecursionlimit(250000)

def main():
    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")
main()