Submission #1868576


Source Code Expand

#include <stdio.h>
#include <bits/stdc++.h>			

#define pb push_back
#define pf push_front
#define pp pop_back
#define sz(a) (int)(a.size())
#define mp make_pair
#define F first
#define S second
#define next _next
#define prev _prev
#define left _left
#define right _right
#define y1 _y1
#define all(x) x.begin(), x.end()

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const int N = (int)1e6 + 123;
const ll INF = (ll)1e18 + 123;
const int inf = (int)1e9 + 123;
const int MOD = (int)1e9 + 7;

void megaRandom() {
	unsigned int FOR;
 	asm("rdtsc" : "=A"(FOR));
  srand(FOR);
}

int n, a[N];
int cnt[5];

int main() {
	megaRandom();
	cin >> n;
	for(int i = 1; i <= n; i ++) {
		cin >> a[i];	
		cnt[a[i] % 2] ++;
	}	
	if(cnt[1] % 2) cout << "NO";
	else cout << "YES";
	return 0;         
}

Submission Info

Submission Time
Task A - Addition
User Aidyn_A
Language C++14 (GCC 5.4.1)
Score 300
Code Size 946 Byte
Status AC
Exec Time 54 ms
Memory 640 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 52 ms 640 KB
in10.txt AC 53 ms 640 KB
in11.txt AC 1 ms 256 KB
in12.txt AC 1 ms 256 KB
in2.txt AC 52 ms 640 KB
in3.txt AC 54 ms 640 KB
in4.txt AC 53 ms 640 KB
in5.txt AC 54 ms 640 KB
in6.txt AC 53 ms 640 KB
in7.txt AC 53 ms 640 KB
in8.txt AC 52 ms 640 KB
in9.txt AC 53 ms 640 KB
sample1.txt AC 1 ms 256 KB
sample2.txt AC 1 ms 256 KB