Problem:


Score : 100 points

Problem Statement

Two students of AtCoder Kindergarten are fighting over candy packs.

There are three candy packs, each of which contains a, b, and c candies, respectively.

Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.

Note that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.

Constraints

1 ≦ a, b, c ≦ 100

Input

The input is given from Standard Input in the following format:

a b c

Output

If it is possible to distribute the packs so that each student gets the same number of candies, print Yes. Otherwise, print No.

Sample Input 1

10 30 20

Sample Output 1

Yes

Give the pack with 30 candies to one student, and give the two packs with 10 and 20 candies to the other. Then, each gets 30 candies.

Sample Input 2

30 30 100

Sample Output 2

No

In this case, the student who gets the pack with 100 candies always has more candies than the other.

Note that every pack must be given to one of them.

Sample Input 3

56 25 31

Sample Output 3

Yes



Sample input:
10 30 20


Sample output:
Yes

Submission status: Runtime Error

Solution code:
#!/usr/bin/env python3
import sys, itertools
from math import gcd
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")

Submission status: Runtime Error

Solution 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())
print(0)
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")

Submission status: Runtime Error

Solution 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")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution 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")

Submission status: Runtime Error

Solution code:
W,H,N = map(int,input().split())
Xl=0
Xr=W
Yu=0
Yh=H

for i in range(N):
    Xt,Yt,At = map(int,input().split())
    if((At==1)and(Xl<Xt)):
        Xl=Xt
    elif((At==2)and(Xr>Xt)):
        Xr=Xt
    elif((At==3)and(Yu<Yt)):
        Yu=Yt
    elif(Yh>Yt):
        Yh=Yt

if((Xr<=Xl)or(Yh<=Yu)):
    print("0")
else:
    print((Xr-Xl)*(Yh-Yu))

Submission status: Runtime Error

Solution code:
W,H,N = map(int,input().split())
Xl=0
Xr=W
Yu=0
Yh=H

for i in range(N):
    Xt,Yt,At = map(int,input().split())
    if(At==1):
        Xl=Xt
    elif(At==2):
        Xr=Xt
    elif(At==3):
        Yu=Yt
    else:
        Yh=Yt

if((Xr<=Xl)or(Yh<=Yu)):
    print("0")
else:
    print((Xr-Xl)*(Yh-Yu))

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
typedef long long ll;
#define REP(i,n) for(int i=0;i<n;i++)
#define ALL(x) (x).begin(),(x).end()
using namespace std;

//素因数分解
vector<pair<ll,int>> factorize(ll n){
    vector<pair<ll,int>>res;
    for(ll i=2;i*i<=n;i++){
        if(n%i)continue;
        res.emplace_back(i,0);
        while (n%i == 0)
        {
        n /= i;
        res.back().second++;
        }
        
    }
    if(n != 1) res.emplace_back(n,1);
    return res;
}

void trace(int A[],int N){
    REP(i,N){
        if(i>0)printf(" ");
        printf("%d",A[i]);
    }
    printf("\n");
}


int main(){
    int A,B,C;
    cin >> A >> B >> C;
    int S[3] = {A,B,C};
    sort(S,S+3);
    if(S[0]+S[1]==S[2])puts("Yes");
    else puts("No");
}

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input())

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

Submission status: Runtime Error

Solution code:
a=int(input())
b=int(input())
c=int(input())
d="No"
if a==(b+c):
        d="Yes"
if b==(c+a):
        d="Yes"
if c==(a+b):
        d="Yes"
print(d)

Submission status: Runtime Error

Solution code:
#n = int(input())
a = list(map(int,input().split()))

a.sort()

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
W, H, N = map(int, input().split())
x_min = 0
x_max = W
y_min = 0
y_max = H
for i in range(N):
    x, y, a = map(int, input().split())
    if a == 1 and x > x_min:
        x_min = x
    elif a == 2 and x < x_max:
        x_max = x
    elif a == 3 and y > y_min:
        y_min = y
    elif a == 4 and y < y_max:
        y_max = y
if (x_max - x_min) > 0 or (y_max - y_min) > 0:
    S = (x_max - x_min) * (y_max - y_min)
else:
    S = 0
print(S)

Submission status: Runtime Error

