Submission #7090022

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> lpair;
const ll MOD = 1e9 + 7;
const ll INF = 1e18;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
#define rREP(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " ";} cout<<endl;
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    
    int n;
    cin >> n;
    int ng[3];
    rep(i,3) cin >> ng[i];

    int now_num=n;
    bool flag = true;
    rep(i,100)
    {
        if (now_num == 0) break;
        rep(j,3)
        {
            if(now_num==ng[i]){
                flag = false;
            }
        }
        bool hetta = false;
        for(int j=3;j>0;j--)
        {
            if (now_num-j<0) continue;
            bool ngflag = true;
            rep(k,3)
            {
                if(now_num-j==ng[k]) ngflag = false;
            }
            if(ngflag){
                now_num -= j;
                hetta = true;
                break;
            }
        }
        if (!hetta)
        {
            flag = false;
            break;
        }
    }

    if (flag && now_num == 0)
    {
        cout << "YES" << endl;
    }
    else
    {
        cout << "NO" << endl;
    }
    
}

Submission Info

Judge Result