Submission #4232007

---

Source Code Expand

#include <iostream>
#include <stdio.h>
#include <string>
#include <cstdlib>
#include <cmath>
#include <cstring>
#include <math.h>
#include <vector>
#include <algorithm>
#include <queue>
#include <stack>

using namespace std;

typedef unsigned long long ull;
typedef long long ll;

#define mod ((ull)1e9+7)
#define MAX ((ull)1e6)

ll pmod(ll n, ll p){
	ll m=n%mod;
	if(p==1) return m;
	ll ans=pmod((m*m)%mod, p/2)%mod;
	if(p%2==1) ans=(ans*m)%mod;
	return ans;
}

ll binom(ll n, ll k){
	ll a=1, b=1;
	for(ll i=0; i<k; i++){
		a=((a%mod)*((n-i)%mod))%mod;
		b=((b%mod)*((k-i)%mod))%mod;
	}
	return (a*pmod(b, mod-2))%mod;
}

int main(){
	int n, g1, g2, g3;
	cin >> n >> g1 >> g2 >> g3;
	int c=0;
	while(n!=0){
		if(n==g1 || n==g2 || n==g3){
			cout << "NO" << endl;
			return 0;
		}
		if(n-3>=0 && n-3!=g1 && n-3!=g2 && n-3!=g3) n-=3;
		else if(n-2>=0 && n-2!=g1 && n-2!=g2 && n-2!=g3) n-=2;
		else if(n-1>=0 && n-1!=g1 && n-1!=g2 && n-1!=g3) n-=1;
		else{
			cout << "NO" << endl;
			return 0;
		}
		c++;
	}
	if(c<=100) cout << "YES" << endl;
	else cout << "NO" << endl;
	return 0;
}

Submission Info

Judge Result