Submission #188383

---

Source Code Expand

#include <string>
#include <vector>
#include <string.h>
#include <sstream>
#include <algorithm>
#include <iostream>
#include <functional>
#include <math.h>
#define MAX 100
 
using namespace std;
 
int main(){
	int n,cnt=0;
	vector <int> ng(3);
	cin>>n>>ng[0]>>ng[1]>>ng[2];
	sort(ng.begin(),ng.end());
	if(n==300 && cnt>=1)cout<<"NO"<<endl;
	else if(n==ng[0] || n==ng[1] || n==ng[2])cout<<"NO"<<endl;
	else{
		while(n>0){
			if(n-3==ng[0] || n-3==ng[1] || n-3==ng[2]){
				if(n-2==ng[0] || n-2==ng[1] || n-2==ng[2]){
					if(n-1==ng[0] || n-1==ng[1] || n-1==ng[2]){
						cout<<"NO"<<endl;
						return 0;
					}else{
						n-=1;
					}
				}else{
					n-=2;
				}
			}else{
				n-=3;
			}
			cnt++;
		}
	}
	if(cnt>100)cout<<"NO"<<endl;
	else cout<<"YES"<<endl;
		
	return 0;
}

Submission Info

Judge Result