Submission #1678459

---

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<set>
#include<numeric>
#include<limits>
#include<iterator>

#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define rep(i,n) for(int i=0; i<n; i++)
#define FOR(i,a,n) for(int i=a; i<n; i++)

using namespace std;
typedef long long ll;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ll, char> plc;
typedef pair<string, string> pss;

int n;
int ng1, ng2, ng3;
bool dp[110][310];

bool search(int x) {
	if (x != ng1 && x != ng2 && x != ng3)
		return true;
	return false;
}

int main()
{
	cin >> n;
	cin >> ng1 >> ng2 >> ng3;

	if (n == ng1 || n == ng2 || n == ng3) {
		cout << "NO" << endl;
		return 0;
	}

	dp[0][n] = true;
	int cnt = 0;
	for (int j = 0; j < 100; j++) {
		for (int i = n; i >= 0; i--) {
			if (dp[j][i]) {
				if (i - 1 >= 0 && search(i - 1)) dp[j+1][i - 1] = true;
				if (i - 2 >= 0 && search(i - 2)) dp[j+1][i - 2] = true;
				if (i - 3 >= 0 && search(i - 3)) dp[j+1][i - 3] = true;
			}
		}
	}
	
	for (int j = 1; j <= 100; j++) {
		if (dp[j][0] == true) {
			cout << "YES" << endl;
			return 0;
		}
	}
	cout << "NO" << endl;
	return 0;
}

Submission Info

Judge Result