Submission #2861182

---

Source Code Expand

#include <iostream>
#include <string>
#include <vector>
#include <cstdlib>
#include <cstdio>
#include <cmath>
#include <algorithm>
#include <map>
#include <stack>
#include <queue>
#include <set>
#include <cstring>

using namespace std;
// ascending order
#define vsort(v) sort(v.begin(), v.end())
// descending order
#define vsort_r(v) sort(v.begin(), v.end(), greater<int>())
// ascending order
#define asort(array, N) sort(array, array + N)
// descending order
#define asort_r(array, N) sort(array, array + N, greater<int>())
#define vunique(v) v.erase(unique(v.begin(), v.end()), v.end())
#define mp make_pair
#define ts(x) to_string(x)
typedef long long ll;
typedef pair<int, int> P;
const ll INF = 1e18;

ll N;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	cin >> N;
	ll countOdd;
	for(int i = 0; i < N; i++) {
		int a;
		cin >> a;
		if(a % 2 != 0) countOdd++;
	}

	if(countOdd % 2 == 0) cout << "YES" << endl;
	else cout << "NO" << endl;
}

Submission Info

Judge Result