Submission #1626205

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
//    std::sort(a.begin(), a.end(), std::greater<int>() );
#define REP(i, s, n) for (int i = s; i < n; ++i)
#define rep(i, n) REP(i, 0, n)
#define SORT(c) sort((c).begin(), (c).end())
#define IINF INT_MAX
#define LLINF LLONG_MAX
#define DEBUG true

using namespace std;
/*
std::vector<std::string> split(const std::string &input, char delimiter)
{
    std::istringstream stream(input);

    std::string field;
    std::vector<std::string> result;
    while (std::getline(stream, field, delimiter))
    {
        result.push_back(field);
    }
    return result;
}
*/

int main()
{
    int n;
    cin >> n;
    int ng[3];
    rep(i, 3) cin >> ng[i];
    sort(ng,ng+3);
    rep(i, 3) if (ng[i] == n)
    {
        cout << "NO" << endl;
        return 0;
    }
    if (ng[1] == ng[0] + 1 && ng[2] == ng[0] + 2&&ng[0]<n)
    {
        cout << "NO" << endl;
        return 0;
    }
    int num = 0;
    bool flag = true;
    rep(i, 101)
    {
        if (n == num)
        {
            cout << "YES" << endl;
            return 0;
        }
        rep(j, 3) if (ng[j] == num + 3)
            flag = false;
        if (flag && num + 3 <= n)
        {
            num  +=3;
            continue;
        }
        flag = true;
        rep(j, 3) if (ng[j] == num + 2)
            flag = false;
        if (flag && num + 2 <= n)
        {
            num  +=2;
            continue;
        }
        num++;
    }
    cout << "NO" << endl;
    return 0;
}

Submission Info

Judge Result