Submission #1091605


Source Code Expand

#include <algorithm>
#include <cassert>
#include <cfloat>
#include <climits>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <deque>
#include <iomanip>
#include <iostream>
#include <limits>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <tuple>
#include <vector>

#define FOR(i,k,n) for (int (i)=(k); (i)<(n); ++(i))
#define rep(i,n) FOR(i,0,n)
#define pb push_back
#define all(v) begin(v), end(v)
#define debug(x) cerr<< #x <<": "<<x<<endl
#define debug2(x,y) cerr<< #x <<": "<< x <<", "<< #y <<": "<< y <<endl

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<vector<int> > vvi;
typedef vector<ll> vll;
typedef vector<vector<ll> > vvll;
template<class T> using vv=vector<vector< T > >;

int main() {
  int n;
  scanf("%d", &n);
  int odd = 0;
  int even = 0;
  rep (i, n) {
    int tmp;
    scanf("%d", &tmp);
    if ((tmp&1) == 1) {
      odd += 1;
    }
  }
  if ((odd&1) == 0) {
    printf("YES\n");
  } else {
    printf("NO\n");
  }

  return 0;
}

Submission Info

Submission Time
Task A - Addition
User tspcx
Language C++14 (Clang 3.8.0)
Score 300
Code Size 1183 Byte
Status AC
Exec Time 19 ms
Memory 760 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 14
Set Name Test Cases
Sample sample1.txt, sample2.txt
All sample1.txt, sample2.txt, in1.txt, in10.txt, in11.txt, in12.txt, in2.txt, in3.txt, in4.txt, in5.txt, in6.txt, in7.txt, in8.txt, in9.txt
Case Name Status Exec Time Memory
in1.txt AC 19 ms 760 KB
in10.txt AC 15 ms 256 KB
in11.txt AC 2 ms 256 KB
in12.txt AC 3 ms 256 KB
in2.txt AC 15 ms 256 KB
in3.txt AC 15 ms 256 KB
in4.txt AC 15 ms 256 KB
in5.txt AC 15 ms 256 KB
in6.txt AC 15 ms 256 KB
in7.txt AC 15 ms 256 KB
in8.txt AC 15 ms 256 KB
in9.txt AC 15 ms 256 KB
sample1.txt AC 2 ms 256 KB
sample2.txt AC 3 ms 256 KB