Submission #188234

---

Source Code Expand

#include<iostream>
using namespace std;

int ng[3];

bool OK(int n) {
  return n != ng[0] and n != ng[1] and n != ng[2];
}

bool NG(int n) {
  return not OK(n);
}

int main() {
  int n, limit = 100;
  cin >> n >> ng[0] >> ng[1] >> ng[2];

  if (NG(n)) {
    cout << "NO" << endl;
    return 0;
  }

  while (limit > 0) {
    if (n == 0) break;
    int dn = -3;

    if ( NG(n + dn) ) {
      dn = -2;
      if ( NG(n + dn) ) {
        dn = -1;
        if ( NG(n + dn) ) {
          dn = 0;
        }
      }
    }
    if (dn == 0) {
      cout << "NO" << endl;
      return 0;
    }

    n += dn;
    limit--;
  }

  if (n > 0 and limit == 0) {
    cout << "NO" << endl;
  } else if (n <= 0) {
    cout << "YES" << endl;
  }
return 0;
}

Submission Info

Judge Result