Submission #1602449

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second

int n, a, b, c;
int dp[301];

int main() {
    cin >> n >> a >> b >> c;
    fill(dp, dp + n + 1 /* ここ地味に注意 */, 101);

    dp[0] = 0;

    for (int i = 1; i <= n; ++i) {
        if (i == a or i == b or i == c) continue;
        for (int j = 1; j <= 3; ++j) {
            if ((i - j) < 0 or (i - j) == a or (i - j) == b or (i - j) == c) continue;
            dp[i] = min(dp[i], dp[i - j] + 1);
        }
    }

    cout << (dp[n] > 100 ? "NO" : "YES") << endl;

    return 0;
}

Submission Info

Judge Result