Submission #1711920

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,a;
bool li[310]={};

int main(){
	cin >> n;
	REP(i,0,3){
		cin >> a,li[a]=true;
		if(n==a){
			cout << "NO" << endl;
			return 0;
		}
	}
	
	int c=1;
	while(1){
		if(n>=3 and !li[n-3]) n-=3;
		else if(n>=2 and !li[n-2]) n-=2;
		else if(n>=1 and !li[n-1]) n-=1;
		else {cout << "NO" << endl; return 0;}
	
		c++;
		if(!n){cout << "YES" << endl; return 0;}
		if(c>100){cout << "NO" << endl; return 0;}
	}
	
	return 0;
}

Submission Info

Judge Result