Submission #187313

---

Source Code Expand

#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
#include <functional>
using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<bool> ng(301, false);
    for(int i=0; i<3; ++i){
        int a;
        cin >> a;
        ng[a] = true;
    }

    vector<int> dp(301, INT_MAX / 2);
    dp[0] = 0;
    for(int i=0; i<=300; ++i){
        for(int j=1; j<=3; ++j){
            if(i+j <= 300 && !ng[i+j])
                dp[i+j] = min(dp[i+j], dp[i] + 1);
        }
    }

    if(dp[n] <= 100)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;

    return 0;
}

Submission Info

Judge Result