Submission #1215311

---

Source Code Expand

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<string>
#include<cstring>
#include<queue>
#include<vector>
#include<functional>
#include<cmath>
#include<map>
#include<stack>
#include<cstdlib>
#include<list>
#include<set>
#include<numeric>

using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
	int N;
	int ng1, ng2, ng3;  
	cin >> N >> ng1 >> ng2 >> ng3;

	int flag = 0;
	for (int i = 0; i < 100; i++) {
		if (N - 3 >= 0 && N - 3 != ng1 && N - 3 != ng2 && N - 3 != ng3)N -= 3;
		else if (N - 2 >= 0 && N - 2 != ng1 && N - 2 != ng2 && N - 2 != ng3)N -= 2;
		else if (N - 1 >= 0 && N - 1 != ng1 && N - 1 != ng2 && N - 1 != ng3)N -= 1;
		else {
			flag = 1; break;
		}
		if (N == 0)break;
	}
	if (flag || N != 0)cout << "NO" << endl;
	else cout << "YES" << endl;
	return 0;
}

Submission Info

Judge Result