Submission #187200

---

Source Code Expand

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cassert>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <functional>
#include <iostream>
#include <map>
#include <set>
using namespace std;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
typedef long long ll;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
bool dp[505][505];
int x,a,b,c;

int main()
{
	cin >> x >> a >> b >> c;
	if(x==a || x==b  || x==c)
	{
		puts("NO");
		return 0;
	}
	dp[x][0] = true;
	for(int i=0;i<100;i++)
	{
		for(int j=x;j>=0;j--)
		{
			if(!dp[j][i]) continue;
			
			if(j-1>=0 && j-1 != a && j-1 !=b && j-1 != c)
			{
				dp[j-1][i+1] = true;
			}
			if(j-2>=0 && j-2 != a && j-2 !=b && j-2 != c)
			{
				dp[j-2][i+1] = true;
			}
			if(j-3>=0 && j-3 != a && j-3 !=b && j-3 != c)
			{
				dp[j-3][i+1] = true;
			}
		}
	}
	puts(dp[0][100]?"YES":"NO");
}

Submission Info

Judge Result