Submission #2250386

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <list>
#include <set>
#include <numeric>
#include <map>
#include <math.h>
#include <iomanip>
#include <stack>
#include <queue>
#include <bitset>
#include <math.h>

#define INF 100100100

typedef long long int llint;

using namespace std;

typedef pair<llint, llint>Pii;

#define pi 3.141592653589793)
#define mod 1000000007

int main() {
	int n,ng1,ng2,ng3;
	cin >> n >> ng1 >> ng2 >> ng3;
	if (n == ng1 || n == ng2 || n == ng3) {
		puts("NO");
		return 0;
	}
	for (int i = 0; i < 100; i++) {
		if (n - 3 == ng1 || n - 3 == ng2 || n - 3 == ng3 || n -3 <0) {
			if (n - 2 == ng1 || n - 2 == ng2 || n - 2 == ng3 || n-2 < 0) {
				if (n - 1 == ng1 || n - 1 == ng2 || n - 1 == ng3) {
					puts("NO");
					return 0;
				}
				else n -= 1;
			}
			else n -= 2;
		}
		else n -= 3;
		if (n == 0) {
			puts("YES");
			return 0;
		}
	}
	puts("NO");
	return 0;
}

Submission Info

Judge Result