Submission #1091697

---

Source Code Expand

#include <iostream>
#include <vector>
#include <cmath>
#include <cstdio>
#include <queue>
#include <set>
#include <map>
#include <climits>
#include <string>
#include <string.h>
#include <algorithm>

using namespace std;
#define fast ios::sync_with_stdio(false);cin.tie(0); cout.tie(0)
#define pb push_back
#define sz(s) (int)s.size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define forn(i, n) for (int i = 0; i < (int)(n); ++i)
#define for1(i, n) for (int i = 1; i <= (int)(n); ++i)

typedef long long ll;
typedef pair<ll, ll> pii;
const ll N = (ll)1e6 + 7;

ll mpow(ll a, ll b, ll m){
    ll ans=1;
    while(b){
        if(b&1) ans=ans*a%m;
        a=a*a%m;
        b/=2;
    }
    return ans;
}

ll modinv(ll a, ll m){
    return mpow(a,m-2,m);
}

int main() {
    fast;
    int n,a[100100],x=0;
    cin>>n;
    forn(i,n){
        cin>>a[i];
        if(a[i]&1) x++;
    }
    if(x%2==0) cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}

Submission Info

Judge Result