Submission #4070712

---

Source Code Expand

//inlclude before define 
#define _USE_MATH_DEFINES

//include
#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<cmath>
#include<type_traits>
#include<numeric>
#include<assert.h>
#include<deque>
#include<iomanip>
#include<set>
#include<tuple>
#include<map>

using namespace std;

//typedef
typedef vector<int> VI;
typedef vector<string> VS;
typedef vector<char> VC;
typedef vector<double> VD;
typedef pair<int, int> P1;
typedef long long int ll;

//number
#define INF 1e9
#define NUM 1000000007

//itr
#define all(x) begin(x),end(x)

//repeat
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,a,b) for(int i=int(a);i<int(b);i++)
#define RREPS(i,x) for(int i=((int)(x));i>0;i--)

//max,min
#define chmin(a,b) a=min((a),(b))
#define chmax(a,b) a=max((a),(b))

//function

/*ll gcd(ll a, ll b) {
	if (b == 0) return a;
	else return gcd(b, a%b);
}*/

/*ll lcm(ll a,ll b) {
	ll g = gcd(a, b);
	return a * (b / g);
}*/

/*int dig(int a) {
	int sum = 0;
	while (a) {
		sum += a % 10;
		a /= 10;
	}
	return sum;
}*/

//grid template
int x[] = { -1, 0, 1, 0 };
int y[] = { 0,-1,0,1 };
int xx[] = { -1,-1,1,1 };
int yy[] = { 1,-1,1,-1 };


int main () {
	int n;
	cin >> n;
	VI a (3);
	rep (i, 3) {
		cin >> a[i];
	}
	int cnt = 0;
	while (n >= 0) {
		cnt++;

		if (n - 1 == 0 || n - 2 == 0 || n - 3 == 0) {
			n = 0;
			break;
		}

		auto br = find (all (a), n);
		if (br != a.end ()) break;

		auto res3 = find (all (a), n - 3);
		auto res2 = find (all (a), n - 2);
		auto res1 = find (all (a), n - 1);
		
		if (res3 == a.end ()) {
			n -= 3;
		} else if (res2 == a.end ()) {
			n -= 2;
		} else if (res1 == a.end ()) {
			n -= 1;
		} else {
			break;
		}
	}
	if (cnt <= 100 && n == 0) {
		cout << "YES" << endl;
	} else {
		cout << "NO" << endl;
	}

}

  

Submission Info

Judge Result