Submission #343944

---

Source Code Expand

#include<iostream>
#include<stack>
#include<utility>
using namespace std;
#define rep(i,a,b) for(auto (i)=(a);(i)<(b);(i)++)
#define rev(i,a,b) for(auto (i)=(b)-1;(i)>=(a);(i)--)

int N,NG[3];
int dfs(){
	int used[301];
	rep(i, 0, N)used[i] = -1;
	stack<int> s;

	used[N] = 0;
	rep(i, 0, 3){
		used[NG[i]] = 100;
	}
	s.push(N);
	while (s.empty() == false){
		int v = s.top();
		s.pop();
		//cout << v << endl;
		rep(i, 1, 4){
			int p = v - i;
			if (p>=0&&used[v]<100&&used[p]<0){
				used[p] = used[v] + 1;
				s.push(p);
			}
		}
	}
	return (used[0] >= 0);
}

int main(void){
	cin >> N >> NG[0] >> NG[1] >> NG[2];
	if (dfs()){
		cout << "YES" << endl;
	}
	else
		cout << "NO" << endl;
	return(0);
}

Submission Info

Judge Result