Submission #1091509
Source Code Expand
#include <iostream> #include <ccomplex> #include <vector> #include <cassert> #include <utility> #include <algorithm> #include <string> #include <deque> #include <queue> #include <functional> #include <cmath> #include <iomanip> #include <map> #include <numeric> #include <list> #include <assert.h> #include <math.h> #include <valarray> #include <stdio.h> #include <algorithm> #include <set> #include <complex> #include <list> #include <time.h> #include <stack> #include <locale> #include <clocale> #include <ctype.h> #include <wchar.h> using namespace std; typedef long long int LL; typedef pair<long long int, long long int> pii; typedef pair<double, double> pdd; #define SORT(c) sort((c).begin(),(c).end()) #define BACKSORT(c) sort((c).begin(),(c).end(),std::greater<LL>()) #define FOR(i,a,b) for(LL i=(a);i<(b);++i) #define REP(i,n) FOR(i,0,n) int xcomp(vector<LL>& a, vector<LL>& b) { return a[0] < b[0]; } #define XSORT(c) sort((c).begin(),(c).end(),xcomp) #define ALL(x) (x).begin(),(x).end() LL mod = 1000000007; int main() { LL n; cin >> n; LL sum = 0; REP(i, n) { LL x; cin >> x; if (x % 2 == 1) { sum++; } } if (sum % 2 == 0) { cout << "YES" << endl; } else { cout << "NO" << endl; } }
Submission Info
Submission Time | |
---|---|
Task | A - Addition |
User | ten986 |
Language | C++14 (GCC 5.4.1) |
Score | 300 |
Code Size | 1294 Byte |
Status | AC |
Exec Time | 67 ms |
Memory | 256 KB |
Judge Result
Set Name | Sample | All | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 300 / 300 | ||||
Status |
|
|
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 | 67 ms | 256 KB |
in10.txt | AC | 67 ms | 256 KB |
in11.txt | AC | 3 ms | 256 KB |
in12.txt | AC | 2 ms | 256 KB |
in2.txt | AC | 66 ms | 256 KB |
in3.txt | AC | 66 ms | 256 KB |
in4.txt | AC | 66 ms | 256 KB |
in5.txt | AC | 56 ms | 256 KB |
in6.txt | AC | 59 ms | 256 KB |
in7.txt | AC | 66 ms | 256 KB |
in8.txt | AC | 66 ms | 256 KB |
in9.txt | AC | 66 ms | 256 KB |
sample1.txt | AC | 3 ms | 256 KB |
sample2.txt | AC | 3 ms | 256 KB |