Submission #1774932

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;
int main(){
  int n;
  int ng[3];
  cin>>n>>ng[0]>>ng[1]>>ng[2];
  sort(ng,ng+3);
  if(n==ng[0]||n==ng[1]||n==ng[2]){
      cout<<"NO"<<endl;
  }else if(ng[0]+1==ng[1]&&ng[1]+1==ng[2]){
    cout<<"NO"<<endl;
  }else{
    int now;
    int dp[n+1];
    for(int i=n;i>=0;i--){
      for(int j=1;j<=3;j++){
	if(i-j!=ng[0]&&i-j!=ng[1]&&i-j!=ng[2]){
	  dp[i]=min(dp[i]+1,dp[i-j]);
	//[i]+1:引き算しないとき[i-j]:引き算するとき
	}
      }
    }
    if(dp[0]<=100)cout<<"YES"<<endl;
    else if(dp[0]>100)cout<<"NO"<<endl;
  }
}

Submission Info

Judge Result