Submission #1372909


Source Code Expand

#include <bits/stdc++.h>

using namespace std;

#define forn(i, s, f) for(int i = (s); i <= (f); ++i)
#define for1(i, f, s) for(int i = (f); i >= (s); --i)
#define fora(i, x) for (auto i : x)
#define show(x) cout << #x << " = " << x << " ";
#define skip continue;
#define pb push_back
#define _1 first
#define _2 second

typedef long long ll;

const int N3 = 1e3 + 5;
const int N4 = 1e4 + 5;
const int N5 = 1e5 + 5;
const int N6 = 1e6 + 5;
const int N7 = 1e7 + 5;
const int N8 = 1e8 + 5;
const int N9 = 1e9 + 5;
const int mod = N9 + 2;

int n, x, odd;

int main()
{
    cin >> n;
    forn (i, 1, n)
    {
        cin >> x;
        if (x % 2 == 1)
        {
            ++odd;
        }
    }
    cout << (odd % 2 == 0 ? "YES" : "NO");
}

Submission Info

Submission Time
Task A - Addition
User Bruteforcer_
Language C++14 (GCC 5.4.1)
Score 300
Code Size 776 Byte
Status AC
Exec Time 54 ms
Memory 256 KB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 16
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, sample1.txt, sample2.txt
Case Name Status Exec Time Memory
in1.txt AC 53 ms 256 KB
in10.txt AC 54 ms 256 KB
in11.txt AC 1 ms 256 KB
in12.txt AC 1 ms 256 KB
in2.txt AC 53 ms 256 KB
in3.txt AC 54 ms 256 KB
in4.txt AC 54 ms 256 KB
in5.txt AC 54 ms 256 KB
in6.txt AC 53 ms 256 KB
in7.txt AC 54 ms 256 KB
in8.txt AC 54 ms 256 KB
in9.txt AC 54 ms 256 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB