Submission #1091700


Source Code Expand

#include <cstdlib>
#include <cstdio>
#include <algorithm>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>
#include <deque>
#include <cstring>
#include <functional>
#include <climits>
#include <list>
#include <ctime>
#include <complex>

#define F1(x,y,z) for(int x=(y);x<(z);x++)
#define F2(x,y,z) for(int x=(y);x<=(z);x++)
#define F3(x,y,z) for(int x=(y);x>(z);x--)
#define F4(x,y,z) for(int x=(y);x>=(z);x--)
#define mp make_pair
#define pb push_back
#define LL long long
#define co complex<double>
#define fi first
#define se second

#define MAX 100005
#define AMAX 1025*1005
#define MOD 1000000007

#define f(c,d) ((1<<(c))*(d))

using namespace std;

int n,ta,x[2];

int main(){
	scanf("%d",&n);
	while(n--){
		scanf("%d",&ta);
		x[ta&1]++;
	}
	if(x[1]%2==1&&x[0])printf("NO\n");
	else printf("YES\n");
	#ifdef LOCAL_PROJECT
	system("pause");
	#endif
	return 0;
}

Submission Info

Submission Time
Task A - Addition
User nhho
Language C++14 (GCC 5.4.1)
Score 300
Code Size 970 Byte
Status AC
Exec Time 13 ms
Memory 128 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:40:16: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&n);
                ^
./Main.cpp:42:18: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d",&ta);
                  ^

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 13 ms 128 KB
in10.txt AC 13 ms 128 KB
in11.txt AC 1 ms 128 KB
in12.txt AC 1 ms 128 KB
in2.txt AC 13 ms 128 KB
in3.txt AC 13 ms 128 KB
in4.txt AC 13 ms 128 KB
in5.txt AC 13 ms 128 KB
in6.txt AC 13 ms 128 KB
in7.txt AC 13 ms 128 KB
in8.txt AC 13 ms 128 KB
in9.txt AC 13 ms 128 KB
sample1.txt AC 1 ms 128 KB
sample2.txt AC 1 ms 128 KB