Submission #6103827

---

Source Code Expand

#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> P;

#define MOD 1000000007
#define REP(i, N) for (int i = 0; i < N; ++i)
#define REP1(i, N) for (int i = 1; i <= N; ++i)
#define RREP(i, N) for (int i = N - 1; i >= 0; --i)
#define ALL(a) a.begin(), a.end()

int main() {
  int n;
  cin >> n;
  int ng[3];
  REP(i, 3) cin >> ng[i];
  bool ok = true;
  if (n == ng[0] || n == ng[1] || n == ng[2]) {
    ok = false;
  }
  int sub = 3;
  int cnt = 0;
  while (0 < n) {
    if (sub == 0) {
      ok = false;
      break;
    }
    if (n < sub) {
      sub--;
      continue;
    }
    n -= sub;
    bool change = false;
    REP(i, 3) {
      if (n == ng[i]) {
        change = true;
      }
    }
    if (change) {
      n += sub;
      sub--;
    } else {
      cnt++;
      sub = 3;
    }
  }
  if (100 < cnt) ok = false;
  cout << (ok ? "YES" : "NO") << endl;
  return 0;
}

Submission Info

Judge Result