Submission #1229456

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<math.h>
#include<unordered_map>
using namespace std;
typedef long long ll;
const long double pi = 3.14159265358979323846264338327950288;
int main() {
	int n, sum = 0;
	cin >> n;
	for (int i = 0; i < n; i++) {
		ll a;
		cin >> a;
		if (a % 2 == 1)
			sum++;
	}
	string ans;
	if (sum % 2 == 0) {
		if (((n - sum) + (sum / 2)) % 2 == 0)
			ans = "YES\n";
		else
			ans = "NO\n";
	}
	else {
		if ((n - sum) % 2 == 1)
			ans = "YES\n";
		else
			ans = "NO\n";
	}
	cout << ans;
	cin >> ans;
}

Submission Info

Judge Result