Submission #1690678

---

Source Code Expand

#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <cmath>
#include <cassert>
#include <cstdio>

// #include <unordered_set>
// #include <unordered_map>

#define rep(i, a, n) for(int i = a; i < n; i++)
#define REP(i, n) rep(i, 0, n)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())

#define pb push_back
#define mp make_pair

int gcd(int a,int b){int c;while(b!=0){c=a%b;a=b;b=c;}return a;}
int lcm(int a,int b){int c=gcd(a,b);a/=c;return a*b;}

typedef std::pair<int, int> P;
typedef long long ll;
typedef long double ld;

const int MOD = 1000000007;
const int INF = 1e9;
const ll LINF = INF * 1ll * INF;
const ld DINF = 1e200;
const double EPS = 1e-10;
const double PI  = acos(-1.0);

using namespace std;

signed main(){
	int n;
	int a,b,c;
 
	cin>>n>>a>>b>>c;
 
 
	int dp[1000];
 
	REP(i,n){
		dp[i]=INF;
	}
 
	// for(int i=0;i<4;i++){
	// 	cout<<dp[i]<<" ";
	// }
 
	dp[n]=0;
 
	if(n==a||n==b||n==c){
		cout<<"NO"<<endl;
		return 0;
	}


	for(int i=n;i>0;i--){
		for(int j=1;j<=3;j++){
			if(i-j<0)continue;
			if(i-j==a||i-j==b||i-j==c)continue;
			dp[i-j]=min(dp[i-j],dp[i]+1);
 
			// cout<<"i,j;"<<i<<" "<<j<<endl;
			// for(int i=0;i<n;i++){
			// 	cout<<dp[i]<<" ";
			// 	}cout<<endl;
			// 	cout<<"---------------"<<endl;
		}
	}

	// cout<<"-----------"<<endl;
	// for(int i=0;i<n;i++){
	// 	cout<<dp[i]<<" ";
	// }cout<<endl;
 
	if(dp[0]>100){
		cout<<"NO"<<endl;
	}else{
		cout<<"YES"<<endl;
	}
 
 
 
}

Submission Info

Judge Result