Solution code:
W, H, N = map(int, input().split())
x_min = 0
x_max = W
y_min = 0
y_max = H
for i in range(N):
    x, y, a = map(int, input().split())
    if a == 1 and x > x_min:
        x_min = x
    elif a == 2 and x < x_max:
        x_max = x
    elif a == 3 and y > y_min:
        y_min = y
    elif a ==4 and y < y_max:
        y_max = y
if (x_max - x_min) <= 0 or (y_max - y_min) < 0:
    S = 0
else:
    S = (x_max - x_min) * (y_max - y_min)
print(S)

Submission status: Runtime Error

Solution code:
candy = input().split(" ")
if sum(candy)-max(candy) == max(candy):
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution 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')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
input_ = input().split()

a, b, c = input_
a, b, c = int(a), int(b), int(c)

if a == b + c, b == c + a, c == a + b:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

Solution code:
input = input().split()

a, b, c = input_
a, b, c = int(a), int(b), int(c)

if a == b + c, b == c + a, c == a + b:
    print("YES")
else:
    print("NO")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N, T = map(int, input().split())
nums = list(map(int, input().split()))
INF = 10**10
min_num = INF
max_diff = 0
cnt = 0
for num in nums:
  if num-min_num > max_diff:
    cnt = 1
    max_diff = num-min_num
  elif num-min_num == max_diff:
    cnt += 1
  if num < min_num:
    min_num = num
