Submission #4046447

---

Source Code Expand

#include<algorithm>
#include<complex>
#include<ctype.h>
#include<iomanip>
#include<iostream>
#include<map>
#include<math.h>
#include<numeric>
#include<queue>
#include<set>
#include<stack>
#include<stdio.h>
#include<string>
#include<string>
#include<vector>

using namespace std;
typedef long long ll;

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("YES")
#define p_no() p("NO")

int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, 1, 0, -1};

const ll mod = 1e9 + 7;
const ll inf = 1e18;

ll NG1, NG2, NG3;

bool is_ok(ll x){
    if(x != NG1 && x != NG2 && x != NG3){
        return true;
    }
    else{
        return false;
    }
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N;
    cin >> N;

    cin >> NG1 >> NG2 >> NG3;

    if(!is_ok(N)){
        p_no();
        return 0;
    }

    FOR(i, 0, 100){
        for(int j=3; j>0; j--){
            ll destination = N-j;
            if(is_ok(destination)){
                N -= j;
                break;
            }
        }
    }

    if(N<=0){
        p_yes();
    }
    else{
        p_no();
    }

    return 0;
}

Submission Info

Judge Result