Submission #188380

---

Source Code Expand

#include <iostream>

using namespace std;
int dp[310]={0};

int main(){
    int N;
    int a[3];
    cin>>N>>a[0]>>a[1]>>a[2];

    for(int i = 0;i < 310;i++){
	dp[i] = 1000;
    }
    dp[N] = 0;
    for(int i = N;i >=0 ;i--){
	if(dp[i] != 1000 &&i != a[0]&&i != a[1]&&i != a[2]){
	    if(i -3 >=0&& i-3 != a[0]&&i -3!= a[1]&&i -3!= a[2]){
		dp[i - 3] = min(dp[i] + 1,dp[i - 3]);
	    }
	    if(i -2 >= 0&&i -2!= a[0]&&i -2!= a[1]&&i -2!= a[2]){
		dp[i - 2] = min(dp[i] + 1,dp[i - 2]);
	    }
	    if(i - 1 >= 0&&i -1!= a[0]&&i -1!= a[1]&&i -1!= a[2]){
		dp[i - 1] = min(dp[i] + 1,dp[i - 1]);
	    }
	}
    }
    if(dp[0] != 1000 &&dp[0] <=100){
	cout <<"YES"<<endl;
    }else{
	cout <<"NO"<<endl;
    }

    return 0;
}

Submission Info

Judge Result