Submission #3978139

---

Source Code Expand

#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<cmath>
#include<map>
#include<stack>
#include<queue>
#include<bitset>

#define ipair pair<int,int>
#define rep(i,n) for(i=0;i<n;i++)

using namespace std;

typedef long long int lli;
typedef vector<int> vi;

int main() {
	int n, i, j, k;
	vi ng;

	ng.resize(3);
	cin >> n;
	rep(i, 3) {
		cin >> ng[i];
	}
	sort(ng.begin(), ng.end());

	j = 100;

	while (n > 0 && j > 0) {
		rep(i, 3) {
			if (!(binary_search(ng.begin(), ng.end(), n - (3 - i)))) {
				n -= (3 - i);
				j--;
				break;
			}
		}
		if (i == 3) {
			cout << "NO" << endl;
			return 0;
		}
	}
	if (n > 0) {
		cout << "NO" << endl;
	}
	else {
		cout << "YES" << endl;
	}

	return 0;
}

Submission Info

Judge Result