Submission #1690584

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
#define fol(i,n) for(int i=0;i<n;i++)
#define pb push_back
typedef long long ll;
typedef pair<int,int> P;
typedef vector<P> vip;
void solve(){
    int n,n1,n2,n3,cnt=0;
    cin >> n >> n1 >> n2 >> n3;
    if (n==n1||n==n2||n==n3){
        cout << "NO" <<endl;
        return;
    }
    while(n>0){
        if (n-3==n1||n-3==n2||n-3==n3){
            if (n-2==n1||n-2==n2||n-2==n3){
                if (n-1==n1||n-1==n2||n-1==n3){
                    cout << "NO" <<endl;
                    return;
                }else{
                    n--;
                }
            }else{
                n-=2;
                cnt++;
            }
        }else{
            n-=3;
            cnt++;
        }
    }
    if (cnt<=100){
        cout << "YES" <<endl;
    }else{
        cout << "NO" <<endl;
    }
}

int main(){
//option:-std=c++0x
    solve();
    return 0;
}

Submission Info

Judge Result