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

Solution in C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)


//
//  main.cpp
//

#include <iostream>
#include <string>
#include <vector>
#include <map>
#include <algorithm>
#include <fstream>
#include <cstdlib>
#include <cstdio>
#include <ctime>
#include <cmath>

using namespace::std;

#define V vector
#define VC vector<char>
#define VI vector<int>
#define VS vector<string>
#define VD vector<double>
#define VI2 vector<vector<int>>
#define VC2 vector<vector<char>>
#define VS2 vector<vector<string>>
#define VD2 vector<vector<double>>
#define S string
#define LL long long int
#define L long long
#define U unsigned
#define ULL unsigned long long int
#define REP(i,n) for (int i = 0; i < (n); ++i)
#define out cout <<
#define in cin >>
#define output(x) cout << (x) << endl
#define debug(x) cout<<#x<<": "<<x<<endl
#define numIn(n) int (n); cin >> (n)
#define getl(s) getline(cin,(s))
#define RT cout << endl
#define rt endl
#define isUp(s,i) (s)[(i)] >= 65 && (s)[(i)] <= 90
#define ismin(a,b) (a>b?b:a)
#define ismax(a,b) (a>b?a:b)
#define outVC(v) for(int i = 0; i < (v).size(); ++i){ cout << (v)[i]; } cout << endl
#define outVI(v) for(int i = 0; i < (v).size() - 1; ++i){ cout << (v)[i] << " "; } cout << (v)[v.size() - 1]; cout << endl
#define vAll(v) (v).begin(), (v).end()
#define vSort(v) sort((v).begin(), (v).end())

#define Seed() srand((int)time(0))
#define Random(x) arc4random() / 2 % (x) + 1

VS split(const char* strTop, int length, char delm);
VS split(const string& str, char delm);

typedef struct point{
    int x;
    int y;
}Point;

int main()
{
    VI can(3);
    REP(i, 3){
        in can[i];
    }
    vSort(can);
    if(can[2] == can[1] + can[0]){
        output("OK");
    }
    else{
        output("NG");
    }
    
    return 0;
}


VS split(const char* strTop, int length, char delm)
{
    VS result;
    VC baka;
    for(int i = 0; i < length; ++i)
    {
        //区切り文字が来たらそれまでのやつを突っ込む
        if(*(strTop + i) == delm){
            string tmp(baka.begin(), baka.end());
            baka.clear();
            result.push_back(tmp);
        }
        //区切り文字が来るまでvector<char>に一つづつ入れておく
        else{
            baka.push_back(*(strTop + i));
        }
    }
    //最後だけ区切り文字がなく無視されるためそれに対する処理
    string tmp(baka.begin(), baka.end());
    result.push_back(tmp);
    
    return result;
}

VS split(const string& str, char delm)
{
    VS result;
    VC baka;
    for(int i = 0; i < str.length(); ++i)
    {
        //区切り文字が来たらそれまでのやつを突っ込む
        if(str[i] == delm){
            string tmp(baka.begin(), baka.end());
            baka.clear();
            result.push_back(tmp);
        }
        //区切り文字が来るまでvector<char>に一つづつ入れておく
        else{
            baka.push_back(str[i]);
        }
    }
    //最後だけ区切り文字がなく無視されるためそれに対する処理
    string tmp(baka.begin(), baka.end());
    result.push_back(tmp);
    
    return result;
}