Submission #6419747

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#define _USE_MATH_DEFINES
#include <math.h>
#include <iomanip>
#include <stdio.h>
#include <numeric>
#include <cmath>
#include <limits>
#include <bitset> 
#include <iterator> 
#include <map>
using namespace std;
long long divisorNum(long long);
long long kaijou(long long);

int main()
{
	int n, ng1, ng2, ng3;
	cin >> n >> ng1 >> ng2 >> ng3;
	
	for (int z = 0; z <= 100; z++) {
		for (int tmp = 1; tmp <= 100; tmp++) {
			int y = n - tmp - 2 * z;
			int x = tmp - y - z;
			if (x < 0 && y < 0 && z < 0)continue;
			if (x + y + z == n) {
				if (x + y + z == ng1 && x + y + z == ng2 && x + y + z == ng3)continue;
				else return cout << "YES" << endl, 0;
			}
		}
	}
	cout << "NO" << endl;
}

Submission Info

Judge Result