print(min(cnt, T//2))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution 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')

Submission status: Runtime Error

Solution 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')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:

can = list(map(int,input().split()))

#list 並び替え→最初と最後足して == 真ん中　ならばYES!!!

can = can.sort()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
using namespace std;

int main()
{
    int a, b, c, ab;
    cin >> a >> b >> c;
    ab = max(a, b);

    if (max(ab, c) == (a + b + c) / 2)
    {
        cout << "Yes" << endl;
    }
    else
    {
        cout << "NO" << endl;
    }
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c=sorted(map(int,input().split()))
print('Yes' if x+y==z else 'No')

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
x,y,z=sorted(a,b,c)
print('Yes' if x+y==z else 'No')

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
x,y,z=sorted(a,b,c)
print('Yes' if x+y=z else 'No')

Submission status: Runtime Error

Solution 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')

Submission status: Runtime Error

Solution 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')

Submission status: Runtime Error

Solution code:
print("A"+input()[8]+"C")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
candy=sorted(map(int,input().split()))
print("Yes" if candy[0]+candy[1]==candy[2] "No")

Submission status: Runtime Error

Solution code:
candy=sorted(map(int,input().split()))
print("Yes" if candy[0]+candy[1]=candy[2] "No")

Submission status: Runtime Error

Solution code:
candy=sorted(map(int,input().split()))
print("Yes" if candy[0]+candy[1]=candy[2])

Submission status: Runtime Error

Solution code:
A, B, C = [int(input()) for _ in range(3)]
if A + B == C or B + C == A or C + A == B:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
W,H,N=map(int,input().split())
A = []
B = []
C = []
D = []
 
for i in range(N):
  x,y,a = map(int,input().split())
  if a == 1:
    A.append(x)
  elif a == 2:
    x = W-x
    B.append(x)
  elif a == 3:
    C.append(y)
  else:
    y = H-y
    D.append(y)
if len(A)>0:
    a = max(A)
else:
    a=0
 
if len(B)>0:
    b = max(B)
else:
    b = 0
 
if len(C)>0:
    c = max(C)
else:
    c = 0
if len(D)>0:
    d = max(D)
else:
    d = 0
 
w = W - (a+b)
h = H - (c+d)
if w*h<=0:
    print(0)
else:
    print(w*h)

Submission status: Runtime Error

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

i = 0

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a, b, c = sorted(map(int, input()))
if a + b == c:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

Solution code:
w, h, n = map(int, input().split())
coord_list = [list(map(int, input().split())) for i in range(n)]

x_list = [i for i in range(w + 1)]
y_list = [i for i in range(h + 1)]

for a in coord_list:
    if a[-1] == 1:
        x_list = [i for i in x_list if i >= a[0]]
    elif a[-1] == 2:
        x_list = [i for i in x_list if i <= a[0]]
    elif a[-1] == 3:
        y_list = [i for i in y_list if i >= a[1]]
    elif a[-1] == 4:
        y_list = [i for i in y_list if i <= a[1]]

print(max((max(x_list) - min(x_list)), 0) * max((max(y_list) - min(y_list)), 0))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define REP(i, n) for (int i = 0; i < n; i++) //for文マクロ
using namespace std;

typedef unsigned long ul;
typedef long long ll;
typedef pair<ul, ul> P; //ペア　タイプでふ

int main()
{
    int a, b, c;
    cin >> a >> b >> c;
    if (a + b == c || a + c == b || b + c == a)
    {
        cout << "Yes";
    }
    else
    {
        cout << "No";
    }
}

Submission status: Runtime Error

Solution code:
/**
 * code generated by JHelper
 * More info: https://github.com/AlexeyDmitriev/JHelper
 * @author
 */

#include <iostream>
#include <fstream>

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define tr(container, it) \
        for (auto it = container.begin(); it != container.end(); it++)
#define scontains(c, x) ((c).find(x) != (c).end())   //O(log n)
#define contains(c, x) (find((c).begin(),(c).end(),x) != (c).end()) //O(n)
#define pll pair<ll,ll>
#define pii pair<int,int>
#define mll map<ll,ll>
#define intv(x, a, b)((x)>=a && (x)<=b)
#define  rep(i, begin, end) for (__typeof(end) i = (begin) - ((begin) > (end)); i != (end) - ((begin) > (end)); i += 1 - 2 * ((begin) > (end)))
#define  _for(i, end) for (__typeof(end) i = 0; i < (end); i += 1)
#define all(x) (x).begin(),(x).end()
//#define len(array)  (sizeof(array)/sizeof((array)[0]))
#define what_is(x) cerr << #x << " is " << x << endl;
#define error(args...) { string _s = #args; replace(_s.begin(), _s.end(), ',', ' '); stringstream _ss(_s); istream_iterator<string> _it(_ss); err(_it, args); }
#define mod(x, m) ((((x) % (m)) + (m)) % (m))
const double PI = 2 * acos(.0);
const int INF = 0x3f3f3f3f;
const ll LLINF = 1000000000000000005LL;;
const ll MOD = (ll) (1e9) + 7;
void _mod(ll &x){x = mod(x, MOD);}
//const ll MOD = (ll) 998244353 ;
const double EPS = 1e-10;

template<typename A, size_t N, typename T>
void Fill(A (&array)[N], const T &val) {
    std::fill((T *) array, (T *) (array + N), val);
}


//#define int ll

class A2FightingOverCandies {
public:
void solve(std::istream& cin, std::ostream& cout) {
    int a,b,c;
    cin >> a >> b >> c;
    cout << (a + b + c == 2*max({a,b,c})? "Yes":"No") << endl;
}
};


#undef int
int main() {
	A2FightingOverCandies solver;
	std::istream& in(std::cin);
	std::ostream& out(std::cout);
	solver.solve(in, out);
	return 0;
}

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
MAX=max[a,b,c]
SUM=sum[a,b,c]
if MAX==SUM-MAX:
  print(Yes)
else:
  print(No)

Submission status: Runtime Error

Solution 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")

Submission status: Runtime Error

Solution code:
l = list(map(int,input().split()))
a = 0
b = 1
c = 1
while c <= l[0]:
    if a + b >= l[1] and a + b <= l[2]:
        sum += c
    if b == 9:
        b = 0
        a += 1
    else:
        b += 1
    c = 10 * a + b
print(sum)

Submission status: Runtime Error

Solution code:
w,h,n=map(int,input().split())


x_min=0
y_min=0

for i in range(n):
    x,y,a=map(int,input().split())

    if a==1:
        x_min=max(x_min,x)

    elif a==2:
        w=min(x,w)

    elif a==3:
        y_min=max(y_min,y)

    elif a==4:
        h=min(y,h)

white=(w-x_min)*(h-y_min)

if white>0:
  print(white)
  
else:
  print("0")

Submission status: Runtime Error

Solution code:
andy = list(map(int, input().split()))

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

Submission status: Runtime Error

Solution code:
w,h,n=map(int,input().split())

min_x=0
min_y=0

for i in range(n):
    x,y,a=map(int,input().split())

    if a==1:
        min_x=max(min_x,x)

    elif a==2:
        w=min(w,x)

    elif a==3:
        min_y=max(min_y,y)

    elif a==4:
        h=min(h,y)

white=int((w-min_x)*(h-min_y))

if white>0:
    print(white)

else:
    print("0")

Submission status: Runtime Error

Solution code:
w,h,n=map(int,input().split())

min_x=0
min_y=0

for i in range(n):
    x,y,a=map(int,input().split())

    if a==1:
       min_x=max(min_x,x)

    elif a==2:
        w=min(w,x)

    elif a==3:
        min_y=max(min_y,y)

    else:
        h=min(h,y)

white=(w-min_x)*(h-min_y)
print(white)

Submission status: Runtime Error

Solution 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")

Submission status: Runtime Error

Solution 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'

Submission status: Runtime Error

Solution code:
anslist = ['Yes', 'No']
a, b, c = map(int, input.split())
print(anslist[(a+b+c)%2])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
l = 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')

Submission status: Runtime Error

Solution code:
l = 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')

Submission status: Runtime Error

Solution code:
l = map(int, raw_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')

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution 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')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution 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")

Submission status: Runtime Error

Solution code:
W, H, N = map(int, input().split())
X, Y = 0, 0
for i in range(N):
  x, y, a = map(int, input().split())
  if a == 1:
    X = max(x, X)
  elif a == 2:
    W = min(W, x)
  elif a == 3:
    Y = max(y, Y)
  elif a == 4:
    H = min(H, y)
ans = (W-X)*(H-Y)
if ans <= 0:
  print(0)
else:
  print(ans)

Submission status: Runtime Error

Solution code:
w, h, n = map(int, input().split())
wz = 0
hz = 0
for i in range (n):
    x, y, a = map(int, input().split())
    if a == 1:
        wz = x
    if a == 2:
        w = x
    if a == 3:
        hz = y
    if a == 4:
        h = y
if wz < w or hz < h:
    print((w-wz)*(h-hz))
else:
    print(0)

Submission status: Runtime Error

Solution 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")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=list(map(int,input()));print("YNeos"[sum(a)!=max(a)*2])

Submission status: Runtime Error

Solution code:
w, h, n = list(map(int,input().split()))

init_w, init_h, init_w2, init_h2 = 0,0,w,h
for i in range(n):
  x, y, a = list(map(int,input().split()))
  
  if a ==1:
    init_w = x
  elif a==2:
    init_w2 = x
  elif a==3:
    init_h = y
  elif a==4:
    init_h2 = y

area = (init_w2-init_w)*(init_h2-init_h)
if area<=0:
  area = 0
print(area)

Submission status: Runtime Error

Solution code:
, H, N = map(int, input().split())
P = [list(map(int, input().split())) for _ in range(N)]
# X1, X2, Y1, Y2 = 0, W, 0, H
X1 = 0
X2 = W
Y1 = 0
Y2 = H

for x, y, a in P:
    if a == 1:
        X1 = max(X1, x)
    elif a == 2:
        X2 = min(X2, x)
    elif a == 3:
        Y1 = max(Y1, y)
    elif a == 4:
        Y2 = min(Y2, y)
else:
    if X2 <= X1 or Y2 <= Y1:
        print(0)
    else:
        print((X2 - X1) * (Y2 - Y1))

Submission status: Runtime Error

Solution code:
W, H, N = map(int, input().split())
P = [list(map(int, input().split())) for _ in range(N)]
X1, X2, Y1, Y2 = 0, W, 0, H

for x, y, a in P:
    if a == 1:
        X1 = max(X1, x)
    elif a == 2:
        X2 = min(X2, x)
    elif a == 3:
        Y1 = max(Y1, y)
    elif a == 4:
        Y2 = min(Y2, y)
else:

    if X2 <= X1 or Y2 <= Y1:
        print(0)
    else:
        print((X2 - X1) * (Y2 - Y1))

Submission status: Runtime Error

Solution code:
W, H, N = map(int, input().split())
P = [list(map(int, input().split())) for _ in range(N)]
X1, X2, Y1, Y2 = 0, W, 0, H

for x, y, a in P:
    if a == 1:
        X1 = max(X1, x)
    elif a == 2:
        X2 = min(X2, x)
    elif a == 3:
        Y1 = max(Y1, y)
    elif a == 4:
        Y2 = min(Y2, y)

if X2 <= X1 or Y2 <= Y1:
    print(0)
else:
    print((X2 - X1) * (Y2 - Y1))

Submission status: Runtime Error

Solution code:
W, H, N = map(int, input().split())
P = [list(map(int, input().split())) for _ in range(N)]
X1, X2, Y1, Y2 = 0, W, 0, H

for x, y, a in P:
    if a == 1:
        X1 = max(X1, x)
    elif a == 2:
        X2 = min(X2, x)
    elif a == 3:
        Y1 = max(Y1, y)
    elif a == 4:
        Y2 = min(Y2, y)

if X2 <= X1 or Y2 <= Y1:
    S = 0
else:
    S = (X2 - X1) * (Y2 - Y1)

print(S)

Submission status: Runtime Error

Solution code:
W, H, N = map(int, input().split())
P = [list(map(int, input().split())) for _ in range(N)]
X1, X2, Y1, Y2 = 0, W, 0, H

for x, y, a in P:
    if a == 1:  # ai=1
        X1 = max(X1, x)
    elif a == 2:  # ai=2
        X2 = min(X2, x)
    elif a == 3:  # ai=3
        Y1 = max(Y1, y)
    elif a == 4:  # ai=4
        Y2 = min(Y2, y)

if X2 <= X1 or Y2 <= Y1:
    S = 0
else:
    S = (X2 - X1) * (Y2 - Y1)

print(S)

Submission status: Runtime Error

Solution code:
W, H, N = map(int, input().split())
P = [list(map(int, input().split())) for _ in range(N)]
X1, X2, Y1, Y2 = 0, W, 0, H

for x, y, a in P:
    if a == 1:  # ai=1
        X1 = max(X1, x)
    elif a == 2:  # ai=2
        X2 = min(X2, x)
    elif a == 3:  # ai=3
        Y1 = max(Y1, y)
    elif a == 4:  # ai=4
        Y2 = min(Y2, y)

if X1 < X2 and Y1 < Y2:
    S = (X2 - X1) * (Y2 - Y1)
else:
    S = 0
print(S)

Submission status: Runtime Error

Solution code:
W, H, N = map(int, input().split())
P = [list(map(int, input().split())) for _ in range(N)]
X1, X2, Y1, Y2 = 0, W, 0, H

for i in P:
    if i[2] == 1:  # ai=1
        X1 = max(X1, i[0])
    elif i[2] == 2:  # ai=2
        X2 = min(X2, i[0])
    elif i[2] == 3:  # ai=3
        Y1 = max(Y1, i[1])
    elif i[2] == 4:  # ai=4
        Y2 = min(Y2, i[1])

if X1 < X2 and Y1 < Y2:
    S = (X2 - X1) * (Y2 - Y1)
else:
    S = 0
print(S)

Submission status: Runtime Error

Solution code:
W, H, N = map(int, input().split())
P = [list(map(int, input().split())) for i in range(N)]
X1, X2, Y1, Y2 = 0, W, 0, H

for i in range(N):
    if P[i][2] == 1:  # ai=1
        X1 = max(X1, P[i][0])
    elif P[i][2] == 2:  # ai=2
        X2 = min(X2, P[i][0])
    elif P[i][2] == 3:  # ai=3
        Y1 = max(Y1, P[i][1])
    elif P[i][2] == 4:  # ai=4
        Y2 = min(Y2, P[i][1])

if X1 < X2 and Y1 < Y2:
    S = (X2 - X1) * (Y2 - Y1)
else:
    S = 0
print(S)

Submission status: Runtime Error

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

if a-b==0 
  print(int(c))
elif b-c==0:
  print(int(a))
elif c-a==0:
  print(int(b))

Submission status: Runtime Error

Solution 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")

Submission status: Runtime Error

Solution code:
def main():
    list = [int(x) for x in input().split()]

    sum = x[0] + x[1] + x[2]
    max = x[0]
    if max <= x[1]:
        max = x[1]
    if max <= x[2]:
        max = x[2]

    if max * 2 == sum:
        print("Yes")
    else:
        print("No")

if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
w,h,n=(int (i) for i in input().split())

w1=0
w2=w
h3=0
h4=h

for i in range(n):
    x,y,a=(int (i) for i in input().split())
    if a==1 and x>w1:
        w1=x
    elif a==2 and x<w2:
        w2=x
    elif a==3 and y>h3:
        h3=y
    elif a==4 and y<h4:
        h4=y

s=(w-w1-(w-w2))*(h-h3-(h-h4))

if s<=0:
    print(0)
else:
    print(s)

Submission status: Runtime Error

Solution code:
arr = map(int, input().split())

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

Submission status: Runtime Error

Solution code:
arr = map(int, input().split())

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
f = True

a, b, c = map(int, input().split())
candy = [a, b, c]
if not max(candy) == sum(candy) - max(candy):
    f = False

if f:
    print("YES")
else:

Submission status: Runtime Error

Solution code:
# -*- Coding: utf-8 -*-

a, b, c = map(int, input().split())
candy = [a, b, c]
candy.sort()
if candy[0] + candy[1] == candy[2]:
    print("YES")
else:
    Print("NO")

Submission status: Runtime Error

Solution code:
# -*- Coding: utf-8 -*-

a, b, c = map(int, input().split())
candy = [a, b, c]
if max(candy) == sum(candy) - max(candy):
    print("YES")
else:
    Print("NO")

Submission status: Runtime Error

Solution code:
# -*- Coding: utf-8 -*-

a, b, c = map(int, input().split())
candy = [a, b, c]
if max(candy) == sum(candy) - max(candy):
    print("YES")
else:

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
if a+b=c:
    print(“Yes”)
if else b+c=a:
    print(“Yes”)
if else a+c=b:
    print(“Yes”)
else:
    print(“No”)

Submission status: Runtime Error

Solution code:
from functools import reduce
from operator import add

A = list(map(int, input().split()))
print("Yes" if max(A) == reduce(add, [i for i in A if i != max(A)]) else "No")

Submission status: Runtime Error

Solution code:
# ABC047A - キャンディーと2人の子供 / Fighting over Candies
a, b, c = sorted(list(map(int, input().rstrip().split())))
print("Yes" if a + B == c else "No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>
#define ll long long
#define INIT std::ios::sync_with_stdio(false);std::cin.tie(0);
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;

using namespace std;

int main() {
  INIT;
  
  int a,b,c;
  cin >> a >> b >> c;
  if(a+b == c ||a+c == b ||c+b == a){
    cout << "Yes" << endl;
  }else{
    cout << "No" << endl;
  }
  
  return 0;
}

Submission status: Runtime Error

Solution code:
W,H,N=map(int,input().split())
xM=W
xm=0
yM=H
ym=0
for i in range(N):
    a=list(map(int,input().split()))
    if a[2]==1:
        if a[0]>xm:
            xm=a[0]
        else:
            break
    elif a[2]==2:
        if a[0]<xM:
            xM=a[0]
        else:
            break
    elif a[2]==3:
        if a[1]>ym:
            ym=a[1]
        else:
            break
    else:
        if a[1]<yM:
            yM=a[1]
        else: 
            break
xl=xM-xm
yl=yM-ym
print(xl*yl)

Submission status: Runtime Error

Solution 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")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution 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")

Submission status: Runtime Error

Solution 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")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split());print('YNeos'[a+b!=c and a+c!=b and b+c!=a::2])

a, b, c =map(intinput().split())

print('YNeos'[a+b=c and b+c=a and c+a=b])

Submission status: Runtime Error

Solution code:
a, b, c = map(intinput().split())

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

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
ab = a+b
bc = b+c
ca = c+a
flg = False
if ab == c:
    flg = True
if bc == a:
    flg = True
if ca == b:
    flg = True

if flg = True:
    print("Yes")
else:
    print("No")

Submission status: Runtime Error

Solution code:
a = list(set([int(i) for i in input().split()])).sort()
if a[0]+a[1]==a[2]:
  print("Yes")
else:
  print("No")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution 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')

Submission status: Runtime Error

Solution 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')

Submission status: Runtime Error

Solution code:
W,H,N=list(map(int,input().split()))
ten=[list(map(int,input().split())) for _ in range(N)]
base=[[0,0,1],[0,0,3],[W,H,2],[W,H,4]]
ten.extend(base)
onemax=max(i[0] for i in ten if i[2]==1)
twomin=min(i[0] for i in ten if i[2]==2)
thrmax=max(i[1] for i in ten if i[2]==3)
foumin=min(i[1] for i in ten if i[2]==4)
if (twomin-onemax)>0 and (foumin-thrmax) >0:
    print((twomin-onemax)*(foumin-thrmax))
else:print(0)

Submission status: Runtime Error

Solution code:
a=list(map(int,input()).split())
if sum(a)/2==max(a):print("YES")
else:print("NO")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=input(a)
b=input(b)
c=input(c)
if a+b==c || b+c==a || a+c==b:
  print("Yes")
 else:
  print("No")

Submission status: Runtime Error

Solution 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")